著者

Jun-Gil KIM Kyung-Soon LEE

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E97-D, no.4, pp.685-693, 2014-04-01

---

News articles usually represent a biased viewpoint on contentious issues, potentially causing social problems. To mitigate this media bias, we propose a novel framework for predicting orientation of a news article by analyzing social user behaviors in Twitter. Highly active users tend to have consistent behavior patterns in social network by retweeting behavior among users with the same viewpoints for contentious issues. The bias ratio of highly active users is measured to predict orientation of users. Then political orientation of a news article is predicted based on the bias ratio of users, mutual retweeting and opinion analysis of tweet documents. The analysis of user behavior shows that users with the value of 1 in bias ratio are 88.82%. It indicates that most of users have distinctive orientation. Our prediction method based on orientation of users achieved 88.6% performance in accuracy. Experimental results show significant improvements over the SVM classification. These results show that proposed detection method is effective in social network.

著者

SHIGESADA Yukihiko KOSHIZUKA Noboru SAKUMURA Ken

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.85, no.3, 2002-03-01

---

Recently, public computer terminals called "kiosk terminal" become popular in museums. Kiosk terminals explain the exhibitions of the museum by displaying digital contents constructed on the WWW. Generally, existing WWW browsers are used for the browser application for kiosk terminals. However, because existing WWW browsers are designed for the personal usage, there are not suitable for the public usage such as the kiosk terminal in the museum. In this paper, we propose a new browser named "BTRON Kiosk Browser" which can browse digital contents on the WWW and provides suitable user interfaces for the public kiosk terminal. We explain technical problems which are necessary to give suitable user interfaces for the public kiosk WWW browser, and propose our BKB user interface techniques to overcome these problems.

著者

Yoshitaka INOUE Takamichi MIYATA Yoshinori SAKAI

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E95-D, no.1, pp.247-255, 2012-01-01

---

Recently, a novel approach to color image compression based on colorization has been presented. The conventional method for colorization-based image coding tends to lose the local oscillation of chrominance components that the original images had. A large number of color assignments is required to restore these oscillations. On the other hand, previous studies suggest that an oscillation of a chrominance component correlates with the oscillation of a corresponding luminance component. In this paper, we propose a new colorization-based image coding method that utilizes the local correlation between texture components of luminance and chrominance. These texture components are obtained by a total variation regularized energy minimization method. The local correlation relationships are approximated by linear functions, and their coefficients are extracted by an optimization method. This key idea enables us to represent the oscillations of chrominance components by using only a few pieces of information. Experimental results showed that our method can restore the local oscillation and code images more efficiently than the conventional method, JPEG, or JPEG2000 at a high compression rate.

著者

TRAN Nhat-Phuong LEE Myungho HONG Sugwon LEE Seung-Jae

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE Transactions on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.96, no.8, pp.1685-1695, 2013

被引用文献数

1

---

Data encryption and decryption are common operations in network-based application programs that must offer security. In order to keep pace with the high data input rate of network-based applications such as the multimedia data streaming, real-time processing of the data encryption/decryption is crucial. In this paper, we propose a new parallelization approach to improve the throughput performance for the de-facto standard data encryption and decryption algorithm, AES-CTR (Counter mode of AES). The new approach extends the size of the block encrypted at one time across the unit block boundaries, thus effectively encrypting multiple unit blocks at the same time. This reduces the associated parallelization overheads such as the number of procedure calls, the scheduling and the synchronizations compared with previous approaches. Therefore, this leads to significant throughput performance improvements on a computing platform with a general-purpose multi-core processor and a Graphic Processing Unit (GPU).

著者

Nitin SINGHAL Jin Woo YOO Ho Yeol CHOI In Kyu PARK

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E95.D, no.5, pp.1475-1484, 2012-05-01 (Released:2012-05-01)

参考文献数

18

被引用文献数

6 13

---

In this paper, we analyze the key factors underlying the implementation, evaluation, and optimization of image processing and computer vision algorithms on embedded GPU using OpenGL ES 2.0 shader model. First, we present the characteristics of the embedded GPU and its inherent advantage when compared to embedded CPU. Additionally, we propose techniques to achieve increased performance with optimized shader design. To show the effectiveness of the proposed techniques, we employ cartoon-style non-photorealistic rendering (NPR), speeded-up robust feature (SURF) detection, and stereo matching as our example algorithms. Performance is evaluated in terms of the execution time and speed-up achieved in comparison with the implementation on embedded CPU.

