• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.72-80
• /
• 2009

Look-up table based inverse halftoning from the digital color halftone image is proposed in this paper, which uses vector adaptive filter for the nonexisting patterns in the table. Halftone image is obtained from a continuous -tone image, which can be restored into continuous one from the digital binary image by way of inverse halftoning method. Look-up table based method usually processes fast and has even performances over the various halftoning. The numbers of pixels in the pattern of table and the method how to define the table elements for each R, G, B channels can effect largely for its performance. The proposed method uses 16 pixels in the table considering the diversity of the expressions from their patterns and with memory size as well. This also proposed how to combine R, G, B channels into one. Experimental results showed the better performance in the expression of colors, better color restoration and the short processing time compared with the conventional ones.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.63-73
• /
• 2009

This paper presents a vehicle detection method that uses convolution matching method based on a simple color information. An input image is expressed as 8 oriented color expression(Red, Green, Blue, White, Black, Cyan, Yellow, Magenta) considering an orientation of a pixel color vector. It makes the image very reliable and strong against changes of illumination condition or environment. This paper divides the vehicle detection into a hypothesis generation step and a hypothesis verification step. In the hypothesis generation step, the vehicle candidate region is found by vertical edge and shadow. In the hypothesis verification step, the convolution matching and the complexity of image edge are used to detect real vehicles. It is proved that the proposed method has the fast and high detection rate on various experiments where the illumination source and environment are changed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.1-12
• /
• 2008

In this paper, we present a real-time algorithm for recognizing the vehicle color from the indoor and outdoor vehicle images based on GPU (Graphics Processing Unit) acceleration. In the preprocessing step, we construct feature victors from the sample vehicle images with different colors. Then, we combine the feature vectors for each color and store them as a reference texture that would be used in the GPU. Given an input vehicle image, the CPU constructs its feature Hector, and then the GPU compares it with the sample feature vectors in the reference texture. The similarities between the input feature vector and the sample feature vectors for each color are measured, and then the result is transferred to the CPU to recognize the vehicle color. The output colors are categorized into seven colors that include three achromatic colors: black, silver, and white and four chromatic colors: red, yellow, blue, and green. We construct feature vectors by using the histograms which consist of hue-saturation pairs and hue-intensity pairs. The weight factor is given to the saturation values. Our algorithm shows 94.67% of successful color recognition rate, by using a large number of sample images captured in various environments, by generating feature vectors that distinguish different colors, and by utilizing an appropriate likelihood function. We also accelerate the speed of color recognition by utilizing the parallel computation functionality in the GPU. In the experiments, we constructed a reference texture from 7,168 sample images, where 1,024 images were used for each color. The average time for generating a feature vector is 0.509ms for the $150{\times}113$ resolution image. After the feature vector is constructed, the execution time for GPU-based color recognition is 2.316ms in average, and this is 5.47 times faster than the case when the algorithm is executed in the CPU. Our experiments were limited to the vehicle images only, but our algorithm can be extended to the input images of the general objects.

• Journal of Korea Multimedia Society
• /
• v.18 no.5
• /
• pp.610-619
• /
• 2015

*In this paper, we propose a real-time face tracking system using an adaptive face detector and a tracking algorithm. An image is divided into the regions of background and face candidate by a real-time updated skin color identifying system in order to accurately detect facial features. The facial characteristics are extracted using the five types of simple Haar-like features. The extracted features are reinterpreted by Principal Component Analysis (PCA), and the interpreted principal components are processed by Support Vector Machine (SVM) that classifies into facial and non-facial areas. The movement of the face is traced by Kalman filter and Mean shift, which use the static information of the detected faces and the differences between previous and current frames. The proposed system identifies the initial skin color and updates it through a real-time color detecting system. A similar background color can be removed by updating the skin color. Also, the performance increases up to 20% when the background color is reduced in comparison to extracting features from the entire region. The increased detection rate and speed are acquired by the usage of Kalman filter and Mean shift.

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

In compressed color images, colors are usually represented by luminance and chrominance (YCbCr) components. Considering characteristics of human vision system, chrominance (CbCr) components are generally represented more coarsely than luminance component. Aiming at possible recovery of chrominance components, we propose a model-based chrominance estimation algorithm where color images are modeled by a Markov random field (MRF). A simple MRF model is here used whose local conditional probability density function (pdf) for a color vector of a pixel is a Gaussian pdf depending on color vectors of its neighboring pixels. Chrominance components of a pixel are estimated by maximizing the conditional pdf given its luminance component and its neighboring color vectors. Experimental results show that the proposed chrominance estimation algorithm is effective for quality improvement of compressed color images such as JPEG and JPEG2000.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.778-780
• /
• 2004

