• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.1-6
• /
• 2003

The study is to automatically or semi-automatically detect the accurate contour of tumors or lesions using active contour models (Snakes) in the MRI images of the brain. In the study we have improved the energy-minimization problem of snakes using dynamic programming and have utilized the values of the canny edge detector by the image force to make the snake less sensitive in noises. For the extracted boundary, the inside area, the perimeter and its center coordinates could be calculated. In addition, the multiple 2D slices with the contour of the lesion wore combined to visualized the shape of the lesion in 3D. We expect that the proposed method in this paper will be useful to make a treatment plan as well as to evaluate the treatments.

• Journal of Korea Multimedia Society
• /
• v.18 no.7
• /
• pp.827-833
• /
• 2015

In this paper, we have compared three level set-based active contour (LSAC) methods on inhomogeneous MR image segmentation which is known as an important role of brain diseases to diagnosis and treatment in early. MR image is often occurred a problem with similar intensities and weak boundaries which have been causing many segmentation methods. However, LSAC method could be able to segment the targets such as the level set based on the local image fitting energy, the local binary fitting energy, and local Gaussian distribution fitting energy. Our implemented and tested the subcortical image segmentations were the corpus callosum and hippocampus and finally demonstrated their effectiveness. Consequently, the level set based on local Gaussian distribution fitting energy has obtained the best model to accurate and robust for the subcortical image segmentation.

• Proceedings of the KSMRM Conference
• /
• 2002.11a
• /
• pp.126-126
• /
• 2002

Purpose： For quantitative analysis of the cardiac diseases, it is necessary to segment the left-ventricle(LV) in MR cardiac images. Snake or active contour model has been used to segment LV boundary. In using these models, however, the contour of the LV may not converge to the desirable one because the contour may fall into local minimum value due to image artifact in inner region of the LV Therefore, in this paper, we propose the new preprocessing method using K-means clustering and merging algorithms that can improve the performance of the active contour model.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.753-762
• /
• 2006

The Snakes and GVF used to find object edges dynamically have assigned their initial contour arbitrarily. If the initial contours are located in the neighboring regions of object edges, Snakes and GVF can be close to the true boundary. If not, these will likely to converge to the wrong result. Therefore, this paper proposes a new initialization of Snakes and GVF using convex hull approximation, which initializes the vertex of Snakes and GVF as a convex polygonal contour near object edges. In simulation result, we show that the proposed algorithm has a faster convergence to object edges than the existing methods. Our algorithm also has the advantage of extracting whole edges in real images.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.17-22
• /
• 2002

This paper used an active contour model which was based on level set algorithms and bidirectional curve evolution theory in order to track the shape of the heart acting continuously. Most active contour models would be failed in boundary extraction because of their unstable movement in the edge gap locations. In this paper, we suggest a new active contour model using only image intensity value and additional constraint needed for stable extraction. Our model was successfully run on either shape extraction or object tracking without any position constraints of initial curve. Also demonstrated stable movements and showed good results at weak or missing boundary locations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.89-92
• /
• 1996

In this paper, we developed visual tracking algorithm using double active bar. The active bar model to represent the object can reduce the search space of energy surface and better performance than those of snake model. However, the contour will not find global equilibrium when driving force caused by image may be weak. To overcome this problem. Double active bar is proposed for finding the global minimum point without any dependence on initialization. To achieve the goal, an deformable model with two initial contours in attempted to search for a global minimum within two specific initial contours. This approach improve the performance of finding the contour of target. To evaluate the performance, some experiments are executed. We can achieved the good result for tracking a object on noisy image.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.95-104
• /
• 2006

The Gradient Vector Flow (GVF) snake or active contour model offers the best performance for image segmentation. However, there are problems in classical snake models such as the limited capture range and the slow progress into concavity. This paper presents a new method for enhancing the performance of the GVF snake model by extending the external force fields from the neighboring fields and using a modified smoothing method to regularize them. The results on a simulated U-shaped image showed that the proposed method has larger capture range and makes it possible for the contour to progress into concavity more quickly compared with the conventional GVF snake model.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.55-60
• /
• 2003

For quantitative analysis of the cardiac diseases. it is necessary to segment the left-ventricle (LY) in MR (Magnetic Resonance) cardiac images. Snake or active contour model has been used to segment LV boundary. However, the contour of the LV front these models may not converge to the desirable one because the contour may fall into local minimum value due to image artifact inside of the LY Therefore, in this paper, we Propose the Preprocessing method using k-means clustering and merging algorithms that can improve the performance of the active contour model. We verified that our proposed algorithm overcomes local minimum convergence problem by experiment results.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.5
• /
• pp.1220-1228
• /
• 1995

In this paper, we consider the problems of tracking an object in a real image. In evaluating these problems, we explore a new technique based on an active contour model commonly called a snake model, and propose the active bar models to represent target. Using this model, we simplified the target welection problems, reduced the search space of energy surface, and obtained the better performances than those of snake model. This approach improves the numerical stability and the tendency for points to bunch up and speed up the computational efficiency. Representing the object by active bar, we can easily obtain the zeroth, the first, and the second moment and it facilitates the target tracking. Finally, we present the good result for the visual tracking problem.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.5
• /
• pp.39-46
• /
• 2007

Research on human identification in ubiquitous environment has recently attracted a lot of attention. As one of those research, gait recognition is an efficient method of human identification using physical features of a walking person at a distance. In this paper, we present a human shape extraction and tracking for gait recognition using geodesic active contour models(GACMs) combined with mean shift algorithm The active contour models (ACMs) are very effective to deal with the non-rigid object because of its elastic property. However, they have the limitation that their performance is mainly dependent on the initial curve. To overcome this problem, we combine the mean shift algorithm with the traditional GACMs. The main idea is very simple. Before evolving using level set method, the initial curve in each frame is re-localized near the human region and is resized enough to include the targe region. This mechanism allows for reducing the number of iterations and for handling the large object motion. The proposed system is composed of human region detection and human shape tracking modules. In the human region detection module, the silhouette of a walking person is extracted by background subtraction and morphologic operation. Then human shape are correctly obtained by the GACMs with mean shift algorithm. In experimental results, the proposed method show that it is extracted and tracked efficiently accurate shape for gait recognition.