• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.847-850
• /
• 2000

This paper proposes an image compressing and template matching algorithm for face image using GHA (Generalized Hebbian Algorithm). GHA is a part of PCA (Principal Component Analysis), that has single-layer perceptrons and operates and self-organizing performance. We used this algorithm for feature extraction of face shape, and our simulations verify the high performance for the proposed method. The shape for face in the fact that the eigenvector of face image can be efficiently represented as a coefficient that can be acquired by a set of basis is to compress data of image. From the simulation results, the mean PSNR performance is 24.08[dB] at 0.047bpp, and reconstruction experiment shows that good reconstruction capacity for an image that not joins at leaning.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.271-278
• /
• 2014

In spite of that stop line and crosswalk should be aware of the most basic objects in transportation system, its features extracted are very limited. In addition to image-based recognition technology, laser and RF, GPS/INS recognition technology, it is difficult to recognize. For this reason, the limited research in this area has been done. In this paper, the algorithm to recognize the stop line and crosswalk is designed and implemented using image-based recognition technology with the images input through a vision sensor. This algorithm consists of three functions.; One is to select the area, in advance, needed for feature extraction in order to speed up the data processing, 'Region of Interest', another is to process the images only that white color is detected more than a certain proportion in order to remove the unnecessary operation, 'Color Pattern Inspection', the other is 'Feature Extraction and Recognition', which is to extract the edge features and compare this to the previously-modeled one to identify the stop line and crosswalk. For this, especially by using case based feature comparison algorithm, it can identify either both stop line and crosswalk exist or just one exists. Also the proposed algorithm is to develop existing researches by comparing and analysing effect of in-vehicle camera installation and changes in recognition rate of distance estimation and various constraints such as backlight and shadow.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.1-10
• /
• 2013

In this paper, we implement the SIFT(Scale-Invariant Feature Transform) algorithm for feature point extraction using a many-core processor, and analyze the performance, area efficiency, and system area efficiency of the many-core processor. In addition, we demonstrate the potential of the proposed many-core processor by comparing the performance of the many-core processor with that of high-performance CPU and GPU(Graphics Processing Unit). Experimental results indicate that the accuracy result of the SIFT algorithm using the many-core processor was same as that of OpenCV. In addition, the many-core processor outperforms CPU and GPU in terms of execution time. Moreover, this paper proposed an optimal model of the SIFT algorithm on the many-core processor by analyzing energy efficiency and area efficiency for different octave sizes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1495-1504
• /
• 2012

This paper proposes an algorithm to classify and analyze facial features such as eyebrow, eye, mouth and chin based on the geometric features of the face. As a preprocessing process to classify and analyze the facial features, the algorithm extracts the facial features such as eyebrow, eye, nose, mouth and chin. From the extracted facial features, it detects the shape and form information and the ratio of distance between the features and formulated them to evaluation functions to classify 12 eyebrows types, 3 eyes types, 9 mouth types and 4 chine types. Using these facial features, it analyzes a face. The face analysis algorithm contains the information about pixel distribution and gradient of each feature. In other words, the algorithm analyzes a face by comparing such information about the features.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.73-81
• /
• 2005

We propose an automatic modulation recognition scheme which extracts pre-defined key features from the received signal and then applies equal gain combining method to determine the used modulation. Moreover, we compare and analyze the performance of the proposed algorithm with that of decision-theoretic algorithm. Our scheme extracts five pre-defined key features from each data segment, a data unit for the key feature extraction, which are then averaged over all the segments to recognize the modulation according to the decision procedure. We check the performance of the proposed algorithm through computer simulations for analog modulations such as AM, FM, SSB and for digital modulations such as FSK2, FSK4, PSK2, and PSK4, by measuring recognition success rate varying SNR and data collection time. The result shows that the performance of the proposed scheme is comparable to that of the decision-theoretic algorithm with less complexity.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.178-181
• /
• 2005

Support vector machines is a powerful learning algorithm and attempt to separate belonging to two given sets in N-dimensional real space by a nonlinear surface, often only implicitly dened by a kernel function. We described breast tissue images analyses using texture features from Haar wavelet transformed images to classify breast lesion of ductal organ Benign, DCIS and CA. The approach for creating a classifier is composed of 2 steps: feature extraction and classification. Therefore, in the feature extraction step, we extracted texture features from wavelet transformed images with $10{\times}$ magnification. In the classification step, we created four classifiers from each image of extracted features using SVM(Support Vector Machines). In this study, we conclude that the best classifier in histological sections of breast tissue in the texture features from second-level wavelet transformed images used in Polynomial function.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.179-186
• /
• 1997

In this paper we suggest a development of surface defect inspection algorithms for cold mill strip. The defects which exist in a surface of cold mill strip have a scattering or singular distribution. This paper consists of preprocessing, feature extraction and defect classification. By preprocessing, the binarized defect image is achieved. In this procedure, Top-hit transform, adaptive thresholding, thinning and noise rejection are used. Especially, Top-hit transform using local min/max operation diminishes the effect of bad lighting. In feature extraction, geometric, moment and co-occurrence matrix features are calculated. For the defect classification, multilayer neural network is used. The proposed algorithm showed 15% error rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.474-479
• /
• 2003

In this paper, we proposed the novel method for the recognition of English calling cards by using the projection method and the enhanced RBF (Radial Basis Function) network. The recognition of calling cards consists of the extraction phase of character areas and the recognition phase of extracted characters. In the extraction phase, first of all, noises are removed from the images of calling cards, and the feature areas including character strings are separated from the calling card images by using the horizontal smearing method and the 8-directional contour tracking method. And using the image projection method, the feature areas are split into the areas of individual characters. We also proposed the enhanced RBF network that organizes the middle layer effectively by using the enhanced ART1 neural network adjusting the vigilance threshold dynamically according to the homogeneity between patterns. In the recognition phase, the proposed neural network is applied to recognize individual characters. Our experiment result showed that the proposed recognition algorithm has higher success rate of recognition and faster learning time than the existing neural network based recognition.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.808-816
• /
• 2017

360 VR video systems has become important to provide immersive effect for viewers. The system consists of stitching, projection, compression, inverse projection, viewport extraction. In this paper, an efficient luminance compensation technique for 360 VR video sequences, where feature extraction and histogram equalization algorithms are utilized. The proposed luminance compensation algorithm enhance the performance of stitching in 360 VR system. The simulation results showed that the proposed technique is useful to increase the quality of the displayed image.