• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.216-222
• /
• 2008

This paper proposed the multi characters detection algorithm using Color segmentation and the closing curve feature of LoG Operator in order to complement the demerit of the existing research which is weak in complexity of background, variety of light and disordered line and similarity of left and background color, etc. The proposed multi characters detection algorithm divided into three parts : The feature detection, characters format and characters detection Parts in order to be possible to apply to image of various feature. After preprocess that the new multi characters detection algorithm that proposed in this paper used wavelet, morphology, hough transform which is the synthesis logical model in order to raise detection rate by acquiring the non-perfection characters as well as the perfection characters with processing OR operation after processing each color area by AND operation sequentially. And the proposal algorithm is simulated with natural images which include natural character area regardless of size, resolution and slant and so on of image. And the proposal algorithm in this paper is confirmed to an excellent detection rate by compared with the conventional detection algorithm in same image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1391-1399
• /
• 2000

In this paper, we discussed the region-based image retrieval method using image segmentation. We proposed a segmentation method which can reduce the effect of a irregular light sources. The image segmentation method uses a region-merging, and candidate regions which are merged were selected by the energy values of high frequency bands in discrete wavelet transform. The content-based image retrieval is executed by using the segmented region information, and the images are retrieved by a color, texture, shape feature vector. The similarity measure between regions is processed by the Euclidean distance of the feature vectors. The simulation results shows that the proposed method is reasonable.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.2
• /
• pp.9-15
• /
• 2012

In this paper, we propose a method to segment a color image into several meaningful regions. We suppose that the meaningful region has a set of colors with high frequency in the color image. To find these colors, the color image is represented as several sets of color points in RGB space. And when we use the density of points defined in this method, color belonging to a dense region of color points in RGB space refers to the color that appeared frequently in the image. Eventually, we can find meaningful regions by looking for regions with high density of color points using our level set function in RGB space. However, if a meaningful region does not have a contiguous region of the sufficient size in the image, this is not a meaningful region but meaningless region. Thus, the pixels in the meaningless region are assigned to the biggest meaningful region belonging to its neighboring pixels in the color image. Our method divides the color image into meaningful regions by applying the density of color points to level set function in RGB space. This is different from the existing level set method that is defined only in 2D image.

• Journal of Broadcast Engineering
• /
• v.21 no.5
• /
• pp.782-791
• /
• 2016

The object segmentation algorithm from the background could be used for object recognition and tracking, and many applications. To segment objects, this paper proposes a method that refer to several initial frames with real-time processing at fixed camera. First we suggest the probability model to segment object and background and we enhance the performance of algorithm analyzing the color consistency and focus characteristic of camera for several initial frames. We compensate the segmentation result by using human skeleton characteristic among extracted objects. Last the proposed method has the applicability for various mobile application as we minimize computing complexity for real-time video processing.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.3
• /
• pp.260-272
• /
• 2001

In this paper, we have designed a region-based image retrieval system, FRIP(Finding Region In the Pictures). This system includes a robust image segmentation scheme using color and texture direction and retrieval scheme based on features of each region. For image segmentation, by using a circular filter, we can protect the boundary of round object and merge stripes or spots of objects into body region. It also combines scaled and shifted color coordinate and texture direction. After image segmentation, in order to improve the storage management effectively and reduce the computation time, we extract compact features from each region and store as index. For user interface, by the user specified constraints such as color-care / don't care. scale-care / dont care, shape-care / dont care and location-care / dont care, the overal/ matching score is estimated and the top Ie nearest images are reported in the ascending order of the final score.

• Journal of Biosystems Engineering
• /
• v.35 no.2
• /
• pp.138-145
• /
• 2010

An on-line algorithm that discriminates brown rice kernels on their echelon feeder using color image processing is presented for quality inspection. A rapid color image segmentation algorithm based on Bayesian clustering method was developed by means of the look-up table which was made from the significant clusters selected by experts. A robust estimation method was presented to improve the stability of color clusters. Discriminant analysis of color distributions was employed to distinguish nine types of brown rice kernels. Discrimination accuracies of the on-line discrimination algorithm were ranged from 72% to 85% for the sound, cracked, green-transparent and green-opaque, greater than 93% for colored, red, and unhulled, about 92% for white-opaque and 67% for chalky, respectively.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.2
• /
• pp.236-246
• /
• 2006

Motion tracking and object segmentation are the most fundamental and critical problems in vision tasks such as motion analysis. An active contour model, snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid objects. In this paper, the development of new snake model called 'adaptive color snake model (ACSM)' for segmentation and tracking is introduced. The simple operation makes the algorithm runs in real-time. For robust tracking, the condensation algorithm was adopted to control the parameters of ACSM. The effectiveness of the ACSM is verified by appropriate simulations and experiments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.11
• /
• pp.1089-1095
• /
• 2010

We propose an image segmentation method for auto-teaching system of PCB (Printed Circuit Board) assembly inspection machines. The inspection machine acquires images of all components in PCB, and then compares each image with its standard image to find the assembly errors such as misalignment, inverse polarity, and tombstone. The component window that is the area of component to be acquired by camera, is one of the teaching data for operating the inspection machines. To reduce the teaching time of the machine, we newly develop the image processing method to extract the component window automatically from the image of PCB. The proposed method segments the component window by excluding the soldering parts as well as board background. We binarize the input image by use of HSI color model because it is difficult to discriminate the RGB colors between components and backgrounds. The linear combination of the binarized images then enhances the component window from the background. By use of the horizontal and vertical projection of histogram, we finally obtain the component widow. The experimental results are presented to verify the usefulness of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.20-27
• /
• 2006

Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.637-644
• /
• 2006

Biomedical image is often complex. An applied image analysis system should deal with the images which are of quite low quality and are challenging to segment. This paper presents a framework for color cell image segmentation by learning and classification online. It is a robust two-stage scheme using kernel method and watershed transform. In first stage, a two-class SVM is employed to discriminate the pixels of object from background; where the SVM is trained on the data which has been analyzed using the mean shift procedure. A real-time training strategy is also developed for SVM. In second stage, as the post-processing, local watershed transform is used to separate clustering cells. Comparison with the SSF (Scale space filter) and classical watershed-based algorithm (those are often employed for cell image segmentation) is given. Experimental results demonstrate that the new method is more accurate and robust than compared methods.