• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.789-799
• /
• 2008

For the communication between human and computer in an interactive computing environment, the gesture recognition has been studied vigorously. The algorithms which use the 2D features for the feature extraction and the feature comparison are faster, but there are some environmental limitations for the accurate recognition. The algorithms which use the 2.5D features provide higher accuracy than 2D features, but these are influenced by rotation of objects. And the algorithms which use the 3D features are slow for the recognition, because these algorithms need the 3d object reconstruction as the preprocessing for the feature extraction. In this paper, we propose a method to extract the 3D features combined with the 3D object reconstruction in real-time. This method generates three kinds of 3D projection maps using the modified GPU-based visual hull generation algorithm. This process only executes data generation parts only for the gesture recognition and calculates the Hu-moment which is corresponding to each projection map. In the section of experimental results, we compare the computational time of the proposed method with the previous methods. And the result shows that the proposed method can apply to real time gesture recognition environment.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.23-35
• /
• 2013

This paper proposes an effective technique that is used to automatically extract feature vectors from vibration signals for fault classification systems. Conventional mel-frequency cepstral coefficients (MFCCs) are sensitive to noise of vibration signals, degrading classification accuracy. To solve this problem, this paper proposes spectral envelope cepstral coefficients (SECC) analysis, where a 4-step filter bank based on spectral envelopes of vibration signals is used: (1) a linear predictive coding (LPC) algorithm is used to specify spectral envelopes of all faulty vibration signals, (2) all envelopes are averaged to get general spectral shape, (3) a gradient descent method is used to find extremes of the average envelope and its frequencies, (4) a non-overlapped filter is used to have centers calculated from distances between valley frequencies of the envelope. This 4-step filter bank is then used in cepstral coefficients computation to extract feature vectors. Finally, a multi-layer support vector machine (MLSVM) with various sigma values uses these special parameters to identify faulty types of induction motors. Experimental results indicate that the proposed extraction method outperforms other feature extraction algorithms, yielding more than about 99.65% of classification accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.459-466
• /
• 2014

In this paper, we suggest an efficient image processing method for fast paper currency counting with pattern recognition. The patterns are consisted of feature data in each note object extracted from full reflection image of notes and a general contact image sensor(CIS) is used to aggregate the feature images. The proposed pattern recognition algorithm can endure image variation when the paper currency is scanned because it is not sensitive to changes of image resulting in successful note recognition. We tested 100 notes per denomination and currency of several countries including Korea, U.S., China, EU, Britain and Turkey. To ensure the reliability of the result, we tested a total of 10 times per each direction of notes. We can conclude that this algorithm will be applicable to commercial product because of its successful recognition rates. The 100% recognition rates are obtained in almost cases with exceptional case of 99.9% in Euro and 99.8% in Turkish Lira.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.27-33
• /
• 2011

In this paper, we propose an efficient on-line handwritten digit recognition base on Convex-Concave curves feature which is extracted by a chain code sequence using Smith-Waterman alignment algorithm. The time sequential signal from mouse movement on the writing pad is described as a sequence of consecutive points on the x-y plane. So, we can create data-set which are successive and time-sequential pixel position data by preprocessing. Data preprocessed is used for Convex-Concave curves feature extraction. This feature is scale-, translation-, and rotation-invariant. The extracted specific feature is fed to a Smith-Waterman alignment algorithm, which in turn classifies it as one of the nine digits. In comparison with backpropagation neural network, Smith-Waterman alignment has the more outstanding performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.705-711
• /
• 2011

This paper proposes an effective algorithm of license plate recognition for industrial applications. By applying Canny edge detection on a vehicle image, it is possible to find a connected rectangular, which is a strong candidate for license plate. The color information of license plate separates plates into white and green. Then, OTSU binary image processing and foreground neighbor pixel propagation algorithm CLNF will be applied to each license plates to reduce noise except numbers and letters. Finally, through labeling, numbers and letters will be extracted from the license plate. Letter and number regions, separated from the plate, pass through mesh method and thinning process for extracting feature vectors by X-Y projection method. The extracted feature vectors are compared with the pre-learned weighting values by backpropagation neural network to execute final recognition process. The experiment results show that the proposed license plate recognition algorithm works effectively.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.625-628
• /
• 2010

