[Show abstract][Hide abstract] ABSTRACT: Nowadays people are used to get daily information from Internet such as weather condition, news and financial information, among others. Though, in order to receiving these daily information, users have to repeat same mouse and keyboard actions, inducing waste of time and inconvenience. In order to improve these situations, we propose in this paper a system design that can easily get daily information without mouse and keyboard actions and make people's life more convenient and easier. In this proposed system, we have implemented an approach that provides daily information retrieved from Internet, where users can operate this system with his hands' movements. Once selected the function by hand gestures, the system will report action information to users by synthetized speech. In a typical family, since each member has different requirements and needs, the system utilizes face recognition to identify each user, bringing up personalized services to each user. In this paper, we use PCA method to recognize faces as also hand gestures, and then a number of hand gestures and system controls are acquired and stored into this system. Results from a set of experiments indicate that the proposed system in a family environment with small-scale of face recognition show good performance as also good result in hand gesture recognition.
4th International Conference on Ubi-Media Computing (U-Media), Sao Paulo, Brazil, pp. 146 - 151.; 07/2011
[Show abstract][Hide abstract] ABSTRACT: In this paper we proposed a music matching method, called the RLCS (rough longest common subsequence) method. It is an improved version of the LCS to avoid some problems occurring in global alignment matching. First a rough equality for two notes is defined for constructing the RLCS of two music fragments. The length of the RLCS of two music sequences defined in this work is a real number, called a weighted length. It is evaluated according to the degree of similarity of every pair of matched notes from the two sequences. This method takes into account both the width-across-query (WAQ) and the width-across-reference (WAR) and combines them with the weighted length of the corresponding RLCS to define a score measurement for the RLCS. The measurement associated with WAQ and WAR enables the proposed method to tolerate dense errors. A dynamic programming algorithm is presented for simultaneously calculating the weighted length of RLCS, the WAQ, the WAR, and the score to determine the RLCS. As a result, the proposed method can perform the matching in a better and simpler manner. In order to speed up the matching process, we use the filtering algorithm proposed by Tarhio and Ukkonen  to filter the reference and discard most of the reference areas that do not match. We applied the proposed algorithm to content-based music retrieval. The experimental results showed that with our proposed algorithm the retrieval system provides a higher retrieval rate than that with the local alignment method proposed by Suyoto et al. . The use of the filtering algorithm has been shown to greatly reduce the computation time for exact matching and for approximate matching with a low error tolerance.
[Show abstract][Hide abstract] ABSTRACT: Music representation with pitch interval and duration ratio can achieve invariance to transposition and tempo. However, altering the pitch or duration of a singlemusic note will cause an antisymmetry effect. This paper proposes an algorithm for computing a geometric measure between two music fragments represented with pitch interval and duration ratio, with the capability of detecting and reducing these effects to improve search effectiveness.Index Terms-content-based music retrieval, geometricmatching, pitch interval, duration ratio, antisymmetry effect
Journal of multimedia 10/2010; 5(5):522-527. DOI:10.4304/jmm.5.5.522-527
[Show abstract][Hide abstract] ABSTRACT: Information hiding has been an important research topic for the past several years. Techniques to solve the problem of unauthorized copying, tampering, and multimedia data delivery through the internet are urgently needed. Today's information hiding techniques consist mainly of steganography and digital watermarking. In this paper, we shall focus on the digital watermarking and propose an improved version of the integer discrete wavelet transform (integer-DWT)-based watermarking technique proposed by Chang et al. . Our method is able to achieve ownership protection. First, the original image is performed with the Discrete Wavelet Transformation (DWT) and embedded with the watermark in the HL and LH blocks associated with an embedding rule. The experimental results show that the proposed approach indeed produces better results than the compared method in terms of the quality of the stego image, the extracted watermark with or without attack, and time efficiency.
Proceedings of the 10th WSEAS international conference on Signal processing, computational geometry and artificial vision; 08/2010
[Show abstract][Hide abstract] ABSTRACT: The main issue is to search for a subset of the support vector solutions produced by an SVM that forms a discriminant function best approximating the original one. The work is accomplished by giving a fitness (objective function) that fairly indicates how well the discriminant function formed by a set of selected vectors approximates the original one, and searching for the set of vectors having the best fitness using PSO, EGA, or a hybrid approach combining PSO and EGA. Both the defined fitness function and the adopted search technique affect the performance. Our method can be applied to SVMs associated with any general kernel. The reduction rate can be adaptively adjusted based on the requirement of the task. The proposed approach is tested on some benchmark datasets. The experimental results show that the proposed method using PSO, EGA, or a hybrid strategy combining PSO and EGA associated with the objective function defined in the paper outperforms both the method proposed by Li et al. (2007) and our previously proposed method (Lin and Yeh, 2009), and that a hybrid strategy of PSO and EGA provides better results than a single strategy of PSO or EGA.
[Show abstract][Hide abstract] ABSTRACT: We propose a facial feature replacement system, which uses the triangulation algorithm to perform facial feature replacement in each segmented triangular region associated with control points. The experimental results show that our system provides quite natural composite images. In addition, the system is flexible and has no limit in the shape, size, and plane rotation of the faces which are processed.
[Show abstract][Hide abstract] ABSTRACT: This paper presents a flexible and effective colorization system that carries out colorization by performing two stages of chrominance determination for pixels in a gray-scale image, including scribble region expansion and chrominance blending. The region corresponding to each scribble color is determined by expanding the scribbles in parallel associated with the edge map of the given image. Usually a few pixels remain unassigned to a color region after this stage. For those pixels we define and compute the transportation distance between each pixel and each scribble color. Then the reciprocals of the distances are used as weights to assign each of those pixels a weighted sum of the scribble colors. To promote practicability and effectiveness of the system several modules are provided that make the system more user-friendly and enhance the colorization results. The experimental results show that the proposed system is not only flexible and easy to use, but it also provides natural and satisfactory colorization results.
[Show abstract][Hide abstract] ABSTRACT: Being a universal learning machine, a support vector machine (SVM) suffers from expensive computational cost in the test phase due to the large number of support vectors, and greatly impacts its practical use. To address this problem, we proposed an adaptive genetic algorithm to optimally reduce the solutions for an SVM by selecting vectors from the trained support vector solutions, such that the selected vectors best approximate the original discriminant function. Our method can be applied to SVMs using any general kernel. The size of the reduced set can be used adaptively based on the requirement of the tasks. As such the generalization/complexity trade-off can be controlled directly. The lower bound of the number of selected vectors required to recover the original discriminant function can also be determined.
[Show abstract][Hide abstract] ABSTRACT: This paper proposes a method for detecting copy-move forgery over images tampered by copy-move. To detect such forgeries, the given image is divided into overlapping blocks of equal size, feature for each block is then extracted and represented as a vector, all the extracted feature vectors are then sorted using the radix sort. The difference (shift vector) of the positions of every pair of adjacent feature vectors in the sorting list is computed. The accumulated number of each of the shift vectors is evaluated. A large accumulated number is considered as possible presence of a duplicated region, and thus all the feature vectors corresponding to the shift vectors with large accumulated numbers are detected, whose corresponding blocks are then marked to form a tentative detected result. Finally, the medium filtering and connected component analysis are performed on the tentative detected result to obtain the final result. Compared with other methods, employing the radix sort makes the detection much more efficient without degradation of detection quality.
WSEAS Transactions on Signal Processing 05/2009; 5(5):188-197.
[Show abstract][Hide abstract] ABSTRACT: Face Recognition is an important topic in the field of pattern recognition. This technology has a variety of applications
including entrance guard control, personal service system, criminal verification, and security verification of finance. Our
research focuses on the development of a human face recognition system. It is a challenge to correctly identify a human in
an image under various possible situations including difference of lighting conditions, change of hairstyles, variation of
facial expression, and different aspects of the face.
We have analyzed several existing face recognition techniques and found that each of them is performed well over some specific
sets of testing samples but poorly over some other sets. This motivates us to combine different techniques to construct a
better face recognition system. First, we propose a new module E-2DPCA applying DCT for image enhancement and 2DPCA for feature
extraction. The experimental results show that the recognition accuracy of E-2DPCA is better than all the modules we have
analyzed. We choose the best two from those analyzed and compared them with our proposed E-2DPCA module, and found that although
the E-2DPCA module outperforms the other two modules, each of the three modules behaves better than others over some specific
set of samples. Thus we combine the three modules and apply weighted voting scheme to choose the recognition result from those
given by the three modules. Experimental results show that the integrated system can further improve the recognition rate.
Next-Generation Applied Intelligence, 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June 24-27, 2009. Proceedings; 01/2009
[Show abstract][Hide abstract] ABSTRACT: The performance of face recognition systems depends on conditions being consistent, including lighting, pose and facial expression. To solve the problem produced by pose variation it is suggested to pre-estimate the pose orientation of the given head image before it is recognized. In this paper, we propose a head pose estimation method that is an improvement on the one proposed by N. Hu et al. The proposed method trains in a supervised manner a nonlinear interpolative mapping function that maps input images to predicted pose angles. This mapping function is a linear combination of some Radial Basis Functions (RBF). The experimental results show that our proposed method has a better performance than the method proposed by Nan Hu et al. in terms of both time efficiency and estimation accuracy.
[Show abstract][Hide abstract] ABSTRACT: A balanced binary search tree to provide quick determination of the step size of each move of the query melody and quick update of the area after each move is constructed. The definition of geometric measure of similarity between two melodies and the structure of the binary search tree used for improvement is also proposed. The query and the reference are modeled as monotonic pitch interval rectilinear functions of time. The algorithm Pitch-Interval-Area with BST improves the time efficiency for the geometric measure of music similarity by using a balanced binary search tree, which allows determination of step size. The music antisymmetry effect can be reduced by reducing the area of the rectangle if the sum of two successive intervals from the query and the sum of two successive intervals from the reference are equal.
Information Processing Letters 12/2008; 109(2):116-120. DOI:10.1016/j.ipl.2008.09.014 · 0.55 Impact Factor
[Show abstract][Hide abstract] ABSTRACT: Abstract—In a mobile computing system, users carrying portable devices can access database services from any location without requiring a fixed position in the networking environ- ment. Some examples of strategies supported by databases in mobile computing include location dependent queries, long-lived transactions that require migration of data into the portable devices, form-based transactions, and online information report. Within a mobile computing environment, the need for a real- time database management model is strong, because one of the basic requirements in mobile data management,is to provide real-time response to transactions of the underlying strategies. However, the resource constraints of mobile computing systems make,it difficult to satisfy timing requirements of supported strategies. Low bandwidth, unreliable wireless links, and fre- quent disconnections increase the overhead of communication between mobile hosts and,fixed hosts of the system. There
[Show abstract][Hide abstract] ABSTRACT: This paper proposes an improved version of our previously introduced face detection system based on skin color segmentation and neural networks. The new system uses a support vector machine (SVM) based method for verification.
Secure System Integration and Reliability Improvement, 2008. SSIRI '08. Second International Conference on; 08/2008
[Show abstract][Hide abstract] ABSTRACT: We propose a method to extract text information from video sequences. First the frequency of high horizontal energy in a video frame is examined to extract text blocks. Structural operations are then performed to remove the background so that the text can be extracted for later recognition. Experiments show that the method is efficient and effective for extracting text from various video documents.
Secure System Integration and Reliability Improvement, 2008. SSIRI '08. Second International Conference on; 08/2008
[Show abstract][Hide abstract] ABSTRACT: A content-based painting image retrieval (CBPIR) system based on AdaBoost is proposed. By providing query examples which share the same semantic concepts, e.g., portraits, and incorporating with relevance feedback (RF), the user can acquire the desired painting images. To bridge the gap between low-level features and semantic concepts, a large set of 4,356 features on texture and spatial arrangement of painting images is provided. Utilize the nice characteristic of AdaBoost algorithm that it can combine partial weak classifiers, i.e. features, into a strong one, the system can correctly discover a few most critical features from provided samples and search paintings sharing same features from the database. Our experiment in query of "portrait," based on 3 RFs and an average of 50 repetitions, shows an excellent performance of (approximately) 0.71, 0.84, 0.95 in Precision, Recall, and Top 100 Precision rates. The average execution time, based on 50 repetitions, required in initial query and three RF with training and classifying is approximately 1.2 seconds, thus a complete query takes less than 5 seconds in training and classifying. The system is proved to be accurate in content based image retrieval and also very efficient for on-line users.
Systems, Man and Cybernetics, 2006. SMC '06. IEEE International Conference on; 11/2006