• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.34-36
• /
• 2009

This paper proposes an effective lane detection algorithm using hugh transform and lane model. The proposed lane detection algorithm includes two major components, i.e., lane marks segmentation and an exact lane extraction using a novel postprocessing technique. The first step is to segment lane marks from background images using HSV color model. Then, a novel postprocessing is used to detect an exact lane using Hugh transform and lane models(linear and curved lane models). The postprocessing consists of three parts, i.e, thinning process, Hugh Transform and filtering process. We divide input image into three regions of interests(ROIs). Based on lane curve function(LCF), we can detect an exact lane from various extracted lane lines. The lane models(linear and curved lane mode]) are used in order to judge whether each lane segment is fit or not in each ROIs. Experimental results show that the proposed scheme is very effective in lane detection.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.4
• /
• pp.499-505
• /
• 1998

In developing an automated surface inspect algorithm, we have designed a hierarchical classifier using neural network. The defects which exist on the surface of cold mill strip have a scattering or singular distribution. We have considered three major problems, that is preprocessing, feature extraction and defect classification. In preprocessing, Top-hit transform, adaptive thresholding, thinning and noise rejection are used Especially, Top-hit transform using local minimax operation diminishes the effect of bad lighting. In feature extraction, geometric, moment, co-occurrence matrix, and histogram ratio features are calculated. The histogram ratio feature is taken from the gray-level image. For defect classification, we suggest a hierarchical structure of which nodes are multilayer neural network classifiers. The proposed algorithm reduced error rate by comparing to one-stage structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.122-125
• /
• 2003

An adaptive contour smoothing algorithm designed as a preprocessor for shape coders is presented. In the proposed method, the degree of the adaptive smoothing is controlled based on the significance of each contour point, which is quantified according to inter-region contrast in an intensity image. The actual smoothing consists of an expansion operator and a thinning algorithm. Experimental results show that the proposed method results in a saving of about 20% in number of coded bits with a negligible additional texture degradation in the reconstructed intensity image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.455-466
• /
• 1990

Enalish character recognition with the neural networl algorithm has been performed. Character recognition technition techniques which are processed by software, have the limit of the recognition speed. To overcome this limit, we realize this system to hardware by using the neural network algorithm. We have designed preprocessing chip using the neural nework model, that is single layer perceptorn, in the noise elimination, smoothing, thinning and feature point extraction. These chips are implemented as a CMOS double metal 2um design rule.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.27-37
• /
• 1991

A recognition algorithm for Hangul is developed by structural analysis to Hangul in this theses. Four major procedures are proposed : preprocessing, type classification, separation of consonant and vowel, recognition. In the preprocessing procedure, the thinning algorithm proposed by CHEN & HSU is applied. In the type classification procedure, thinned Hangul image is classified into one of six formal types. In the separation of consonant and vowel procedure, starting from branch-points which are existed in a vowel, character elements are separated by means of tracing branch-point pixel by pixel and comparison with proposed templates. In the same time, the vowels are recognized. In the recognition procedure, consonants are extracted from the separated Hangul character and recognized by modified Crossing method. Recognized characters are converted into KS-5601-1989 codes. The experiments show that correct recognition rate is about 80%-90% and recognition speed is about 2-3 character persecond in three types of different input data on computer with 80386 microprocessor.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.11-22
• /
• 1992

Up to now, most researches on production automation have concentrated on local automation, e. g. CAD, CAM, robotics, etc. However, to achieve total automation it is required to link each local modules such as CAD, CAM into a unified and integrated system. One such missing link is between CAD and computer vision system. This thesis is an attempt to link the gap between CAD and computer vision system. In this paper, we propose algorithms that carry out edge detection, thinning and pruning from the image data of manufactured parts, which are obtained from video camera and then transmitted to computer. We also propose a feature extraction and surface determination algorithm which extract informations from the image data. The informations are compatible to IGES CAD data. In addition, we suggest a methodology to reduce search efforts for CAD data bases. The methodology is based on graph submatching algorithm in GEFG(Generalized Edge Face Graph) representation for each part.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.11 s.188
• /
• pp.58-67
• /
• 2006

Due to the variety of signal processing and complicated mathematical analysis, it is not easy to accomplish 3D bin-picking with non-contact sensor. To solve this difficulties the reliable signal processing algorithm and a good sensing device has been recommended. In this research, 3D laser scanner and CCD camera is applied as a sensing device respectively. With these sensor we develop a two-step bin-picking method and reliable algorithm for the recognition of 3D bin object. In the proposed bin-picking, the problem is reduced to 2D intial recognition with CCD camera at first, and then 3D pose detection with a laser scanner. To get a good movement in the robot base frame, the hand eye calibration between robot's end effector and sensing device should be also carried out. In this paper, we examine auto-calibration technique in the sensor calibration step. A new thinning algorithm and constrained hough transform is also studied for the robustness in the real environment usage. From the experimental results, we could see the robust bin-picking operation under the non-aligned 3D hole object.

• 전자공학회논문지 IE
• /
• v.48 no.4
• /
• pp.1-6
• /
• 2011

In this paper we show the LCD simulator for defect inspection using image processing algorithm and neural network. The defect inspection algorithm of the LCD consists of preprocessing, feature extraction and defect classification. Preprocess removes noise from LCD image, using morphology operator and neural network is used for the defect classification. Sample images with scratch, pinhole, and spot from real LCD color filter image are used. From some experiments results, the proposed algorithms show that defect detected and classified in the ratio of 92.3% and 94.5 respectively. Accordingly, in this paper, a possibility of practical implementation of the LCD defect inspection system is finally suggested.

• Journal of Forest and Environmental Science
• /
• v.24 no.3
• /
• pp.143-149
• /
• 2008

We conduct economic analysis of the snow damage on sugi (Cryptomeria japonica) forest stands in Toyama Prefecture, Japan. We utilize a single tree and distant independent growth simulator called "Silv-Forest." With this growth simulator, we developed an optimization model by dynamic programming, called DP-Silv (Dynamic Programming Silv-Forest). The MS-PATH (multiple stage projection alternative technique) algorithm was embedded as a searching algorithm of dynamic programming. The height / DBH ratio was used to constrain the thinning regime for snow damage protection. The optimal rotation age turned out to be 65 years for the non-restricted case, while it was 50 years for the restricted case. The difference in NPV of these two cases as the induced costs ranged from 179,867 to 1,910,713yen/ha over the rotation age of 20 to 75 years. Under the optimal rotation of 65 years, the cost became 914,226 yen/ha. The estimated annual payment based on the difference in NPV, was from 9,869 yen/ha/yr to 85,900 yen/ha/yr. All in all, 10,000 yen/ha/yr to 20,000 yen/ha/yr seems to cover the payment from the rotation age of 35 to 75 years.