• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.3
• /
• pp.92-99
• /
• 1999

The inspection unit which is developed and used in this study, is processed the shape data from the CCD camera to seek welding bite section shape, and then calculated as a real dimension from measuring the value of each inspection item. The reason of measuring with the real in this study is came out from the image method which used for a long time, which is extricated the characteristic as the dimension of pixel by recognize pixel. The measurement method of the section shape is that we decide the thresholding value after we drew the histogram to binarizate the object. After that, we make flat the object to get rid of the noise and measure the shape of welded part through the boundarization of the object. The shape measurement is that measure the value of the welding part to adapt the actual operation program from using the ratio between the actual dimension of the standard specimen and the dimension of image, to measure the ratio between the actual product and the camera image. The inspection algorithm which estimates the quality of welded product is developed and also, the software GUI(Graphic User Interface) which processes the automatic test function of the inspection system is developed. We make the foundation of the inspection automatic system and we will help to apply other welding machine.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.212-222
• /
• 2003

The ability to efficiently and robustly recover accurate 3D terrain models from sets of stereoscopic images is important to many civilian and military applications. A stereo matching has been an important tool for reconstructing three dimensional terrain. However, there exist many factors causing stereo matching error, such as occlusion, no feature or repetitive pattern in the correlation window, intensity variation, etc. Among them, occlusion can be only resolved by true multi-image stereo. In this paper, we present multi-image stereo method using DEM fusion as one of efficient and reliable true multi-image methods. Elevations generated by all pairs of images are combined by the fusion process which accepts an accurate elevation and rejects an outlier. We propose three fusion schemes: THD(Thresholding), BPS(Best Pair Selection) and MS(Median Selection). THD averages elevations after rejecting outliers by thresholding, while BPS selects the most reliable elevation. To determine the reliability of a elevation or detect the outlier, we employ the measure of self-consistency. The last scheme, MS, selects the median value of elevations. We test the effectiveness of the proposed methods with a quantitative analysis using simulated images. Experimental results indicate that all three fusion schemes showed much better improvement over the conventional binocular stereo in natural terrain of 29 Palms and urban site of Avenches.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.16-25
• /
• 2020

Vegetation segmentation in a field color image is a process of distinguishing vegetation objects of interests like crops and weeds from a background of soil and/or other residues. The performance of the process is crucial in automatic precision agriculture which includes weed control and crop status monitoring. To facilitate the segmentation, color indices have predominantly been used to transform the color image into its gray-scale image. A thresholding technique like the Otsu method is then applied to distinguish vegetation parts from the background. An obvious demerit of the thresholding based segmentation will be that classification of each pixel into vegetation or background is carried out solely by using the color feature of the pixel itself without taking into account color features of its neighboring pixels. This paper presents a new pixel-based segmentation method which employs a multi-layer perceptron neural network to classify the gray-scale image into vegetation and nonvegetation pixels. The input data of the neural network for each pixel are 2-dimensional gray-level values surrounding the pixel. To generate a gray-scale image from a raw RGB color image, a well-known color index called Excess Green minus Excess Red Index was used. Experimental results using 80 field images of 4 vegetation species demonstrate the superiority of the neural network to existing threshold-based segmentation methods in terms of accuracy, precision, recall, and harmonic mean.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.31-40
• /
• 2000

A robust scheme of locating and counting the number of vehicles m urban traffic scenes, a core component of vision-based traffic monitoring systems, is presented The method is based on the evidential reasoning, where vehicle evidences m the background subtraction Image are obtained by a new locally optimum thresholding, and the evidences are merged by three heuristic rules using the geometric constraints The locally optimum thresholding guarantees the separation of bright and dark evidences of vehicles even when the vehicles are overlapped or when the vehicles have similar color to the background Experimental results on diverse traffic scenes show that the detection performance is very robust to the operating conditions such as the camera location and the weather The method may be applied even when vehicle movement is not observed since a static Image IS processed without the use of frame difference.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2076-2079
• /
• 2003

