27202859
Affective interaction based on person-independent facial expression space
This paper proposes a person-independent facial expression space (PIFES) to analyze and synthesize facial expressions based on supervised locality preserving projections (SLPP), which aligns different subjects and different intensities of facial expressions on one generalized expression manifold. Interactive curves of different patterns are generated according to the input facial expression image sequence, and target responsive expression images are synthesized for different emotions. In order to synthesize arbitrary expressions for a new person with natural details, a novel approach based on local geometry preserving between the input face image and the target expression image is proposed. Experimental results clearly demonstrate the efficiency of the proposed algorithm.
35188491
Requirement and Design Analysis for the Post-Trauma Mobile Psychology Service
In 2008, a serious earthquake struck Sichuan province. Tens of thousands of people in disaster areas have suffered injuries both in physical and mental aspects. Thus, a Post-Trauma Mobile Service (PTMS) is launched and implemented in Sichuan province, which creates a new mode of long-distance psychological counseling service. This study discusses the comparisons between mobile-based and traditional psychological counseling method, indicating that mobile-based method is a significant experiment both in the post-disaster psychological assistance work and mobile communication service. Besides, requirement analysis is explored, which guides the work of PTMS system design. The system design is described in three stages including architecture design, service mode design and industry chain analysis, in which online and offline service mode are highlighted. This study presents the implementation of PTMS service, which shows that the mobile-based platform and service mode have acceptable psychometric properties, equivalent with paper-based method.
12667544
Camera Readable 2D Bar Codes Design and Decoding for Mobile Phones
2D bar codes were designed to carry significantly more data than its 1D counterpart. Thanks to the popular combination of cameras and mobile phones, it will naturally bring great commercial value to use the camera phone for 2D bar code reading. This paper addresses the problem of specific 2D bar code design for mobile phones and introduces a low-level solution of matrix codes. At the same time, we propose an efficient scheme for 2D bar codes decoding, of which the effort is put on solutions of the difficulties introduced by low image quality that is very common in bar code images taken by a phone camera.
16868039
Automatic text discovering through stroke-based segmentation and text string combination
In this paper we present a novel framework of automatic text discovering for content-based multimedia application. For single image, the stroke-based binarization and the coarse-to-fine text extraction will collaborate to generate a clean text image for recognition. For image sequence, multi-frame text enhancement is adopted to increase the text/background contrast, and the recognition results are finally refined by the text string combination algorithm to get more precise semantic information. Two prototype demos have been successfully developed on mobile phones. The experimental results on different platforms show the superior performance of the proposed method.
17705372
1D Bar Code Reading on Camera Phones
The availability of camera phones provides people with a mobile platform for decoding bar codes, whereas conventional scanners lack mobility. However, using a normal camera phone in such applications is challenging due to the out-of-focus problem. In this paper, we present the research effort on the bar code reading algorithms using a VGA camera phone, NOKIA 7650. EAN-13, a widely used 1D bar code standard, is taken as an example to show the efficiency of the method. A wavelet-based bar code region location and knowledge-based bar code segmentation scheme is applied to extract bar code characters from poor-quality images. All the segmented bar code characters are input to the recognition engine, and based on the recognition distance, the bar code character string with the smallest total distance is output as the final recognition result of the bar code. In order to train an efficient recognition engine, the modified Generalized Learning Vector Quantization (GLVQ) method is designed for optimizing a feature extraction matrix and the class reference vectors. 19 584 samples segmented from more than 1000 bar code images captured by NOKIA 7650 are involved in the training process. Testing on 292 bar code images taken by the same phone, the correct recognition rate of the entire bar code set reaches 85.62%. We are confident that auto focus or macro modes on camera phones will bring the presented method into real world mobile use.
206800753
Automatic character location and segmentation in color scene images
This paper describes a connected component (CC)-based approach to automatic text location and segmentation in natural scene images. A multi-group decomposition scheme is used to deal with the complexity of the color background. Connected component extraction is implemented using the block adjacency graph (BAG) algorithm after noise filtering and runlength smearing (RLS) operation. Some heuristic features and priority adaptive segmentation (PAS) of characters are proposed in block candidate verification and grayscale-based recognition. A prototype system is completed and the experimental results prove the effectiveness of the proposed method.
15500084
Understanding the Prediction of Transmembrane Proteins by Support Vector Machine using Association Rule Mining
With the efforts to understand protein structure, many computational approaches have been made recently. Among them, the support vector machine (SVM) methods have been recently applied and showed successful performance compared with other machine learning schemes. However, despite the high performance, the SVM approaches suffer from the problem of understandability since it is a black-box model. To overcome this limitation, this study attempted to combine the SVM with the association rule based classifier which can present the meaningful explanation about the prediction. To perform this task, a new association rule based classifier (PCPAR) was devised based on the existing classifier, CPAR, to handle the sequential data. PCPAR creates the patterns by merging the generated rules and then classifies the sequential data based on the pattern match. The experimental result presents the following: with sequential data, the PCPAR scheme shows better performance with respect to the accuracy and the number of generated patterns than CPAR method whether applied alone or combined with SVM. The combined scheme of SVMPCPAR generates more compact patterns than the combined scheme of SVM with decision tree, SVM DT, with similar performance. These patterns are easily understandable and biologically meaningful
7757393
Reliability as an interdomain service
Reliability is a critical requirement of the Internet. The availability and resilience of the Internet under failures can have significant global effects. However, in the current Internet routing architecture, achieving the high level of reliability demanded by many mission critical activities can be costly. In this paper, we first propose a novel solution framework called reliability as an interdomain service (REIN) that can be incrementally deployed in the Internet and may improve the redundancy of IP networks at low cost. We then present robust algorithms to efficiently utilize network redundancy to improve reliability. We use real IP network topologies and traffic traces to demonstrate the effectiveness of our framework and algorithms.
38177882
A Hybrid Feature Selection Approach for Microarray Gene Expression Data
Due to the huge number of genes and comparatively small number of samples from microarray gene expression data, accurate classification of diseases becomes challenging. Feature selection techniques can improve the classification accuracy by removing irrelevant and redundant genes. However, the performance of different feature selection algorithms based on different theoretic arguments varies even when they are applied to the same data set. In this paper, we propose a hybrid approach to combine useful outcomes from different feature selection methods through a genetic algorithm. The experimental results demonstrate that our approach can achieve better classification accuracy with a smaller gene subset than each individual feature selection algorithm does.
10224186
Bandwidth Selection and Reconstruction Quality in Point-Based Surfaces
We investigate the influence of bandwidth selection in the reconstruction quality of point-based surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection plays a significant role in the quality of reconstructed surfaces. We show how to compute optimal bandwidths for one class of moving least-squares surfaces by formulating the polynomial fitting step as a kernel regression problem for both noiseless and noisy data. In the context of Levin's projection, we also discuss the implications of the two-step projection for bandwidth selection. We show experimental comparisons of our method, which outperforms heuristically chosen functions and weights previously proposed. We also show the influence of bandwidth on the reconstruction quality of different formulations of point-based surfaces. We provide, to the best of our knowledge, the first quantitative comparisons between different MLS surface formulations and their optimal bandwidths. Using these experiments, we investigate the choice of effective bandwidths for these alternative formulations. We conclude with a discussion of how to effectively compare the different MLS formulations in the literature.
9889663
Feature Similarity Based Redundancy Reduction for Gene Selection
this paper we propose a feature similarity based redundancy reduction (FSRR) algorithm for high-dimensional gene expression data analysis. FSRR has two steps. First, the relevance of each feature is evaluated. Second, based on the relevance, the redundant features are removed by feature similarity. The efficiency and effectiveness of our algorithm is established through an experimental study using gene expression data. Four state-of-art feature ranking algorithms and three feature similarity measures are compared and discussed in our work. The results indicate that our algorithm has the capability of finding a well-suited feature set and improving the classification accuracy.