• Proceedings of KOSOMES biannual meeting
• /
• 2005.11a
• /
• pp.197-202
• /
• 2005

Generally, a semiconductor chip measured with a few micro units is captured by line scan camera for higher inspection accuracy. However, the faulty inspection requires an exact boundary detection algorithm because it is very sensitive to scan speed and lighting conditions. In this paper we propose boundary detection using subpixel edge detection method in order to increase the accuracy of bump faulty detection on chips. The bump edge is detected by first derivative to four directions from bump center point and the exact edge positions are searched by the subpixel method. Also, the exact bump boundary to calculate the actual bump size is computed by LSM(Least Squares Method) to minimize errors since the bump size is varied such as bump protrusion, bump bridge, and bump discoloration. Experimental results exhibit that the proposed algorithm shows large improvement comparable to the other conventional boundary detection algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.793-799
• /
• 2007

Generally, a semiconductor chip measured with a few micro units is captured by line scan camera for higher inspection accuracy. However, the faulty inspection requires an exact boundary detection algorithm, because it is very sensitive to scan speed and lighting conditions. In this paper we propose boundary detection with subpixel edge detection in order to increase the accuracy of bump faulty detection on chips. The bump edge is detected by first derivative to four directions from bump center point and the exact edge positions are searched by the subpixel method. Also, the exact bump boundary to calculate the actual bump size is computed by LSM(Least Squares Method) to minimize errors since the bump size is varied such as bump protrusion, bump bridge, and bump discoloration. Experimental results exhibit that the proposed algorithm shows large improvement comparable to the other conventional boundary detection algorithms.

• Journal of Biomedical Engineering Research
• /
• v.17 no.3
• /
• pp.365-372
• /
• 1996

The researches to acquire diagnostic parameters from ultrasonic images are advanced with the progress of the digital image processing technique. Especially, the detection of endocardial boundary is very important in ultrasonic images, because endocardial boundary is used as a clinical parameter to estimate both the cardiac area and the variation of cardiac volume. Various methods to detect cardiac boundary are proposed, but these are insufficient to detect boundary. In this paper, an algorithm that detects the endocardial boundary, expanding the cavity region from the center using statistical information, is proposed The value of mean and sty:nd, wd deviation in cavity region is lower than those in muscle re- gion. Therefore, if we define the multiplication of mean and standard deviation as homogeneous coefficient, it can lead to conclusion that the pixels with small variation of these coefficleno are cavity region, and extraction of endocardial boundary from cavity region is possible. The proposed method detected endocardial boundary more effectively than edge based or threshold based method and is robuster to noise than radial searching method that has high dependency for center position.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.101-104
• /
• 2001

This paper proposes a unique shot boundary detection algorithm for the video indexing and/or browsing. Conventional methods based on the frame differences and the histogram differences are improved. Instead of using absolute frame differences, block by block based relative frame differences are employed. Frame adaptive thresholding values are also employed for the better detection. for the cases that the frame differences are not enough to detect the shot boundary, histogram differences are selectively applied. Experimental results show that the proposed algorithm reduces both the “false positive” errors and the “false negative” errors especially for the videos of dynamic local and/or global motions

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1297-1304
• /
• 2008

This paper proposes a machine learning approach for language-independent sentence boundary detection. The proposed method requires no heuristic rules and language-specific features, such as part-of-speech information, a list of abbreviations or proper names. With only the language-independent features, we perform experiments on not only an inflectional language but also an agglutinative language, having fairly different characteristics (in this paper, English and Korean, respectively). In addition, we obtain good performances in both languages. We have also experimented with the methods under a wide range of experimental conditions, especially for the selection of useful features.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11b
• /
• pp.279-286
• /
• 2000

The objective of this research is to detect the papaya fruits on tree in an orchard. The detection of papaya on natural background is difficult because colors of fruits and background such as leaves are similarly green. We cannot separate it from leaves by color information. Therefore, this research will use shape information instead. First, we detect an interested object by detecting its boundary using edge detection technique. However, the edge detection will detect every objects boundary in the image. Therefore, shape description technique will be used to describe which one is the interested object boundary. The good shape description should be invariant in scaling, rotating, and translating. The successful concept is to use Fourier series, which is called "Fourier Descriptors". Elliptic Fourier Descriptors can completely represent any shape, which is selected to describe the shape of papaya. From the edge detection image, it takes a long time to match every boundary directly. The pre-processing task will reduce non-papaya edge to speed up matching time. The deformable template is used to optimize the matching. Then, clustering the similar shapes by the distance between each centroid, papaya can be completely detected from the background.

• Journal of Biomedical Engineering Research
• /
• v.11 no.2
• /
• pp.217-226
• /
• 1990

This paper presents a new algorithm that extracted lung region in X-ray and enhanced the region. With a lung region that was extracted by histogram threshold value, it was diffi cult to detect perfect lung boundary. Therefore we presented perfect lung boundary detection method using apex detection and apex region restoration. Also, by applying modified equalization algorithm and presented function to inside of lung region, we want to give help to automatic diagnosis In X-ray chest image. Presented main line trace algorithm gave good result in detection of lung boundary And, as apex detection method using lung row and column gray level average value found more correct place of lung than the rpethod of prior algorithm, we succeeded perfect lung region detection, Also, presented function that had lung region's gray level distribution characteristic was very effective to image enhancement.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.101-108
• /
• 2010

Many works on energy-efficient cluster event detection schemes have been done considering the energy restriction of sensor networks. The existing cluster event detection schemes transmit only the boundary information of detected cluster event nodes to the base station. However, If the range of the cluster event is widened and the distribution density of sensor nodes is high, the existing cluster event detection schemes need high transmission costs due to the increase of sensor nodes located in the event boundary. In this paper, we propose an energy-efficient cluster event detection scheme using the minimum boundary polygons (MBP) that can compress and summarize the information of event boundary nodes. The proposed scheme represents the boundary information of cluster events using the MBP creation technique in the large scale of sensor network environments. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the performance evaluation. Simulation results show that our scheme maintains about 92% accuracy and decreases about 80% in energy consumption to detect the cluster event over the existing schemes on average.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.181-183
• /
• 2004

In this paper, We proposed an algorithm which extraction iris region from 2D image. Our method is composed of three parts : internal boundary defection and external boundary detection. Since eyelid and eyelash cover part of the boundary and the size of iris changes continuously, it is difficult to extract iris region accurately. For the interior and exterior boundary detection, we used partial differentiation of histogram. Performance of the proposed algorithm is tested and evaluated using 360 iris image samples.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.30-37
• /
• 1997

We present an efficient technique, bidirectioanl inertial maximum cost search technique, for th edetection and segmentation of circular shaped objects using the spatial information around the neighborhood of the boundary candidates. This technique searches boundary candidates using local pixdl information such as pixel value and its direction. And then to exclude pseudo-boundary caused by shadows or noises, the local contrast is defined between the clique of the boundary candidates and the cliques of the background. In order to effectively segment circular shaped boundary, the technique also uses the curvature based on trigonometirc function which determines circular shaped boundary segments. Since the proposed technique is applied to the pixel cliques instead of a pixel itself, it is proposed method can easily find out circular boundaries form iamges of the PCB containing circular shaped parts and the trees with round fruits compared to boundary detection by using the pixel information and the laplacian curvature.