This paper describes an efficient thresholding method for the binarization of a grey-level letter image. This method determines the adaptive threshold for letter image binarization by introducing the readjusting parameter, based on the global variance of the input image. Experimental results show that the proposed binarization method outperforms on the various letter images with a texture or noise when compared to the other methods.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1305-1318
• /
• 2012

Image segmentation is one of the difficult research problems in machine vision and pattern recognition field. A commonly used segmentation method is the Otsu method. It is simpler and easier to implement but it fails if the histogram is unimodal or similar to unimodal. And if some target area is smaller than background object, then its histogram has the distribution close to unimodal. In this paper, we proposed an improved image segmentation method based on 1D Otsu method for a small target detection. To overcome drawbacks by unimodal histogram effect, we depressed the background histogram using a logarithm function. And to improve a signal to noise ratio, we used a local average value by the neighbor window for thresholding using 1D Otsu method. The experimental results show that our proposed algorithm performs better segmentation result than a traditional 1D Otsu method, and needs much less computational time than that of the 2D Otsu method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

The current paper proposes a genetic algorithm (GA)-based segmentation method that can automatically extract and track moving objects. The proposed method mainly consists of spatial and temporal segmentation; the spatial segmentation divides each frame into regions with accurate boundaries, and the temporal segmentation divides each frame into background and foreground areas. The spatial segmentation is performed using chromosomes that evolve distributed genetic algorithms (DGAs). However, unlike standard DGAs, the chromosomes are initiated from the segmentation result of the previous frame, then only unstable chromosomes corresponding to actual moving object parts are evolved by mating operators. For the temporal segmentation, adaptive thresholding is performed based on the intensity difference between two consecutive frames. The spatial and temporal segmentation results are then combined for object extraction, and tracking is performed using the natural correspondence established by the proposed spatial segmentation method. The main advantages of the proposed method are twofold: First, proposed video segmentation method does not require any a priori information second, the proposed GA-based segmentation method enhances the search efficiency and incorporates a tracking algorithm within its own architecture. These advantages were confirmed by experiments where the proposed method was success fully applied to well-known and natural video sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.163-174
• /
• 2004

The 3D tooth model in which each tooth can be manipulated individualy is essential component for the orthodontic simulation and implant simulation in dental field. For the reconstruction of such a tooth model, we need an image segmentation algorithm capable of separating individual tooth from neighboring teeth and alveolar bone. In this paper we propose a CT image normalization method and adaptive optimal thresholding algorithm for the segmenation of tooth region in CT image slices. The proposed segmentation algorithm is based on the fact that the shape and intensity of tooth change gradually among CT image slices. It generates temporary boundary of a tooth by using the threshold value estimated in the previous imge slice, and compute histograms for the inner region and the outer region seperated by the temporary boundary. The optimal threshold value generating the finnal tooth region is computed based on these two histogram.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.895-900
• /
• 2023

We study low-complexity graph sampling which selects a subset of nodes from graph nodes so as to reconstruct the original signal from the sampled one. To achieve complexity reduction, we propose a graph sampling algorithm with thresholding which selects a node with a cost lower than a given threshold at each step without fully searching all of the remaining nodes to find one with the minimum cost. Since it is important to find the threshold as close to a minimum cost as possible to avoid degradation of the reconstruction performance, we present a mathematical expression to compute the threshold at each step. We investigate the performance of the different sampling methods for various graphs, showing that the proposed algorithm runs 1.3 times faster than the previous method while maintaining the reconstruction performance.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.166-173
• /
• 2020

Multi-view images, which are widely used for providing free-viewpoint services, can enhance the quality of synthetic views when the number of views increases. However, there needs an efficient representation method because of the tremendous amount of data. In this paper, we propose a method for generating point cloud data for the efficient representation of multi-view color and depth images. The proposed method conducts sequential reconstruction of point clouds at each viewpoint as a method of deleting duplicate data. A 3D point of a point cloud is projected to a frame to be reconstructed, and the color and depth of the 3D point is compared with the pixel where it is projected. When the 3D point and the pixel are similar enough, then the pixel is not used for generating a 3D point. In this way, we can reduce the number of reconstructed 3D points. Experimental results show that the propose method generates a point cloud which can generate multi-view images while minimizing the number of 3D points.