본 논문에서는 오브젝트가 서로 겹쳤다가 분리되는 상황 하에서도 오브젝트를 정확히 추적할 수 있는 칼라관계(color relationship)특징 벡터를 제안한다. 오브젝트의 정확한 추적경로와 이벤트 검출을 위하여 신뢰성 있는 특징 벡터 추출은 필수적이다. 향상된 오브젝트 추적을 위해 면적. 크기뿐만 아니라 본 논문에서 제안한 칼라관계 특징 벡터를 사용한다. 실험 영상에 적용한 결과 제안된 방법을 사용하였을 경우 멀티오브젝트의 영상에서 겹침(occlusion)과 나타남(disocclusion)이 발생하는 경우에도 정확한 경로 추적이 이루어짐을 볼 수 있었다

• Journal of Multimedia Information System
• /
• v.7 no.2
• /
• pp.165-174
• /
• 2020

This document outlines a new color image encryption technology development. After splitting the original image into 240-bit blocks and modifying the first block by an initialization vector, an improved Feistel circuit is applied, sponsored by a genetic crossover operator and then strong chaining between the encrypted block and the next clear block is attached to set up the confusion-diffusion and heighten the avalanche effect, which protects the system from any known attack. Simulations carried out on a large database of color images of different sizes and formats prove the robustness of such a system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.3B
• /
• pp.332-337
• /
• 2001

본 논문에서는 영상 검색 방법의 하나인 내용에 기반을 둔 검색 방법(content based retrieval)으로 주변 화소의 컬러 히스토그램(NCH)을 이용하는 방법을 제안한다. 제안한 방법은 각 화소에 대해 주변 화소의 컬러 히스토르램을 데이터베이스의 색인 정보로 정장하는 방법으로, 영상의 공간 정보와 컬러 정보를 효과적으로 결합한 방법이다. 실험결과, 제안한 방법은 히스토그램과 CCV(Color Coherence Vector)를 이용한 방법보다 검색 효율이 우수하고 카메라의 위치 및 확대, 축소에 따른 영상의 큰 변화에도 매우 강인한 것으로 나타났다.

• Journal of Biosystems Engineering
• /
• v.36 no.1
• /
• pp.40-47
• /
• 2011

Image analysis algorithm for the quality evaluation of ginseng seedling was investigated. The images of ginseng seedling were acquired with a color CCD camera and processed with the image analysis methods, such as binary conversion, labeling, and thinning. The processed images were used to calculate the length and weight of ginseng seedlings. The length and weight of the samples could be predicted with standard errors of 0.343 mm, and 0.0214 g respectively, $R^2$ values of 0.8738 and 0.9835 respectively. For the evaluation of the three quality grades of Gab, Eul, and abnormal ginseng seedlings, features from the processed images were extracted. The features combined with the ratio of the lengths and areas of the ginseng seedlings efficiently differentiate the abnormal shapes from the normal ones of the samples. The grade levels were evaluated with an efficient pattern recognition method of support vector machine analysis. The quality grade of ginseng seedling could be evaluated with an accuracy of 95% and 97% for training and validation, respectively. The result indicates that color image analysis with support vector machine algorithm has good potential to be used for the development of an automatic sorting system for ginseng seedling.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1252-1255
• /
• 2002

In this paper, face recognition algorithm, by using skin color information of HSI color coordinate collected from face images, elliptical mask, fratures of face including eyes, nose and mouth, and geometrical feature vectors of face and facial angles, is proposed. The proposed algorithm improved face region extraction efficacy by using HSI information relatively similar to human's visual system along with color tone information about skin colors of face, elliptical mask and intensity information. Moreover, it improved face recognition efficacy with using feature information of eyes, nose and mouth, and Θ1(ACRED), Θ2(AMRED) and Θ 3(ANRED), which are geometrical face angles of face. In the proposed algorithm, it enables exact face reading by using color tone information, elliptical mask, brightness information and structural characteristic angle together, not like using only brightness information in existing algorithm. Moreover, it uses structural related value of characteristics and certain vectors together for the recognition method.