• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.465-472
• /
• 2003

For an effective pre-treatment process of a face input image, it is necessary to detect each of face components, calculate the face area, and estimate the rotary angle of the face. A proposed method of this study can estimate an robust result under such renditions as some different levels of illumination, variable fate sizes, fate rotation angels, and background color similar to skin color of the face. The first step of the proposed method detects the estimated face area that can be calculated by both adapted skin color Information of the band-wide HSV color coordinate converted from RGB coordinate, and skin color Information using histogram. Using the results of the former processes, we can detect a lip area within an estimated face area. After estimating a rotary angle slope of the lip area along the X axis, the method determines the face shape based on face information. After detecting eyes in face area by matching a partial template which is made with both eyes, we can estimate Y axis rotary angle by calculating the eye´s locations in three dimensional space in the reference of the face area. As a result of the experiment on various face images, the effectuality of proposed algorithm was verified.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.65-72
• /
• 1990

The potential of neural networks for the recognition of the printed Korean characters is examined. In spite of good classification capability of neural networks, it is difficult to train a neural network to recognize Korean characters. The difficulty is due to a large number of Korean characters, the similarities among the characters, and the large number of data from the character images. To reduce the input image data, DC components are extracted from each input images. These preprocessed data are used as input to the neural network. The output nodes are composed to represent the characteristics of Korean characters. A MLP (multilayer perceptron) with one hidden layer was trained with a modified BEP algorithm, This method gives good recognition rate for the standard positioned characters of more than 2,300. The result shows that neural networks are well suited for the recognition of printed Korean characters.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.1-9
• /
• 2008

One of the problems for implementing the spot detection phase in the 2-DE gel image analysis program is the eliminating noises in the image. Remained noises after the preprocessing phase cause the over-segmented regions by the segmentation phase. To identify and exclude the over-segmented background regions, if we use the fixed thresholding method that is choosing an intensity value for the threshold, the spots that is invisible by the eyes but mean a very small amount proteins which have important role in the biological samples could be eliminated. This paper propose an adaptive thresholding method that come from an idea that is got on statistical analysing for the prominences of the peaks. The adaptive thresholding method works as following. Firstly we calculate an average prominence value curve and fit it to exponential function curve, as a result we get parameters for the exponential function. And then we calculate a threshold value by using the parameters and probability distribution of errors. Lastly we apply the threshold value to the region for determining the region is a noise or not. According to the probability distribution of errors, the reliability is 99.85% and we show the correctness of the proposed method by representing experiment results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.479-488
• /
• 2002

In recent years the amount of digital video used has risen dramatically to keep pace with the increasing use of the Internet and consequently an automated method is needed for indexing digital video databases. Textual information, both superimposed and embedded scene texts, appearing in a digital video can be a crucial clue for helping the video indexing. In this paper, a new method is presented to extract both superimposed and embedded scene texts in a freeze-frame of news video. The algorithm is summarized in the following three steps. For the first step, a color image is converted into a gray-level image and applies contrast stretching to enhance the contrast of the input image. Then, a modified local adaptive thresholding is applied to the contrast-stretched image. The second step is divided into three processes: eliminating text-like components by applying erosion, dilation, and (OpenClose+CloseOpen)/2 morphological operations, maintaining text components using (OpenClose+CloseOpen)/2 operation with a new Geo-correction method, and subtracting two result images for eliminating false-positive components further. In the third filtering step, the characteristics of each component such as the ratio of the number of pixels in each candidate component to the number of its boundary pixels and the ratio of the minor to the major axis of each bounding box are used. Acceptable results have been obtained using the proposed method on 300 news images with a recognition rate of 93.6%. Also, my method indicates a good performance on all the various kinds of images by adjusting the size of the structuring element.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.793-800
• /
• 2004

In this paper, we propose a new automatic pipe grading algorithm for an efficient management of transmission pipe under the ground. Since the conventional transmission pipe evaluation was conducted by subjective decision made by an individual operator, it was difficult to grade them by means of numerical methods and also hard to realistically construct numerical database system. To solve these problems, we Int obtain some information on the current condition of pipes' sections by shooting laser beam at a regular rate and then apply grading algorithm after complete calculation of minimum diameter of pipe. We use some of preprocessing techniques to reduce noise and also use various color models to consider special conditions of each inner pipe. The measurement of pipes' minimum diameter and decision of grade are performed through a detailed processing stages. By some experimental results performed in the field, we show that over 90 percent of correct grade decisions are made by the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.215-222
• /
• 2005

In this paper, we propose a fingerprint verification algorithm for the embedded system based on the minutia extracted using the image quality, the minutia structure, and the Sequency and the orientation of ridges. After the pre- and the post-processing, the true minutia are selected, thus it shows high reliability in the fingerprint verification. In matching process, we consider the errors caused by shift, rotation, and pressure when acquiring the fingerprint image and reduce the matching time by applying a local matching instead of a full matching to select the reference pair. The proposed algorithm has been designed and verified in Arm920T environment and various techniques for the realtime process have been applied. Time taken from the fingerprint registration through out the matching is 0.541 second that is relevant for the realtime applications. The FRR (False Reject Rate) and FAR (False Accept Rate) show 0.079 and 0.00005 respectively.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.232-240
• /
• 2009

This paper presents a robust vehicle detection and tracking algorithm for supervision of illegal parking. The proposed algorithm is composed of four parts. First, a vehicle detection algorithm is proposed using the improved codebook object detection algorithm to segment moving vehicles from the input sequence. Second, a preprocessing technique using the geometric characteristics of vehicles is employed to exclude non-vehicle objects. Then, the detected vehicles are tracked by an object tracker which incorporates histogram tracking method with Kalman filter. To make the tracking results more accurate, histogram tracking results are used as measurement data for Kalman filter. Finally, Real Stop Counter (RSC) is introduced for trustworthy and accurate performance of the stopped vehicle detection. Experimental results show that the proposed algorithm can track multiple vehicles simultaneously and detect stopped vehicles successfully in the complicated street environment.

• Journal of the Korean Chemical Society
• /
• v.29 no.5
• /
• pp.496-502
• /
• 1985

The solvent extraction and cleanup processes for the simultaneous gas-liquid cliromatographic determination of 16 kinds of organochlorine pesticide residues were investigated. The pesticides were extracted out from-various crops with the aqueous acetone solution acidified (pH < 1.5) by adding conc. $H_3PO_4$. Most of the pesticides were partitioned from the solution with petroleum ether. Evaporated the extracting solvent, the residues were dissolved in ethylether-petroleum ether (6 : 94) eluent and eluted through the Florisil column activated at 650$^{\circ}$C for 2.5hrs. The extraction efficiency was over 94% and impurities were effectively removed by the column chromatography.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.655-662
• /
• 2003

In some volume visualization fields such as medical imaging, anisotropic volume data are more common than isotropic ones. In this paper, we propose an efficient rendering method for anisotropic volume data, which directly computes the intensity of intermediate samples by interpolating the intensity of two corresponding voxels on consecutive slices. Unlike density interpolation method, it does not require a preprocessing step for generating intermediate slices or additional memory for storing them. Additionally, we propose an adaptive intermediate voxel insertion method that avoids overblurring on object surfaces. This may occur when we render high frequency areas using the intensity interpolation method. Using these methods, we can improve the rendering speed without sacrificing image quality.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.1
• /
• pp.29-36
• /
• 2000

In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is used in the preprocessing of ray-tracing and records the pointer that points to a parent face of a depth value(z value) of an object determined in Z-buffer. As a result, the face which intersects with the first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We expanded our algorithm to the second ray.