著者

TIAN Li KAMATA Sei-ichiro TSUNEYOSHI Kazuyuki TANG Haijiang

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.89, no.1, pp.290-297, 2006-01-01

参考文献数

13

被引用文献数

10

---

To find the best transformation between a "model" point set and an "image" point set is the main purpose of point pattern matching. The similarity measure plays a pivotal role and is used to determine the degree of resemblance between two objects. Although some well-known Hausdorff distance measures work well for this task, they are very computationally expensive and suffer from the noise points. In this paper, we propose a novel similarity measure using the Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in the one-dimensional (1-D) sequence instead of in the two-dimensional (2-D) space, which greatly reduces the computational complexity. By applying a threshold elimination function, large distance values caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The proposed algorithm has been applied to the task of matching edge maps with noise. The experimental results show that HSD can provide sufficient information for image matching within low computational complexity. We believe this sets a new direction for the research of point pattern recognition.

著者

SUZUKI Nobutaka FUKUSHIMA Yuji IKEDA Kosetsu

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E96-D, no.5, pp.1029-1042, 2013-05

被引用文献数

1

---

In this paper, we consider the XPath satisfiability problem under restricted DTDs called “duplicate free”. For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an empty set without evaluating it. However, it is shown that the XPath satisfiability problem is intractable for a large number of XPath fragments. In this paper, we consider simple XPath fragments under two restrictions: (i) only a label can be specified as a node test and (ii) operators such as qualifier ([ ]) and path union (∪) are not allowed. We first show that, for some small XPath fragments under the above restrictions, the satisfiability problem is NP-complete under DTDs without any restriction. Then we show that there exist XPath fragments, containing the above small fragments, for which the satisfiability problem is in PTIME under duplicate-free DTDs.

著者

Chika NAGAOKA Masashi KOMORI

出版者

一般社団法人 電子情報通信学会

雑誌

IEICE Transactions on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E91.D, no.6, pp.1634-1640, 2008-06-01 (Released:2010-03-01)

参考文献数

17

被引用文献数

2 41

---

Body movement synchrony (i. e. rhythmic synchronization between the body movements of interacting partners) has been described by subjective impressions of skilled counselors and has been considered to reflect the depth of the client-counselor relationship. This study analyzed temporal changes in body movement synchrony through a video analysis of client-counselor dialogues in counseling sessions. Four 50-minute psychotherapeutic counseling sessions were analyzed, including two negatively evaluated sessions (low evaluation groups) and two positively evaluated sessions (high evaluation groups). In addition, two 50-minute ordinary advice sessions between two high school teachers and the clients in the high rating group were analyzed. All sessions represent role-playing. The intensity of the participants' body movement was measured using a video-based system. Temporal change of body movement synchrony was analyzed using moving correlations of the intensity between the two time series. The results revealed (1) A consistent temporal pattern among the four counseling cases, though the moving correlation coefficients were higher for the high evaluation group than the low evaluation group and (2) Different temporal patterns for the counseling and advice sessions even when the clients were the same. These results were discussed from the perspective of the quality of client-counselor relationship.

著者

Kazuya HARAGUCHI Hirotaka ONO

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E96-D, no.3, pp.481-488, 2013-03-01

---

BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.

著者

Yuichiro TAJIMA Kinya FUDANO Koichi ITO Takafumi AOKI

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E96-D, no.4, pp.826-835, 2013-04-01

---

This paper presents a fast and accurate volume correspondence matching method using 3D Phase-Only Correlation (POC). The proposed method employs (i) a coarse-to-fine strategy using multi-scale volume pyramids for correspondence search and (ii) high-accuracy POC-based local block matching for finding dense volume correspondence with sub-voxel displacement accuracy. This paper also proposes its GPU implementation to achieve fast and practical computation of volume registration. Experimental evaluation shows that the proposed approach exhibits higher accuracy and lower computational cost compared with conventional method. We also demonstrate that the GPU implementation of the proposed method can align two volume data in several seconds, which is suitable for practical use in the image-guided radiation therapy.

著者

Akisato KIMURA Ryo YONETANI Takatsugu HIRAYAMA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E96-D, no.3, pp.562-578, 2013-03-01

---

