• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.1
• /
• pp.25-31
• /
• 2005

In this paper, we present a face detection system using the Support Vector Domain Description (SVDD) in color images. Conventional face detection algorithms require a training procedure using both face and non-face images. In SVDD however we employ only face images for training. We can detect faces in color images from the radius and center pairs of SVDD. We also use Entropic Threshold for extracting the facial feature and sliding window for improved performance while saving processing time. The experimental results indicate the effectiveness and efficiency of the proposed algorithm compared to conventional PCA (Principal Component Analysis)-based methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.6
• /
• pp.1889-1893
• /
• 2008

This paper explores the classification performance of applying to support vector machines (SVMs) for the image classification problems. In this study, we extract the color, texture and shape features of natural images and compare the performance of image classification using each individual feature and integrated features. The experiment results show that classification accuracy on the basis of color feature is better than that based on texture and shape features and the results of the integrating features also provides a better and more robust performance than individual feature. In additions, we show that the proposed classifier of SVM based approach outperforms BPNN to corporate the image classification problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.429-430
• /
• 2011

Roughness set theory is a popular topic to use in color-image segmentation. A new popular color image segmentation algorithm is proposed by scientists with the point using traditional histogram and Histon construct roughness set histogram. But, there is still a problem about that is the correlativity of color vector in roughness set histogram, which take an inactive effect in the process of color-image segmentation. Therefore, this paper represents further research based on this and proposed an improved method proved through lot of experiments. The experimental result reduces the correlativity of color vector in roughness set histogram and calculation time remarkably.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.224-231
• /
• 2009

Unsharp masking is a popular image enhancement technique used to sharpen an image appearance in gray images. However, the conventional unsharp making techniques amplify the noise and easily cause overshoot artifacts. Moreover, the unsharp masking tends to introduce color distortion when it is applied to the each color component independently. To solve these problems, we propose a novel unsharp masking technique based on human visual system and vector projection. The proposed algorithm consists of two steps. First, the proposed algorithm controls the level of sharpening by exploiting the characteristics of the human visual system and contrast region. Then the vector projection is applied to remove the color distortion. Experiment results show that our proposed algorithm successfully produces sharpened images that are free of noise and color distortion commonly found in the conventional unsharp masking algorithms.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.330-335
• /
• 1998

In this paper, a new light-value approaching method to enhance a color image by excluding the effect of incident illumination is proposed. The method uses the fundamental vector transformation in which an estimated color of illumination is rotated to the white color of natural daylight. Then the transformed red, green, and blue values of each pixel are nonlinearly mapped into the 8-bit values to enhance intensity and saturation in the dark portion of the image. The proposed algorithm can produce the enhanced color image fast and efficiently without any space conversion or noticeable distortion.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.429-435
• /
• 2003

In this paper, we propose improved binary tree vector quantization with consideration of spatial sensitivity which is one of the human visual properties. We combine weights in consideration with the responsibility of human visual system according to changes of three primary color in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. Also we propose the novel quality measure of the quantization images that applies MTF(modulation transfer function) to luminance value of quantization error of color image. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get less quantized level images and can reduce the resource occupied by the quantized image.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.289-296
• /
• 1999

In this paper, an improved fractal color image decoding method using the data dependence parts and the vector distortion measure is proposed. The vector distortion measure exploits the correlation between different color components. The pixel in RGB color space can be considered as a 30dimensional vector with elements of RGB components. The root mean square error(rms) in RGB color for similarity measure of two blocks R and R' was used. We assume that various parameter necessary in image decoding are stored in the transform table. If the parameter is referenced in decoding image, then decoding is performed by the recursive decoding method. If the parameter is not referenced in decoding image, then the parameters recognize as the data dependence parts and store its in the memory. Non-referenced parts can be decoded only one time, because its domain informations exist in the decoded parts by the recursive decoding method. Non-referenced parts are defined the data dependence parts. Image decoding method using data dependence classifies referenced parts and non-referenced parts using information of transform table. And the proposed method can be decoded only one time for R region decoding speed than Zhang & Po's method, since it is decreased the computational numbers by execution iterated contractive transformations for the referenced range only.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.21-26
• /
• 2004

Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. The basic problem is how to display 256 colors or less colors, called color palette, In this paper, we propose improved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on the responsibility of human visual system according to changes of three Primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective quality test and WSNR.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.592-595
• /
• 2009

In this paper, we propose a face detection technique for still pictures which sequentially uses a skin-color model and a support vector machine (SVM). SVM is a learning algorithm for solving the classification problem. Some studies on face detection have reported superior results of SVM over neural networks. The SVM method searches for a face in a picture while changing the size of the window. The detection accuracy and the processing time of SVM vary largely depending on the complexity of the background of the picture or the size of the face. Therefore, we apply a face candidate area detection method using a skin-color model as a preprocessing technique. We compared the method using SVM alone with that of the proposed method in respect to face detection accuracy and processing time. As a result, the proposed method showed improved processing time while maintaining a high recognition rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.710-715
• /
• 2003

In this paper, we propose the new emotion recognition method for intelligently recognizing the human's emotion using the template vector and neural network. In the proposed method, human's emotion is divided into four emotion (surprise, anger, happiness, sadness). The proposed method is based on the template vector extraction and the template location recognition by using the color difference. It is not easy to extract the skin color area correctly using the single color space. To solve this problem, we propose the extraction method using the various color spaces and using the each template vectors. And then we apply the back-propagation algorithm by using the template vectors among the feature points). Finally, we show the practical application possibility of the proposed method.