IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Volume E92.D , Issue 6
Showing 1-15 articles out of 15 articles from the selected issue
Regular Section
  • Kazuya MATSUMOTO, Stanislav G. SEDUKHIN
    Type: PAPER
    Subject area: Computation and Computational Models
    2009 Volume E92.D Issue 6 Pages 1225-1231
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    The All-Pairs Shortest Paths (APSP) problem is a graph problem which can be solved by a three-nested loop program. The Cell Broadband Engine (Cell/B.E.) is a heterogeneous multi-core processor that offers the high single precision floating-point performance. In this paper, a solution of the APSP problem on the Cell/B.E. is presented. To maximize the performance of the Cell/B.E., a blocked algorithm for the APSP problem is used. The blocked algorithm enables reuse of data in registers and utilizes the memory hierarchy. We also describe several optimization techniques for effective implementation of the APSP problem on the Cell/B.E. The Cell/B.E. achieves the performance of 8.45Gflop/s for the APSP problem by using one SPE and 50.6Gflop/s by using six SPEs.
    Download PDF (331K)
  • Makoto YASUDA, Takeshi FURUHASHI
    Type: PAPER
    Subject area: Computation and Computational Models
    2009 Volume E92.D Issue 6 Pages 1232-1239
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    This article explains how to apply the deterministic annealing (DA) and simulated annealing (SA) methods to fuzzy entropy based fuzzy c-means clustering. By regularizing the fuzzy c-means method with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function, well known in statistical mechanics, is obtained, and, while optimizing its parameters by SA, the minimum of the Helmholtz free energy for fuzzy c-means clustering is searched by DA. Numerical experiments are performed and the obtained results indicate that this combinatorial algorithm of SA and DA can represent various cluster shapes and divide data more properly and stably than the standard single DA algorithm.
    Download PDF (1090K)
  • Jae-Woo CHANG, Jung-Ho UM
    Type: PAPER
    Subject area: Database
    2009 Volume E92.D Issue 6 Pages 1240-1249
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    Even though it is very important to retrieve similar trajectories with a given query trajectory, there has been a little research on trajectory retrieval in spatial networks, like road networks. In this paper, we propose an efficient indexing scheme for retrieving moving object trajectories in spatial networks. For this, we design a signature-based indexing scheme for efficiently dealing with the trajectories of current moving objects as well as for maintaining those of past moving objects. In addition, we provide an insertion algorithm for storing the segment information of a moving object trajectory as well as a retrieval algorithm to find a set of moving objects whose trajectories match the segments of a query trajectory. Finally, we show that our signature-based indexing scheme achieves at least twice better performance on trajectory retrieval than the leading trajectory indexing schemes, such as TB-tree, FNR-tree, and MON-tree.
    Download PDF (2851K)
  • Takafumi MATSUO, Tatsuhiro TSUCHIYA, Tohru KIKUNO
    Type: PAPER
    Subject area: Dependable Computing
    2009 Volume E92.D Issue 6 Pages 1250-1259
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    In this paper, we propose an unbounded model checking method for feature interaction verification for telecommunication systems. Unbounded model checking is a SAT-based verification method and has attracted recent attention as a powerful approach. The interpolation-based approach is one of the most promising unbounded model checking methods and has been proven to be effective for hardware verification. However, the application of unbounded model checking to asynchronous systems, such as telecommunication systems, has rarely been practiced. This is because, with the conventional encoding, the behavior of an asynchronous system can only be represented as a large propositional formula, thus resulting in large computational cost. To overcome this problem we propose to use a new scheme for encoding the behavior of the system and adapt the unbounded model checking algorithm to this encoding. By exploiting the concurrency of an asynchronous system, this encoding scheme allows a very concise formula to represent system's behavior. To demonstrate the effectiveness of our approach, we conduct experiments where 21 pairs of telecommunication services are verified using several methods including ours. The results show that our approach exhibits significant speed-up over unbounded model checking using the traditional encoding.
    Download PDF (210K)
  • Chan-gun LEE, Aloysius K. MOK, Prabhudev KONANA
    Type: PAPER
    Subject area: Dependable Computing
    2009 Volume E92.D Issue 6 Pages 1260-1267
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    We introduce the interval timing correlation, which can establish timing correlation conditions to handle interval timing timestamps. Interval timestamps are adopted to handle the temporal uncertainties in the timestamps of stream data. A probabilistic querying approach is taken in order to support timing predicates such as deadline, delay, and within over interval timestamps. A timing correlation condition entails a desired confidence threshold (minimum satisfaction probability). We define the interval timing correlation and discuss how to implement the algorithm. We present an analysis result which can effectively identify only tuples that need to be considered in determining the correlation. The performance of the proposed algorithm is shown.
    Download PDF (328K)
  • Takamichi SAITO
    Type: PAPER
    Subject area: Application Information Security
    2009 Volume E92.D Issue 6 Pages 1268-1279
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    Security protocol provides communication security for the internet. One of the important features of it is authentication with key exchange. Its correctness is a requirement of the whole of the communication security. In this paper, we introduce three attack models realized as their attack scenarios, and provide an authentication-protocol checker for applying three attack-scenarios based on the models. We also utilize it to check two popular security protocols: Secure SHell (SSH) and Secure Socket Layer/Transport Layer Security (SSL/TLS).
    Download PDF (287K)
  • Naoko NITTA, Noboru BABAGUCHI
    Type: PAPER
    Subject area: Image Processing and Video Processing
    2009 Volume E92.D Issue 6 Pages 1280-1288
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    Video summarization is defined as creating a video summary which includes only important scenes in the original video streams. In order to realize automatic video summarization, the significance of each scene needs to be determined. When targeted especially on broadcast sports videos, a play scene, which corresponds to a play, can be considered as a scene unit. The significance of every play scene can generally be determined based on the importance of the play in the game. Furthermore, the following two issues should be considered: 1) what is important depends on each user's preferences, and 2) the summaries should be tailored for media devices that each user has. Considering the above issues, this paper proposes a unified framework for user and device adaptation in summarizing broadcast sports videos. The proposed framework summarizes sports videos by selecting play scenes based on not only the importance of each play itself but also the users' preferences by using the metadata, which describes the semantic content of videos with keywords, and user profiles, which describe users' preference degrees for the keywords. The selected scenes are then presented in a proper way using various types of media such as video, image, or text according to device profiles which describe the device type. We experimentally verified the effectiveness of user adaptation by examining how the generated summaries are changed by different preference degrees and by comparing our results with/without using user profiles. The validity of device adaptation is also evaluated by conducting questionnaires using PCs and mobile phones as the media devices.
    Download PDF (2280K)
  • Pablo GARCIA TRIGO, Henry JOHAN, Takashi IMAGIRE, Tomoyuki NISHITA
    Type: PAPER
    Subject area: Image Recognition, Computer Vision
    2009 Volume E92.D Issue 6 Pages 1289-1295
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    We propose an interactive method for assisting the coloring process of 2D hand-drawn animated cartoons. It segments input frames (each hand-drawn drawing of the cartoon) into regions (areas surrounded by closed lines. E.g. the head, the hands) extracts their features, and then matches the regions between frames, allowing the user to fix coloring mistakes interactively. Its main contribution consists in storing matched regions in lists called “chains” for tracking how the region features vary along the animation. Consequently, the matching rate is improved and the matching mistakes are reduced, thus reducing the total effort needed until having a correctly colored cartoon.
    Download PDF (1138K)
  • Ruiqi GUO, Shinichiro OMACHI, Hirotomo ASO
    Type: PAPER
    Subject area: Image Recognition, Computer Vision
    2009 Volume E92.D Issue 6 Pages 1296-1303
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    To segment a shape into parts is an important problem in shape representation and analysis. We propose in this paper a novel framework of shape segmentation using deformation models learned from multiple shapes. The deformation model from the target image to every other image is then estimated. Finally, normalized-cut graph partition is applied to the graph constructed based on the similarity of local patches in the target image, and a segmentation of the shape is carried out. Experimental results for images from MPEG7 shape database show the effectiveness of the proposed method.
    Download PDF (1078K)
  • Alexis ANDRE, Suguru SAITO, Masayuki NAKAJIMA
    Type: PAPER
    Subject area: Image Recognition, Computer Vision
    2009 Volume E92.D Issue 6 Pages 1304-1311
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    We propose a sketch-based modeling system where all user input is performed from a unique viewpoint. The strokes drawn by the user must not then be restricted to the drawing plane: their orientation in the 3D space is automatically determined by the system. The desired surface is reconstructed from a grid made of two groups of similar lines, that are considered co-planar. The orientation of the two sets of planes is determined by assuming that at the intersection of a representative line of each group, those two lines are perpendicular.
    Download PDF (1900K)
  • Mitsuharu MATSUMOTO, Shuji HASHIMOTO
    Type: LETTER
    Subject area: Algorithm Theory
    2009 Volume E92.D Issue 6 Pages 1312-1315
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    ε-filter is a nonlinear filter for reducing noise and is applicable not only to speech signals but also to image signals. The filter design is simple and it can effectively reduce noise with an adequate filter parameter. This paper presents a method for estimating the optimal filter parameter of ε-filter based on signal-noise decorrelation and shows that it yields the optimal filter parameter concerning a wide range of noise levels. The proposed method is applicable where the noise to be removed is uncorrelated with signal, and it does not require any other knowledge such as noise variance and training data.
    Download PDF (285K)
  • Choonhwa LEE, Seungjae LEE, Eunsam KIM, Wonjun LEE
    Type: LETTER
    Subject area: System Programs
    2009 Volume E92.D Issue 6 Pages 1316-1319
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    This letter presents a new approach to provide inter-domain service compositions for OSGi environments. Our proposal of remote wire objects extends OSGi's wiring capability across the framework boundaries, so that even remote services can join in the composition. Hence, a better composition is made possible with a richer set of candidate services from foreign domains.
    Download PDF (710K)
  • Kihyeon KIM, Hanseok KO
    Type: LETTER
    Subject area: Speech and Hearing
    2009 Volume E92.D Issue 6 Pages 1320-1323
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    This Letter proposes an optimal gain filter for the perceptual acoustic echo suppressor. We designed an optimally-modified log-spectral amplitude estimation algorithm for the gain filter in order to achieve robust suppression of echo and noise. A new parameter including information about interferences (echo and noise) of single-talk duration is statistically analyzed, and then the speech absence probability and the a posteriori SNR are judiciously estimated to determine the optimal solution. The experiments show that the proposed gain filter attains a significantly improved reduction of echo and noise with less speech distortion.
    Download PDF (92K)
  • Shih-Hsuan YANG, Bo-Yuan CHEN, Kuo-Hsin WANG
    Type: LETTER
    Subject area: Image Processing and Video Processing
    2009 Volume E92.D Issue 6 Pages 1324-1327
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    A new H.264 fast inter-mode decision algorithm based on coded block patterns is presented. Compared to the exhaustive mode search, the proposed method achieves an average 57% reduction in computation time with negligible degradation in visual quality. The speed and rate-distortion performance is comparable to known fast algorithms that involve more elaborate mechanisms.
    Download PDF (672K)
  • Yuka MINEGISHI, Takashi WATANABE, Makoto YOSHIZAWA
    Type: LETTER
    Subject area: Biological Engineering
    2009 Volume E92.D Issue 6 Pages 1328-1330
    Published: June 01, 2009
    Released: June 01, 2009
    JOURNALS FREE ACCESS
    In this study, we aimed to realize a method of presenting dynamic electrocutaneous sensation patterns as a user interface for persons with disabilities. In this study, the previously used pulse width (200µs) was used in pattern recognition testing on the forearm and was compared with the short pulse width (80µs) used for stimulation. A cathodic pulse with a frequency of 100pps, which was suggested to be suitable in our previous study, was used. Experimental results on neurologically intact subjects suggested that the previously used pulse width was suitable and that a short pulse width would not be effective for stabilizing the stimulation amplitude or for improving the pattern recognition ability of our method.
    Download PDF (172K)
feedback
Top