We humans are easily able to instantaneously detect the regions in a visual scene that are most likely to contain something of interest. Exploiting this pre-selection mechanism called visual attention for image and video processing systems would make them more sophisticated and therefore more useful. This paper briefly describes various computational models of human visual attention and their development, as well as related psychophysical findings. In particular, our objective is to carefully distinguish several types of studies related to human visual attention and saliency as a measure of attentiveness, and to provide a taxonomy from several viewpoints such as the main objective, the use of additional cues and mathematical principles. This survey finally discusses possible future directions for research into human visual attention and saliency computation.

著者

Liu Shaoming Tanaka Eiichi Masuda Sumio

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.77, no.10, pp.1094-1105, 1994-10-25

被引用文献数

5

---

Several distances between trees have been proposed. However, most of the reports on distances have dealt with rooted and ordered trees. This paper proposes two distances between unrooted and cyclically ordered trees (CO-trees) and their computing methods. A CO-tree is a tree embedded in a plane. These distances are defined based on Tai's mapping (TM) and a strongly structure preserving mapping (SSPM) between CO-trees. The time complexities to compute the distances between two CO-trees T_a and T_b are O_T(N^aN^b) for the distance based on a TM and O_T(m_am_bN_aN_b) for that on an SSPM, respectively, where m_a(m_b) and N_a(N_b) are the largest degree of a vertex and the number of vertices of T_a(T_b), respectively. The space complexities of both methods are O_S(N_aN_b). Those distances can be applied to the clustering of CO-trees.

著者

Lihua ZHAO Ryutaro ICHISE

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Information and Systems (ISSN:09168532)

巻号頁・発行日

vol.E96-D, no.1, pp.40-50, 2013-01-01

---

The Linking Open Data (LOD) cloud is a collection of linked Resource Description Framework (RDF) data with over 31 billion RDF triples. Accessing linked data is a challenging task because each data set in the LOD cloud has a specific ontology schema, and familiarity with the ontology schema used is required in order to query various linked data sets. However, manually checking each data set is time-consuming, especially when many data sets from various domains are used. This difficulty can be overcome without user interaction by using an automatic method that integrates different ontology schema. In this paper, we propose a Mid-Ontology learning approach that can automatically construct a simple ontology, linking related ontology predicates (class or property) in different data sets. Our Mid-Ontology learning approach consists of three main phases: data collection, predicate grouping, and Mid-Ontology construction. Experiments show that our Mid-Ontology learning approach successfully integrates diverse ontology schema with a high quality, and effectively retrieves related information with the constructed Mid-Ontology.

著者

KIM Woosuk KUZUOKA Hideaki SUZUKI Kenji

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E95-D, no.10, pp.2447-2455, 2012-10

---

The style of a gesture provides significant information for communication, and thus understanding the style is of great importance in improving gestural interfaces using hand gestures. We present a novel method to estimate temporal and spatial scale—which are considered principal elements of the style—of hand gestures. Gesture synchronization is proposed for matching progression between spatio-temporally varying gestures, and scales are estimated based on the progression matching. For comparing gestures of various sizes and speeds, gesture representation is defined by adopting turning angle representation. Also, LCSS is used as a similarity measure for reliability and robustness to noise and outliers. Performance of our algorithm is evaluated with synthesized data to show the accuracy and robustness to noise and experiments are carried out using recorded hand gestures to analyze applicability under real-world situations.

著者

OMOTE Kazumasa KATO Kazuhiko

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.5, pp.1080-1086, 2010-05

---

In key-recovery methods using smart cards, a user can recover the disk encryption key in cooperation with the system administrator, even if the user has lost the smart card including the disk encryption key. However, the disk encryption key is known to the system administrator in advance in most key-recovery methods. Hence user's disk data may be read by the system administrator. Furthermore, if the disk encryption key is not known to the system administrator in advance, it is difficult to achieve a key authentication.In this paper, we propose a scheme which enables to recover the disk encryption key when the user's smart card is lost. In our scheme, the disk encryption key is not preserved anywhere and then the system administrator cannot know the key before key-recovery phase. Only someone who has a user's smart card and knows the user's password can decrypt that user's disk data. Furthermore, we measured the processing time required for user authentication in an experimental environment using a virtual machine monitor. As a result, we found that this processing time is short enough to be practical.

著者

TAKAHASHII Tsubasa KITAGAWA Hiroyuki WATANABE Keita

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.6, pp.1403-1413, 2010-06

被引用文献数

1 2

---

