IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Volume E97.D , Issue 2
Showing 1-31 articles out of 31 articles from the selected issue
Regular Section
  • Chaoqing WANG, Tielong SHEN, Haibo JI
    Type: PAPER
    Subject area: Fundamentals of Information Systems
    2014 Volume E97.D Issue 2 Pages 175-183
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This paper presents sufficient conditions for the existence of a common quadratic Lyapunov functions for two classes of switched linear systems which possess negative row strictly diagonally dominant and diagonalizable stable state matrices, respectively. Numerical examples will be given to verify the correctness of the proposed theorems.
    Download PDF (436K)
  • Youngjoo SHIN, Kwangjo KIM
    Type: PAPER
    Subject area: Fundamentals of Information Systems
    2014 Volume E97.D Issue 2 Pages 184-197
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Outsourcing to a cloud storage brings forth new challenges for the efficient utilization of computing resources as well as simultaneously maintaining privacy and security for the outsourced data. Data deduplication refers to a technique that eliminates redundant data on the storage and the network, and is considered to be one of the most-promising technologies that offers efficient resource utilization in the cloud computing. In terms of data security, however, deduplication obstructs applying encryption on the outsourced data and even causes a side channel through which information can be leaked. Achieving both efficient resource utilization and data security still remains open. This paper addresses this challenging issue and proposes a novel solution that enables data deduplication while also providing the required data security and privacy. We achieve this goal by constructing and utilizing equality predicate encryption schemes which allow to know only equivalence relations between encrypted data. We also utilize a hybrid approach for data deduplication to prevent information leakage due to the side channel. The performance and security analyses indicate that the proposed scheme is efficient to securely manage the outsourced data in the cloud computing.
    Download PDF (500K)
  • Xi WANG, Shaoying LIU
    Type: PAPER
    Subject area: Software System
    2014 Volume E97.D Issue 2 Pages 198-212
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Formalizing requirements in formal specifications is an effective way to deepen the understanding of the envisioned system and reduce ambiguities in the original requirements. However, it requires mathematical sophistication and considerable experience in using formal notations, which remains a challenge to many practitioners. To handle this challenge, this paper describes a pattern-based approach to facilitate the formalization of requirements. In this approach, a pattern system is pre-defined to guide requirements formalization where each pattern provides a specific solution for formalizing one kind of function into a formal expression. All of the patterns are classified and organized into a hierarchical structure according to the functions they can be used to formalize. The distinct characteristic of our approach is that all of the patterns are stored on computer as knowledge for creating effective guidance to facilitate the developer in requirements formalization; they are “understood” only by the computer but transparent to the developer. We also describe a prototype tool that supports the approach. It adopts Hierarchical Finite State Machine (HFSM) to represent the pattern knowledge and implements an algorithm for applying it to assist requirements formalization. Two experiments on the tool are presented to demonstrate the effectiveness of the approach.
    Download PDF (2090K)
  • Hieu Hanh LE, Satoshi HIKIDA, Haruo YOKOTA
    Type: PAPER
    Subject area: Data Engineering, Web Information Systems
    2014 Volume E97.D Issue 2 Pages 213-222
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Energy-aware distributed file systems are increasingly moving toward power-proportional designs. However, current works have not considered the cost of updating data sets that were modified in a low-power mode, where a subset of nodes were powered off. In detail, when the system moves to a high-power mode, it must internally replicate the updated data to the reactivated nodes. Effectively reflecting the updated data is vital in making a distributed file system, such as the Hadoop Distributed File System (HDFS), power proportional. In the current HDFS design, when the system changes power mode, the block replication process is ineffectively restrained by a single NameNode because of access congestion of the metadata information of blocks. This paper presents a novel architecture, a NameNode and DataNode Coupling Hadoop Distributed File System (NDCouplingHDFS), which effectively reflects the updated blocks when the system goes into high-power mode. This is achieved by coupling metadata management and data management at each node to efficiently localize the range of blocks maintained by the metadata. Experiments using actual machines show that NDCouplingHDFS is able to significantly reduce the execution time required to move updated blocks by 46% relative to the normal HDFS. Moreover, NDCouplingHDFS is capable of increasing the throughput of the system supporting MapReduce by applying an index in metadata management.
    Download PDF (1538K)
  • Jun ZENG, Brendan FLANAGAN, Sachio HIROKAWA, Eisuke ITO
    Type: PAPER
    Subject area: Data Engineering, Web Information Systems
    2014 Volume E97.D Issue 2 Pages 223-230
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Web page segmentation has a variety of benefits and potential web applications. Early techniques of web page segmentation are mainly based on machine learning algorithms and rule-based heuristics, which cannot be used for large-scale page segmentation. In this paper, we propose a formulated page segmentation method using visual semantics. Instead of analyzing the visual cues of web pages, this method utilizes three measures to formulate the visual semantics: layout tree is used to recognize the visual similar blocks; seam degree is used to describe how neatly the blocks are arranged; content similarity is used to describe the content coherent degree between blocks. A comparison experiment was done using the VIPS algorithm as a baseline. Experiment results show that the proposed method can divide a Web page into appropriate semantic segments.
    Download PDF (1165K)
  • Junya NAKAMURA, Tadashi ARARAGI, Shigeru MASUYAMA, Toshimitsu MASUZAWA
    Type: PAPER
    Subject area: Dependable Computing
    2014 Volume E97.D Issue 2 Pages 231-244
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    We propose a fast and resource-efficient agreement protocol on a request set, which is used to realize Byzantine fault tolerant server replication. Although most existing randomized protocols for Byzantine agreement exploit a modular approach, that is, a combination of agreement on a bit value and a reduction of request set values to the bit values, our protocol directly solves the multi-valued agreement problem for request sets. We introduce a novel coin tossing scheme to select a candidate of an agreed request set randomly. This coin toss allows our protocol to reduce resource consumption and to attain faster response time than the existing representative protocols.
    Download PDF (1507K)
  • Dandan WANG, Qingcai CHEN, Xiaolong WANG
    Type: PAPER
    Subject area: Artificial Intelligence, Data Mining
    2014 Volume E97.D Issue 2 Pages 245-254
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Text Categorization (TC) is a task of classifying a set of documents into one or more predefined categories. Centroid-based method, a very popular TC method, aims to make classifiers simple and efficient by constructing one prototype vector for each class. It classifies a document into the class that owns the prototype vector nearest to the document. Many studies have been done on constructing prototype vectors. However, the basic philosophies of these methods are quite different from each other. It makes the comparison and selection of centroid-based TC methods very difficult. It also makes the further development of centroid-based TC methods more challenging. In this paper, based on the observation of its general procedure, the centroid-based text classification is treated as a kind of ranking task, and a unified framework for centroid-based TC methods is proposed. The goal of this unified framework is to classify a text via ranking all possible classes by document-class similarities. Prototype vectors are constructed based on various loss functions for ranking classes. Under this framework, three popular centroid-based methods: Rocchio, Hypothesis Margin Centroid and DragPushing are unified and their details are discussed. A novel centroid-based TC method called SLRCM that uses a smoothing ranking loss function is further proposed. Experiments conducted on several standard databases show that the proposed SLRCM method outperforms the compared centroid-based methods and reaches the same performance as the state-of-the-art TC methods.
    Download PDF (667K)
  • Jungang XU, Hui LI, Yan ZHAO, Ben HE
    Type: PAPER
    Subject area: Artificial Intelligence, Data Mining
    2014 Volume E97.D Issue 2 Pages 255-265
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Even with the recent development of new types of social networking services such as microblogs, Bulletin Board Systems (BBS) remains popular for local communities and vertical discussions. These BBS sites have high volume of traffic everyday with user discussions on a variety of topics. Therefore it is difficult for BBS visitors to find the posts that they are interested in from the large amount of discussion threads. We attempt to explore several main characteristics of BBS, including organizational flexibility of BBS texts, high data volume and aging characteristic of BBS topics. Based on these characteristics, we propose a novel method of Online Topic Detection (OTD) on BBS, which mainly includes a representative post selection procedure based on Markov chain model and an efficient topic clustering algorithm with candidate topic set generation based on Aging Theory. Experimental results show that our method improves the performance of OTD in BBS environment in both detection accuracy and time efficiency. In addition, analysis on the aging characteristic of discussion topics shows that the generation and aging of topics on BBS is very fast, so it is wise to introduce candidate topic set generation strategy based on Aging Theory into the topic clustering algorithm.
    Download PDF (1762K)
  • Daisuke OCHI, Hideaki KIMATA, Yoshinori KUSACHI, Kosuke TAKAHASHI, Aki ...
    Type: PAPER
    Subject area: Human-computer Interaction
    2014 Volume E97.D Issue 2 Pages 266-274
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Due to the recent progress made in camera and network environments, on-line video services enable people around the world to watch or share high-quality HD videos that can record a wider angle without losing objects' details in each image. As a result, users of these services can watch videos in different ways with different ROIs (Regions of Interest), especially when there are multiple objects in a scene, and thus there are few common ways for them to transfer their impressions for each scene directly. Posting messages is currently the usual way but it does not sufficiently enable all users to transfer their impressions. To transfer a user's impressions directly and provide users with a richer video watching experience, we propose a system that enables them to extract their favorite parts of videos as ROI trajectories through simple and intuitive manipulation of their tablet device. It also enables them to share a recorded trajectory with others after stabilizing it in a manner that should be satisfactory to every user. Using statistical analysis of user manipulations, we have demonstrated an approach to trajectory stabilization that can eliminate undesirable or uncomfortable elements due to tablet-specific manipulations. The system's validity has been confirmed by subjective evaluations.
    Download PDF (1603K)
  • Xinpeng ZHANG, Yusuke YAMADA, Takekazu KATO, Takashi MATSUYAMA
    Type: PAPER
    Subject area: Pattern Recognition
    2014 Volume E97.D Issue 2 Pages 275-284
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This paper describes a novel method for the bi-directional transformation between the power consumption patterns of appliances and human living activities. We have been proposing a demand-side energy management system that aims to cut down the peak power consumption and save the electric energy in a household while keeping user's quality of life based on the plan of electricity use and the dynamic priorities of the appliances. The plan of electricity use could be established in advance by predicting appliance power consumption. Regarding the priority of each appliance, it changes according to user's daily living activities, such as cooking, bathing, or entertainment. To evaluate real-time appliance priorities, real-time living activity estimation is needed. In this paper, we address the problem of the bi-directional transformation between personal living activities and power consumption patterns of appliances. We assume that personal living activities and appliance power consumption patterns are related via the following two elements: personal appliance usage patterns, and the location of people. We first propose a Living Activity - Power Consumption Model as a generative model to represent the relationship between living activities and appliance power consumption patterns, via the two elements. We then propose a method for the bidirectional transformation between living activities and appliance power consumption patterns on the model, including the estimation of personal living activities from measured appliance power consumption patterns, and the generation of appliance power consumption patterns from given living activities. Experiments conducted on real daily life demonstrate that our method can estimate living activities that are almost consistent with the real ones. We also confirm through case study that our method is applicable for simulating appliance power consumption patterns. Our contributions in this paper would be effective in saving electric energy, and may be applied to remotely monitor the daily living of older people.
    Download PDF (2421K)
  • Van Hai DO, Xiong XIAO, Eng Siong CHNG, Haizhou LI
    Type: PAPER
    Subject area: Speech and Hearing
    2014 Volume E97.D Issue 2 Pages 285-295
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This paper presents a novel acoustic modeling technique of large vocabulary automatic speech recognition for under-resourced languages by leveraging well-trained acoustic models of other languages (called source languages). The idea is to use source language acoustic model to score the acoustic features of the target language, and then map these scores to the posteriors of the target phones using a classifier. The target phone posteriors are then used for decoding in the usual way of hybrid acoustic modeling. The motivation of such a strategy is that human languages usually share similar phone sets and hence it may be easier to predict the target phone posteriors from the scores generated by source language acoustic models than to train from scratch an under-resourced language acoustic model. The proposed method is evaluated using on the Aurora-4 task with less than 1 hour of training data. Two types of source language acoustic models are considered, i.e. hybrid HMM/MLP and conventional HMM/GMM models. In addition, we also use triphone tied states in the mapping. Our experimental results show that by leveraging well trained Malay and Hungarian acoustic models, we achieved 9.0% word error rate (WER) given 55 minutes of English training data. This is close to the WER of 7.9% obtained by using the full 15 hours of training data and much better than the WER of 14.4% obtained by conventional acoustic modeling techniques with the same 55 minutes of training data.
    Download PDF (487K)
  • Hirokatsu KATAOKA, Kimimasa TAMURA, Kenji IWATA, Yutaka SATOH, Yasuhir ...
    Type: PAPER
    Subject area: Image Recognition, Computer Vision
    2014 Volume E97.D Issue 2 Pages 296-304
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    The percentage of pedestrian deaths in traffic accidents is on the rise in Japan. In recent years, there have been calls for measures to be introduced to protect vulnerable road users such as pedestrians and cyclists. In this study, a method to detect and track pedestrians using an in-vehicle camera is presented. We improve the technology of detecting pedestrians by using the highly accurate images obtained with a monocular camera. In the detection step, we employ ECoHOG as the feature descriptor; it accumulates the integrated gradient intensities. In the tracking step, we apply an effective motion model using optical flow and the proposed feature descriptor ECoHOG in a tracking-by-detection framework. These techniques were verified using images captured on real roads.
    Download PDF (1835K)
  • Yuan LIN, Shengjin WANG
    Type: PAPER
    Subject area: Computer Graphics
    2014 Volume E97.D Issue 2 Pages 305-314
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Traditional face swapping technologies require that the faces of source images and target images have similar pose and appearance (usually frontal). For overcoming this limit in applications this paper presents a pose-free face swapping method based on personalized 3D face modeling. By using a deformable 3D shape morphable model, a photo-realistic 3D face is reconstructed from a single frontal view image. With the aid of the generated 3D face, a virtual source image of the person with the same pose as the target face can be rendered, which is used as a source image for face swapping. To solve the problem of illumination difference between the target face and the source face, a color transfer merging method is proposed. It outperforms the original color transfer method in dealing with the illumination gap problem. An experiment shows that the proposed face reconstruction method is fast and efficient. In addition, we have conducted experiments of face swapping in a variety of scenarios such as children's story book, role play, and face de-identification stripping facial information used for identification, and promising results have been obtained.
    Download PDF (3484K)
  • Yuan TAO, Yangdong DENG, Shuai MU, Zhenzhong ZHANG, Mingfa ZHU, Limin ...
    Type: LETTER
    Subject area: Fundamentals of Information Systems
    2014 Volume E97.D Issue 2 Pages 315-318
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    The sparse matrix operation, yy+AtAx, where A is a sparse matrix and x and y are dense vectors, is a widely used computing pattern in High Performance Computing (HPC) applications. The pattern poses challenge to efficient solutions because both a matrix and its transposed version are involved. An efficient sparse matrix format, Compressed Sparse Blocks (CSB), has been proposed to provide nearly the same performance for both Ax and Atx. We develop a multithreaded implementation for the CSB format and apply it to solve yy+AtAx. Experiments show that our technique outperforms the Compressed Sparse Row (CSR) based solution in POSKI by up to 2.5 fold on over 70% of benchmarking matrices.
    Download PDF (650K)
  • Kazunori URUMA, Katsumi KONISHI, Tomohiro TAKAHASHI, Toshihiro FURUKAW ...
    Type: LETTER
    Subject area: Fundamentals of Information Systems
    2014 Volume E97.D Issue 2 Pages 319-322
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This letter deals with a sparse signal recovery problem and proposes a new algorithm based on the iterative reweighted least squares (IRLS) algorithm. We assume that the non-zero values of a sparse signal is always greater than a given constant and modify the IRLS algorithm to satisfy this assumption. Numerical results show that the proposed algorithm recovers a sparse vector efficiently.
    Download PDF (630K)
  • Eunji LEE, Youngsun KIM, Hyokyung BAHN
    Type: LETTER
    Subject area: Software System
    2014 Volume E97.D Issue 2 Pages 323-325
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    A dual management of real-time and interactive jobs in dual-core smartphones is presented. The proposed scheme guarantees the end-to-end QoS of real-time applications, while also provides reasonable latency for interactive applications. To this end, high performance NVRAM is adopted as storage of real-time applications, and a dual purpose CPU scheduler, in which one core is exclusively used for real-time applications, is proposed. Experiments show that the proposed scheme reduces the deadline miss ratio of real-time applications by 92%.
    Download PDF (633K)
  • Youwen ZHU, Tsuyoshi TAKAGI, Rong HU
    Type: LETTER
    Subject area: Data Engineering, Web Information Systems
    2014 Volume E97.D Issue 2 Pages 326-330
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.
    Download PDF (221K)
  • Guangming CAO, Peter JUNG, Slawomir STANCZAK, Fengqi YU
    Type: LETTER
    Subject area: Information Network
    2014 Volume E97.D Issue 2 Pages 331-334
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Packet loss and energy dissipation are two major challenges of designing large-scale wireless sensor networks. Since sensing data is spatially correlated, compressed sensing (CS) is a promising reconstruction scheme to provide low-cost packet error correction and load balancing. In this letter, assuming a multi-hop network topology, we present a CS-oriented data aggregation scheme with a new measurement matrix which balances energy consumption of the nodes and allows for recovery of lost packets at fusion center without additional transmissions. Comparisons with existing methods show that the proposed scheme offers higher recovery precision and less energy consumption on TinyOS.
    Download PDF (267K)
  • Hyun-Ho CHOI, Hyun-Gyu LEE, Jung-Ryun LEE
    Type: LETTER
    Subject area: Information Network
    2014 Volume E97.D Issue 2 Pages 335-339
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    In this letter, we propose an energy-aware source routing protocol for maximizing the network lifetime in mobile ad hoc networks. We define a new routing cost by considering both transmit and receive power consumption and remaining battery level in each node simultaneously and present an efficient route discovery procedure to investigate the proposed routing cost. Intensive simulation verifies that the proposed routing protocol has similar performance to the conventional routing protocols in terms of the number of transmission hops, transmission rate, and energy consumption while significantly improving the performance with respect to network lifetime.
    Download PDF (577K)
  • Hwan-Jun CHOI, Hyoung-Kyu SONG
    Type: LETTER
    Subject area: Information Network
    2014 Volume E97.D Issue 2 Pages 340-343
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    In this letter, advanced QRD-M detection using iterative scheme is proposed. This scheme has a higher diversity degree than conventional QRD-M detection. According to the simulation results, the performance of proposed QRD-M detection is 0.5dB to 5.5dB better than the performance of conventional QRD-M detection and average iteration time is approximately 1 in the value of M = 1, 2, 3. Therefore, the proposed QRD-M detection has better performance than conventional QRD-M detection, particularly in a high SNR environment and low modulation order.
    Download PDF (547K)
  • Kohei SAKURAI, Masahiro MATSUBARA, Tatsuhiro TSUCHIYA
    Type: LETTER
    Subject area: Information Network
    2014 Volume E97.D Issue 2 Pages 344-348
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    We propose a lightweight scheme for fault diagnosis in time-triggered (TT) systems. An existing scheme is preferable in its capability but incurs computation time that can be prohibitively large for some real-time systems, such as automotive control systems. Our proposed scheme, which we call voting sharing, can substantially reduce the computation time by sharing the diagnosis result obtained by each node with all nodes in the system. We clarify the properties of the voting sharing scheme with respect to fault tolerance and show some experimental results.
    Download PDF (163K)
  • Xiangyang LI, Xiangzhong FANG
    Type: LETTER
    Subject area: Artificial Intelligence, Data Mining
    2014 Volume E97.D Issue 2 Pages 349-352
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Lane detection plays an important role in Driver Assistance Systems and Autonomous Vehicle System. In this paper, we propose a parallel-snake model combined with balloon force for lane detection. Parallel-snake is defined as two open active contours with parallel constrain. The lane boundaries on the left and right sides are assumed as parallel curves, parallel-snake is deformed to estimate these two boundaries. As lane regions between left and right boundaries usually have low gradient, snake will lose external force on these regions. Furthermore, inspired by balloon active contour model, the balloon force is introduced into parallel-snake to expand two parallel curves from center of road to the left and right lane boundaries. Different from closed active contour, stretching force is adopted to prevent the head and tail of snake from converging together. The experimental results on three different datasets show that parallel-snake model can work well on images with shadows and handle the lane with broken boundaries as the parallel property.
    Download PDF (846K)
  • Kisung SEO, Soohwan HYUN
    Type: LETTER
    Subject area: Artificial Intelligence, Data Mining
    2014 Volume E97.D Issue 2 Pages 353-356
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This paper introduces a comparison of three automatic gait generation methods for quadruped robots: GA (Genetic Algorithm), GP (genetic programming) and CPG (Central Pattern Generator). It aims to provide a useful guideline for the selection of gait generation methods. GA-based approaches seek to optimize paw locus in Cartesian space. GP-based techniques generate joint trajectories using regression polynomials. The CPGs are neural circuits that generate oscillatory output from an input coming from the brain. Optimizations for the three proposed methods are executed and analyzed using a Webots simulation of the quadruped robot built by Bioloid. The experimental comparisons and analyses provided herein will be an informative guidance for research of gait generation method.
    Download PDF (1056K)
  • Jianqiao WANG, Yuehua LI, Jianfei CHEN
    Type: LETTER
    Subject area: Artificial Intelligence, Data Mining
    2014 Volume E97.D Issue 2 Pages 357-360
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    Observed samples in wideband radar are always represented as nonlinear points in high dimensional space. In this paper, we consider the feature selection problem in the scenario of wideband radar target clustering. Inspired by manifold learning, we propose a novel feature selection algorithm, called Local Reconstruction Error Alignment (LREA), to select the features that can best preserve the underlying manifold structure. We first select the features that minimize the reconstruction error in every neighborhood. Then, we apply the alignment technique to extend the local optimal feature sequence to a global unique feature sequence. Experiments demonstrate the effectiveness of our proposed method.
    Download PDF (680K)
  • Seokhee JEON
    Type: LETTER
    Subject area: Human-computer Interaction
    2014 Volume E97.D Issue 2 Pages 361-365
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This paper reports the use of haptic augmented reality in breast tumor palpation. In general, lumps in the breast are stiffer than surrounding tissues, allowing us to haptically detect them through self-palpation. The goal of the study is to assist self-palpation of lumps by haptically augmenting stiffness around lumps. The key steps are to estimate non-linear stiffness of normal tissues in the offline preprocessing step, detect areas that show abnormally stiffer responses, and amplify the difference in stiffness through a haptic augmented reality interface. The performance of the system was evaluated in a user-study, demonstrating the potential of the system.
    Download PDF (2957K)
  • Soojin KIM, Kyeongsoon CHO
    Type: LETTER
    Subject area: Pattern Recognition
    2014 Volume E97.D Issue 2 Pages 366-369
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    In this paper, an efficient method to reduce computational complexity for pedestrian detection is presented. Since trilinear interpolation is not used, the amount of required operations for histogram of oriented gradient (HOG) feature calculation is significantly reduced. By calculating multi-scale HOG features with integral HOG in a two-stage approach, both high detection rate and speed are achieved in the proposed method.
    Download PDF (592K)
  • Zhenfei ZHAO, Hao LUO, Hua ZHONG, Bian YANG, Zhe-Ming LU
    Type: LETTER
    Subject area: Speech and Hearing
    2014 Volume E97.D Issue 2 Pages 370-372
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This letter proposes a mobile application framework named erasable photograph tagging (EPT) for photograph annotation and fast retrieval. The smartphone owner's voice is employed as tags and hidden in the host photograph without an extra feature database aided for retrieval. These digitized tags can be erased anytime with no distortion remaining in the recovered photograph.
    Download PDF (357K)
  • Atanu SAHA, Tetsuya SHIMAMURA
    Type: LETTER
    Subject area: Speech and Hearing
    2014 Volume E97.D Issue 2 Pages 373-377
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This letter proposes a noise spectrum estimation algorithm for speech enhancement. The algorithm incorporates the speech presence probability, which is calculated from SNR (signal-to-noise ratio) discrepancy. The discrepancy is measured based on the estimation of the a priori and a posteriori SNR. The proposed algorithm is found to be effective in rapidly switched noise environments. This is confirmed by the experimental results which indicate that the proposed algorithm when integrated in a speech enhancement scheme performs better than conventional noise estimation algorithms.
    Download PDF (191K)
  • Shenchuan LIU, Wannida SAE-TANG, Masaaki FUJIYOSHI, Hitoshi KIYA
    Type: LETTER
    Subject area: Image Processing and Video Processing
    2014 Volume E97.D Issue 2 Pages 378-379
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    This letter proposes an efficient compression scheme for the copyright- and privacy-protected image trading system. The proposed scheme multiplies pseudo random signs to amplitude components of discrete cosine transformed coefficients before the inverse transformation is applied. The proposed scheme efficiently compresses amplitude-only image which is the inversely transformed amplitude components, and the scheme simultaneously improves the compression efficiency of phase-only image which is the inversely transformed phase components, in comparison with the conventional systems.
    Download PDF (526K)
  • Sangwoo AHN, Jongjoo PARK, Linbo LUO, Jongwha CHONG
    Type: LETTER
    Subject area: Image Processing and Video Processing
    2014 Volume E97.D Issue 2 Pages 380-383
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    In this letter, we present an efficient video matching-based denoising method. Two main issues are addressed in this paper: the matched points and the denoising algorithm based on an adaptive spatial temporal filter. Unlike previous algorithms, our method adaptively selects reference pixels within spatially and temporally neighboring frames. Our method uses more information about matched pixels on neighboring frames than other methods. Therefore, the proposal enhanced the accuracy of video denoising. Simulation results show that the proposed method produces cleaner and sharper images.
    Download PDF (1208K)
  • Huihui BAI, Mengmeng ZHANG, Anhong WANG, Meiqin LIU, Yao ZHAO
    Type: LETTER
    Subject area: Image Processing and Video Processing
    2014 Volume E97.D Issue 2 Pages 384-387
    Published: February 01, 2014
    Released: February 01, 2014
    JOURNALS FREE ACCESS
    A novel standard-compliant multiple description (MD) video codec is proposed in this paper, which aims to achieve effective redundancy allocation using inter- and intra-description correlation. The inter-description correlation at macro block (MB) level is applied to produce side information of different modes which is helpful for better side decoding quality. Furthermore, the intra-description correlation at MB level is exploited to design the adaptive skip mode for higher compression efficiency. The experimental results exhibit a better rate of side and central distortion performance compared with other relevant MDC schemes.
    Download PDF (764K)
feedback
Top