• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.195-200
• /
• 2014

Typical methods of active contour model for object contour extraction are snake and level. Snake is usually faster than level set, but has limitation to compute topology of objects. Level set on the other hand is slower but good at it. In this paper, a new object contour extraction algorithm to use advantage of each is proposed. The algorithm is composed of two main steps. In the first step, snake is used to extract the rough contour and then in the second step, level set is applied to extract the complex contour exactly. 5 binary images and 2 natural images with different contours are simulated by a proposed algorithm. It is shown that speed is reduced and contour is better extracted.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.1-7
• /
• 2011

Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1088-1097
• /
• 2003

In this paper, we propose a method that improves the snakes algorithm well known as previously active contour model. Generally, the previous snakes algorithm applied to the 2-D images doesn't get the good results due to the influences about other objects adjacent to contour of object to be extracted. Users directly set the initial snakes points near to the contour of the object to get better results. In this paper, using the disparity information of the stereo images, a new algorithm of the object segmentation is proposed to reduce the influences adjacent to the contour of object. Users can establish initial snakes points automatically from the setting of the interested regions.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.109-117
• /
• 2004

In this paper, we propose an object contour tracking algorithm using snakes in stereo image sequences. The proposed technique is composed of two steps. In the first step, the candidate Snake points are determined from the motion information in 3-D disparity space. In the second step, the energy of Snake function is calculated to check whether the candidate Snake points converge to the edges of the interested objects. The energy of Snake function is calculated from the candidate Snake points using the disparity information obtained by patch matching. The performance of the proposed technique is evaluated by applying it to various sample images. Results prove that the proposed technique can track the edges of objects of interest in the stereo image sequences even in the cases of complicated background images or additive components.

• The KIPS Transactions:PartB
• /
• v.19B no.4
• /
• pp.221-224
• /
• 2012

The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can't split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.501-506
• /
• 2008

The classical snake algorithm has a problem in detecting the boundary of an object with deep concavities. While the GVF method can successfully detect boundary concavities, it consumes a lot of time computing the energy map. In this paper, we propose an algorithm to reduce the computation time and improve performance in detecting the boundary of an object with high concavity. We define the degree of complexity of object boundary as the local curvature. If the value of the local curvature is greater than a threshold value, new snake points are added. Simulation results on several different test images show that our method performs well in detecting object boundary and requires less computation time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.125-131
• /
• 2016

Tongue image segmentation is critical for automation of the tongue diagnosis system. However, most image segmentation methods for tongue diagnosis systems in oriental medicine have been proposed as user-based manual types or semi-automatic types. This study proposed a new method for tongue image segmentation, which is the most important image processing stage for complete automation of the tongue diagnosis system in oriental medicine. The proposed method improved the conventional snake algorithm, by making improvement on the internal energy function so that, as the points move outward reversely, the snake energy function is minimized, by using the image characteristics of tongue images. To calculate external energy, hierarchical spatial filtering is applied to ensure resistance against noise. Also, The proposed method was tested by using sample images and actual images, and showed more robustness against the background noise than the conventional snake algorithm. And, when one selected point was moved by the improved snake algorithm, energy values at the starting, middle, and end points were analyzed, and showed robustness that does not fall in the local minima.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.2
• /
• pp.243-252
• /
• 2018

In this paper, we propose a bone region extraction method using a snake algorithm and a particle filter in CT image. We extract the bone outline using the snake algorithm, and extract the bone area by moving the particle filter along this outline. If other bones are in close proximity to the bone outline, the snake algorithm may not be able to extract the bone outline completely. At this time, the particle filter extracts the bone area while compensating for the error. In this paper, we compared the proposed method with the conventional morphological processing method. The result is similar when other bones are not close to the bone area to be extracted. However, if other bones are close to each other, The accuracy of the proposed method is higher than the conventional morphological processing method.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.451-454
• /
• 2001

본 논문에서는 그룹화 블록스네이크와 영상분할을 이용하여 다차선을 검출하고 컬러 정보를 기반으로 차량 후면에 위치하는 미등과 브레이크등을 인식, 저속 주행환경에서의 다차선 및 전방차량을 인식하는 알고리즘을 제안하였다. 제안한 알고리즘에서는 기울기 값과 명암도 값으로 기초 블록을 얻은 뒤, 차선의 가능성이 큰 블록을 탐색하여 영상분할을 시행한다. 영상 분할에서 잡음 블록들을 제거하여 차선일 가능성이 가장 높은 블록들만을 검출하고, 그룹화 블록스네이크를 이용하여 차선을 검출하도록 하였다. 또한 전방 차량인식을 위해 미등과 브레이크등의 컬러 특징을 이용하여 후보 영역을 분할한 후, 미등과 브레이크등의 패턴의 기하학적 특징과 위치적 특징을 이용하여 한 쌍의 미등 혹은 브레이크등을 탐지하도록 하였다. 탐지된 양쪽 등의 위치정보를 이용하여 전방차량의 위치를 측정 할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.445-453
• /
• 2000

In this paper we propose the method which extracts lane using the grouped block snake algorithm. In the proposed algorithm, input image is divided into $8\times{8}$ blocks and then noise-included blocks are removed by a probability-based method. And also, we use hough transform to separate lane from the background image and suggest a grouped block snake method to detect road lane blocks. The proposed method reduces computational complexity and removes the noise in a more effective way compared to the pixel-based snake method.