This paper proposes a novel feature extraction method for unsupervised multispectral image segmentation based in one dimensional combined neighborhood differences (1D CND). In contrast with the original CND, which is applied with traditional image, 1D CND is computed on a single pixel with various bands. The proposed algorithm utilizes the sign of differences between bands of the pixel. The difference values are thresholded to form a binary codeword. A binomial factor is assigned to these codeword to form another unique value. These values are then grouped to construct the 1D CND feature image where is used in the unsupervised image segmentation. Various experiments using two LANDSAT multispectral images have been performed to evaluate the segmentation and classification accuracy of the proposed method. The result shows that 1D CND feature outperforms the spectral feature, with average classification accuracy of 87.55% whereas that of spectral feature is 55.81%.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.51-58
• /
• 2009

In this paper. we propose search algorithm using Low Peak Feature of audio and image color value by which similar movies can be identified. Combing through entire video files for the purpose of recognizing and retrieving matching movies requires much time and memory space. Moreover, these methods still share a critical problem of erroneously recognizing as being different matching videos that have been altered only in resolution or converted merely with a different codec. Thus we present here a similar-video-retrieval method that relies on analysis of audio patterns, whose peak features are not greatly affected by changes in the resolution or codec used and image color values. which are used for similarity comparison. The method showed a 97.7% search success rate, given a set of 2,000 video files whose audio-bit-rate had been altered or were purposefully written in a different codec.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.379-387
• /
• 2001

We proposed an enhanced extraction method of vehicle plate, in which both the brightness variation of gray and the Hue value of HSI color model were used. For the extraction of the vehicle plate from a vehicle image, first of all, candidate regions for the vehicle plate were extracted from the image by using the property of brightness variation of the image. A real place region was determined among candidate regions by the density of pixels with the Hue value of green and white. For- extracting the feature area containing characters from the extracted vehicle plate, we used the histogram-based approach of individual characters. And we proposed and applied for the recognition of characters the enhanced ART2 algorithm which support the dynamical establishment of the vigilance threshold with the genera]iced union operator of Yager. In addition, we propose an enhanced SOSL algorithm which is integrated both enhanced ART2 and supervised learning methods. The performance evaluation was performed using 100's real vehicle images and the evaluation results demonstrated that the extraction rates of tole proposed extraction method were improved, compared with that of previous methods based un brightness variation, RGB and HSI individually . Furthermore, the recognition rates of the proposed algorithms were improved much more than that of the conventional ART2 and BP algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1162-1166
• /
• 2005

A new low dimensional feature representation technique is presented in this paper. Linear discriminant analysis is a popular feature extraction method. However, in the case of high dimensional data, the computational difficulty and the small sample size problem are often encountered. In order to solve these problems, we propose two dimensional direct LDA algorithm, which directly extracts the image scatter matrix from 2D image and uses Direct LDA algorithm for face recognition. The ORL face database is used to evaluate the performance of the proposed method. The experimental results indicate that the performance of the proposed method is superior to DLDA.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.3
• /
• pp.452-458
• /
• 2013

Over the past several years, many studies have been carried out in the field of 3D data inspection systems. Several attempts have been made to improve the quality of manufactured parts. The introduction of laser sensors for inspection has made it possible to acquire data at a remarkably high speed. In this paper, a robust inspection technique for detecting defects in 3D pressed parts using laser-scanned data is proposed. Point cloud data are segmented for the extraction of features. These segmented features are used for shape matching during the localization process. An iterative closest point (ICP) algorithm is used for the localization of the scanned model and CAD model. To achieve a higher accuracy rate, the ICP algorithm is modified and then used for matching. To enhance the speed of the matching process, aKd-tree algorithm is used. Then, the deviation of the scanned points from the CAD model is computed.