• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.101-109
• /
• 2014

It is an essential element for the establishment of image processing related systems to find the exact contour from the image of an arbitrary object. In particular, if a vision system is established to inspect the products in the automated production process, it is very important to detect the contours for standardized shapes such lines and curves. In this paper, we propose a prototype adaptive dynamic contour model, p-Snake with improved contour extraction algorithms by adding the prototype energy. The proposed method is to find the initial contour by applying the existing Snake algorithm after Sobel operation is performed for prototype analysis. Next, the final contour of the object is detected by analyzing prototypes such as lines and circles, defining prototype energy and using it as an additional energy item in the existing Snake function on the basis of information on initial contour. We performed experiments on 340 images obtained by using an environment that duplicated the background of an industrial site. It was found that even if objects are not clearly distinguished from the background due to noise and lighting or the edges being insufficiently visible in the images, the contour can be extracted. In addition, in the case of similarity which is the measure representing how much it matches the prototype, the prototype similarity of contour extracted from the proposed p-ACM is superior to that of ACM by 9.85%.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.139-140
• /
• 2008

지상라이다는 고정도의 3차원 영상을 제공하고 레이저 빔을 현장이나 대상물에 발사하여 짧은 시간에 수백만점의 3차원좌표를 기록할 수 있는 최신 측량장비로서 다양한 응용분야에서 두각을 나타내고 있다. 본 연구에서는 지상라이다를 이용한 건축물의 3자윈 자동 윤곽선 추출을 다룬다. 지상라이다는 건축물의 3차원 윤곽선을 신속하게 추출할 수 있지만 지상기반 시스템이므로 여러 가지 장애물 때문에 건국물의 하단부에서는 추출이 쉽지 않다. 기존 항공라이다를 이용한 알고리즘에서는 사진의 색상차나 모폴로지 특성에 의존하여 범위를 제한하고, 이를 기반으로 윤곽선을 추출하였다. 하지만 지상라이다의 경우 항공라이다에 비해 분해능이 월등히 높다. 또한, 지상라이다는 지상에서 측정하기 때문에 항공라이다에서 어려운 건축물의 측면이나 정면도 윤곽선 추출이 가능하기 때문에 본 논문에서는 사진을 이용하지 않고 전처리를 하지 않은 데이터를 직접 이용하여 건물의 정면 윤곽선을 추출하는 것을 제안한다. 건물의 크기와 데이터 수 즉, 라이다로 측정한 포인트 수를 고려한 효율적인 Decimation방법을 제안하고 또한, Decimation된 데이터이서 지역적으로 제일 큰 값과 작은 값을 찾아낸다. 그 중 많이 벗어난 점을 편차를 이용하여 제거한다. 이렇게 찾아낸 건축물의 외곽점들을 이어 만든 윤곽선을 최종적으로 보간하여 좀 더 현실과 가까운 윤곽선 추출 방법을 제안한다.

• 전자공학회논문지 IE
• /
• v.46 no.1
• /
• pp.7-15
• /
• 2009

In this paper, automatic structure boundary extraction is proposed using terrestrial LIDAR (Light Detection And Ranging) in 3-dimensional data. This paper describes an algorithm which does not use pictures and pre-processing. In this algorithm, an efficient decimation method is proposed, considering the size of object, the amount of LIDAR data, etc. From these decimated data, object points and non-object points are distinguished using distance information which is a major features of LIDAR. After that, large and small values are extracted using local variations, which can be candidate for boundary. Finally, a boundary line is drawn based on the boundary point candidates. In this way, the approximate boundary of the object is extracted.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.114-123
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.633-638
• /
• 2005

The extraction of a face is a very important part for human interface, biometrics and security. In this paper, we applies DCM(Dilation of Color and Motion) filter and Active Contour Models to extract facial outline. First, DCM filter is made by applying morphology dilation to the combination of facial color image and differential image applied by dilation previously. This filter is used to remove complex background and to detect facial outline. Because Active Contour Models receive a large effect according to initial curves, we calculate rotational degree using geometric ratio of face, eyes and mouth. We use edgeness and intensity as an image energy, in order to extract outline in the area of weak edge. We acquire various head-pose images with both eyes from five persons in inner space with complex background. As an experimental result with total 125 images gathered by 25 per person, it shows that average extraction rate of facial outline is 98.1% and average processing time is 0.2sec.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.91-99
• /
• 2019

In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using $R^*-tree$ in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.19-27
• /
• 2010

This paper proposes a method for enhancing detection performance and reducing computational cost when detecting a human face by applying B-spline active contour to the frame difference of consecutive images. Firstly, the method estimates amount of user's motion using kurtosis. If the kurtosis is smaller than a pre-defined threshold, it is considered that the amount of user's motion is insufficient and thus the contour fitting is not applied. Otherwise, the contour fitting is applied by exploiting the fact that the amount of motion is sufficient. Secondly, for the contour fitting, difference edges are detected by combining the distance transformation of the binarized frame difference and the edges of current frame. Lastly, the face is located by assigning the contour fitting process to the detected difference edges. Kurtosis-based motion amount estimation can reduce a computational cost and stabilize the results of the contour fitting. In addition, distance transformation-based difference edge detection can enhance the problems of contour lag and discontinuous difference edges. Experimental results confirm that the proposed method can reduce the face localization error caused by the contour lag and discontinuity of edges, and decrease the computational cost by omitting approximately 39% of the contour fitting.

• Journal of the Korea Convergence Society
• /
• v.9 no.9
• /
• pp.31-39
• /
• 2018

In this paper, we proposed a license plate detection method based on contour extraction that adapts to environmental changes. The proposed method extracts contour lines using DoG (Difference of Gaussian) to remove unnecessary noise parts in the contour extraction process. Binarization was applied in ugly outline images, and erosion and dilation operations were used to emphasize the contour of the character part. Then, only the outline of the ratio of the characters of the plate was extracted through the ratio of the width and height of the characters. And the case where the outline is the longest is estimated by estimating the characters of the license plate. For the experiment, we applied 130 image data to license plate on the front of the vehicle, oblique environment, and environment images with various backgrounds. I also experimented with motorcycle images of different license plate patterns. Experimental results showed that the detection rate of the oblique image was 93% and that of the various background environment was 70% in the motorcycle image but 98% in the front image.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.712-717
• /
• 2003

A novel multi-snake is proposed for efficient extraction of multi-object contours from a natural scene. An NTGST(noise-tolerant generalized symmetry transform) is used as a context-free attention operator to detect and locate multiple objects from a complex background and then the snake points are automatically initialized nearby the contour of each detected object using symmetry map of the NTGST before multiple snakes are introduced. These procedures solve the knotty subjects of automatic snake initialization and simultaneous extraction of multi-object contours in conventional snake algorithms. Because the snake points are initialized nearby the actual contour of each object, as close as possible, contours with high convexity and/or concavity can be easily extracted. The experimental results show that the proposed method can efficiently extract multi-object contours from a noisy and complex background of natural scenes.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.