• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.83-92
• /
• 2009

In this paper, an extended snake algorithm using color variance energy is proposed for segmenting an interest object in color image. General snake algorithm makes use of energy in image to segment images into a interesting area and background. There are many kinds of energy that can be used by the snake algorithm. The efficiency of the snake algorithm is depend on what kind of energy is used. A general snake algorithm based on active contour model uses the intensity value as an image energy that can be implemented and analyzed easily. But it is sensitive to noises because the image gradient uses a differential operator to get its image energy. And it is difficult for the general snake algorithm to be applied on the complex image background. Therefore, the proposed snake algorithm efficiently segment an interest object on the color image by adding a color variance of the segmented area to the image energy. This paper executed various experiments to segment an interest object on color images with simple or complex background for verifying the performance of the proposed extended snake algorithm. It shows improved accuracy performance about 12.42 %.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.769-778
• /
• 2004

Object segmentation is a challenging Problem when the background is cluttered and the objects are overlapped one another. Recent develop-ment using snake algorithms proposed to segment objects from a 2-D Image presents a higher possibilityfor getting better contours. However, the performance of those snake algorithms degrades rapidly when the background is cluttered and objects are overlapped one another, Moreover, the initial snake point placement is another difficulty to be resolved. Here, we propose a novel snake algorithm for object segmentation using disparity information taken from a set of stereo images. By applying our newly designed snake energy function defined in the disparity space, our algorithmeffectively circumvents the limitations found in the previous methods. The performance of the proposed algorithm has been verified by computer simulation using various stereo image sets. The experiment results have exhibited a better performance over the well-known snake algorithm in terms of segmentation accuracy.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.234-237
• /
• 2007

Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.289-298
• /
• 2009

Active Contour Model, that is, Snake algorithm is effective for detection and tracking the objects. However, this algorithm has some drawbacks; numerous parameters must be designed(weighting factors, iteration steps, etc.), a reasonable initialization must be available and moreover suffers from numerical instability. Therefore we propose a novel Energy Corrected Snake(ECS) algorithm which improved on external energy of Snake algorithm for detection and tracking the moving object more effectively. The proposed algorithm uses the difference image, getting when the object is moving. It copies four direction images from the difference image and performs the accumulating compute to erasing image noise, so that it gets external energy steadily. Then external energy united with contour that is computed by internal energy. Consequently we can detect and track the moving object more speedily and easily. To show the effectiveness of the proposed algorithm, we experiment on 3 situations. The experimental results showed that the proposed algorithm outperformed by 6$\sim$9% of detection rate and 6$\sim$11% of tracker detection rate compared with the Snake algorithm.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.527-534
• /
• 2003

An active contour model called snake is powerful tool for object contour extraction. But, conventional snakes require exhaustive computing time, sometimes can´t extract complex shape contours due to the properties of energy function, and are also heavily dependent on the position and the shape of an initial snake. To solving these problems, we propose in this paper an improved snake called "shaking snake", based on a greedy algorithm. A shaking snake consist of two steps. According to their appropriateness, we in the first step move each points directly to locations where contours are likely to be located. In the second step, we then align some snake points with a tolerable bound in order to prevent local minima. These processes shake the proposed snake. In the experimental results, we show the process of shaking the proposed shake and comparable performance with a greedy snake. The proposed snake can extract complex shape contours very accurately and run fast, approximately by the factor of five times, than a greedy snake.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2798-2800
• /
• 2003

Active contour models(called Snakes) are methods for the image segmentation. Many researchers have developed snake algorithms and then published such as GVF, GGF snake. In this paper, we present a pre-process for GGF snake algorithm. This process removes noise so that snakes can flow smoothly. In experiment, we compared a image removed noise with a image corrupted by noise. In result, the pre-process produced a good image for GGF Snake and is necessary.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.519-530
• /
• 2011

A Snake is an active contour for representing object contours. Traditional snake algorithms are often used to represent the contour of a single object. However, if there is more than one object in the image, the snake model must be adaptive to determine the corresponding contour of each object. Also, the previous initialized snake contours risk getting the wrong results when tracking multiple objects in successive frames due to the weak topology changes. To overcome this problem, in this paper, we present a new snake method for efficiently tracking contours of multiple objects. Our proposed algorithm can provide a straightforward approach for snake contour rapid splitting and connection, which usually cannot be gracefully handled by traditional snakes. Experimental results of various test sequence images with multiple objects have shown good performance, which proves that the proposed method is both effective and accurate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.21-30
• /
• 2005

In this paper, we propose lane detection and trackinB algerian using B-Snake as robust algorithm. One of chief virtues of Lane detection algorithm using B-Snake is that it is possible to specify a wider range of lane structure because B-Spline conform an arbitrary shape by control point set and that it doesn't use any camera parameter. Using a robust algorithm called CHVEP, we find the vanishing point, width of lane and mid-line of lane because of the perspective parallel line and then we can detect the both side of lane mark using B-snake. To demonstrate that this algorithm is robust against noise, shadow and illumination variations in road image, we tested this algorithm about various image divided by weather-fine, rainy and cloudy day. The percentage of correct lane detection is over 95$\%$.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.740-745
• /
• 2003

Motion tracking and object segmentation are the most fundamental and critical problems in vision tasks suck as motion analysis. An active contour model, snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid objects. Snake is designed no the basis of snake energies. Segmenting and tracking can be executed successfully by energy minimization. In this research, two new paradigms for segmentation and tracking are suggested. First, because the conventional method uses only intensity information, it is difficult to separate an object from its complex background. Therefore, a new energy and design schemes should be proposed for the better segmentation of objects. Second, conventional snake can be applied in situations where the change between images is small. If a fast moving object exists in successive images, conventional snake will not operate well because the moving object may have large differences in its position or shape, between successive images. Snakes's nodes may also fall into the local minima in their motion to the new positions of the target object in the succeeding image. For robust tracking, the condensation algorithm was adopted to control the parameters of the proposed snake model called "adaptive color snake model(SCSM)". The effectiveness of the ACSM is verified by appropriate simulations and experiments.