Social bookmarking services have recently made it possible for us to register and share our own bookmarks on the web and are attracting attention. The services let us get structured data: (URL, Username, Timestamp, Tag Set). And these data represent user interest in web pages. The number of bookmarks is a barometer of web page value. Some web pages have many bookmarks, but most of those bookmarks may have been posted far in the past. Therefore, even if a web page has many bookmarks, their value is not guaranteed. If most of the bookmarks are very old, the page may be obsolete. In this paper, by focusing on the timestamp sequence of social bookmarkings on web pages, we model their activation levels representing current values. Further, we improve our previously proposed ranking method for web search by introducing the activation level concept. Finally, through experiments, we show effectiveness of the proposed ranking method.

著者

SUZUKI Nobutaka

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.8, pp.2198-2212, 2010-08

被引用文献数

1 3

---

DTDs are continuously updated according to changes in the real world. Let t be an XML document valid against a DTD D, and suppose that D is updated by an update script s. In general, we cannot uniquely “infer” a transformation of t from s, i.e., we cannot uniquely determine the elements in t that should be deleted and/or the positions in t that new elements should be inserted into. In this paper, we consider inferring K optimum transformations of t from s so that a user finds the most desirable transformation more easily. We first show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Then, assuming that an update script is of length one, we show an algorithm for solving the problem, which runs in time polynomial of

著者

NAKATANI Takako HORI Shouzo UBAYASHI Naoyasu KATAMINE Keiichi HASHIMOTO Masaaki

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.8, pp.2182-2189, 2010-08

被引用文献数

1 2

---

Requirements changes sometimes cause a project to fail. A lot of projects now follow incremental development processes so that new requirements and requirements changes can be incorporated as soon as possible. These processes are called integrated requirements processes, which function to integrate requirements processes with other developmental processes. We have quantitatively and qualitatively investigated the requirements processes of a specific project from beginning to end. Our focus is to clarify the types of necessary requirements based on the components contained within a certain portion of the software architecture. Further, each type reveals its typical requirements processes through its own rationale. This case study is a system to manage the orders and services of a restaurant. In this paper, we introduce the case and categorize its requirements processes based on the components of the system and the qualitative characteristics of ISO-9126. We could identify seven categories of the typical requirements process to be managed and/or controlled. Each category reveals its typical requirements processes and their characteristics. The case study is our first step of practical integrated requirements engineering.

著者

ADNAN SATO Mitsuhisa

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E95-D, no.6, pp.1565-1576, 2012-06

被引用文献数

2

---

Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in parallel computing. Work stealing is an effective load balancing strategy for parallel computing. In this paper, we present dynamic work stealing strategies in a lazy-task creation technique for efficient fine-grain task scheduling. The basic idea is to control load balancing granularity depending on the number of task parents in a stack. The dynamic-length strategy of work stealing uses run-time information, which is information on the load of the victim, to determine the number of tasks that a thief is allowed to steal. We compare it with the bottommost first work stealing strategy used in StackThread/MP, and the fixed-length strategy of work stealing, where a thief requests to steal a fixed number of tasks, as well as other multithreaded frameworks such as Cilk and OpenMP task implementations. The experiments show that the dynamic-length strategy of work stealing performs well in irregular workloads such as in UTS benchmarks, as well as in regular workloads such as Fibonacci, Strassen's matrix multiplication, FFT, and Sparse-LU factorization. The dynamic-length strategy works better than the fixed-length strategy because it is more flexible than the latter; this strategy can avoid load imbalance due to overstealing.

著者

OHKAWA Yasuhiro FUKUI Kazuhiro

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E95.D, no.6, pp.1619-1627, 2012-06

被引用文献数

13 3

---

This paper proposes a method for recognizing hand-shapes by using multi-viewpoint image sets. The recognition of a hand-shape is a difficult problem, as appearance of the hand changes largely depending on viewpoint, illumination conditions and individual characteristics. To overcome this problem, we apply the Kernel Orthogonal Mutual Subspace Method (KOMSM) to shift-invariance features obtained from multi-viewpoint images of a hand. When applying KOMSM to hand recognition with a lot of learning images from each class, it is necessary to consider how to run the KOMSM with heavy computational cost due to the kernel trick technique. We propose a new method that can drastically reduce the computational cost of KOMSM by adopting centroids and the number of images belonging to the centroids, which are obtained by using k-means clustering. The validity of the proposed method is demonstrated through evaluation experiments using multi-viewpoint image sets of 30 classes of hand-shapes.