• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.740-747
• /
• 2017

A fast cell contour extraction method using CUDA parallel processing technique is presented. The cell contour extraction is one of important processes to analyze cell information in pathology. However, conventional sequential contour extraction methods are slow for a huge high-resolution medical image, so they are not adequate to use in the field. We developed a parallel morphology operation algorithm to extract cell contour more quickly. The algorithm can create an inner contour and fail to extract the contour from the concave part of the cell. We solved these problems by subdividing the contour extraction process into four steps: morphology operation, labeling, positioning and contour extraction. Experimental results show that the proposed method is four times faster than the conventional one.

• 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 Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1180-1188
• /
• 2015

In this paper, a parallel cell contour line extraction algorithm using CUDA, which has no inner contour lines, is proposed. The contour of a cell is very important in a cell image analysis. It could be obtained by a conventional serial contour tracing algorithm or parallel morphology operation. However, the cell image has various damages in acquisition or dyeing process. They could be turn into several inner contours, which make a cell image analysis difficult. The proposed algorithm introduces a min-max coordinates table into each CUDA thread block, and removes the inner contour in parallel. It is 4.1 to 7.6 times faster than a conventional serial contour tracing algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.206-211
• /
• 2008

Trainee can enhance his perception of and interaction with the real world by displayed virtual objects in simulation using image processing technology. Therefore, it is essential for realistic simulation to determine the occlusion areas of the virtual object produces after registering real image and virtual object exactly. In this paper, we proposed the new method to solve occlusions which happens during virtual target moves according to the simulated route on real image using improved object contour extraction by neighboring edge search and picking algorithm. After we acquire the detailed contour of complex objects by proposed contour extraction algorithm, we extract the three dimensional information of the position happening occlusion by using MER for performance improvement. In the experiment, we compared proposed method with existed method and preyed the effectiveness in the environment which a partial occlusions happens.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.95-107
• /
• 1994

A new efficient contour following algorithm for connected-component labeling processing is proposed. The basic idea of the algorithm is that the total number of downward chain codes is the same as one of upward chain codes along the closed contour. If the chain code direction is upward, then region start mark is assigned at the chain code departure pixel and if the chain code is downward, then region end mark is assigned at the chain code arrival pixel. The proposed algorithm extracts directly the contour information from only the current direction information of chain. This makes the algorithm simple and fast and requires less memory with comparison to the conventional algorithms.The proposed contour following algorithm can be applied to the various kind of image processing such as region filling, restoration and region feature extraction.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.357-365
• /
• 2005

We present a B-spline fitting method based on genetic algorithm for the extraction of object contours from the complex image sequence, where objects with similar shape and intensity are adjacent each other. The proposed algorithm solves common malfitting problem of the existing B-spline fitting methods including snakes. Classical snake algorithms have not been successful in such an image sequence due to the difficulty in initialization and existence of multiple extrema. We propose a B-spline fitting method using a genetic algorithm with a new initial population generation and fitting function, that are designed to take advantage of the contour of the previous slice. The test results show that the proposed method extracts contour of individual object successfully from the complex image sequence. We validate the algorithm by false-positive/negative errors and relative amounts of agreements.

• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.65-79
• /
• 2003

In general, the extraction and recognition of identifier is very hard work, because the scale or location of identifier is not fixed-form. And, because the provided image is contained by camera, it has some noises. In this paper, we propose methods for automatic detecting edge using canny edge mask. After detecting edges, we extract regions of identifier by detected edge information's. In regions of identifier, we extract each identifier using contour tracking algorithm. The self-generation supervised learning algorithm is proposed for recognizing them, which has the algorithm of combining the enhanced ART1 and the supervised teaming method. The proposed method has applied to the container images. The extraction rate of identifier obtained by using contour tracking algorithm showed better results than that from the histogram method. Furthermore, the recognition rate of the self-generation supervised teaming method based on enhanced ART1 was improved much more than that of the self-generation supervised learning method based conventional ART1.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.934-936
• /
• 1995

To get a good result of the feature-based stereo matching, contour of buildings must be extracted exactly. In this paper, an algorithm that extracts contour of flat top buildings exactly is proposed. The Algorithm is composed of three steps. One is to find corner points of 4 types in whole image and another is to extract exact lines between coners by edge following technique, the third is to extract exact contour of buildings using binding structures. We have a good result in extracting contour of buildings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.575-591
• /
• 2011

We present a novel active contour-based two-pass approach to extract smooth feature regions from a triangular mesh. In the first pass, an active contour formulated in level-set surfaces is devised to extract feature regions with rough boundaries. In the second pass, the rough boundary curve is smoothed by minimizing internal energy, which is derived from its curvature. The separation of the extraction and smoothing process enables us to extract feature regions with smooth boundaries from a triangular mesh without user's initial model. Furthermore, smooth feature curves can also be obtained by skeletonizing the smooth feature regions. We tested our algorithm on facial models and proved its excellence.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.375-380
• /
• 2010

Most of previous algorithms of object boundary extraction have been studied for extracting the boundary of single object. However, multiple objects are much common in the real image. The proposed algorithm of extracting the boundary of each of multiple objects has two steps. In the first step, we propose the fast method using the outer and inner products; the initial contour including multiple objects is split and connected and each of new contours includes only one object. In the second step, an improved active contour model is studied to extract the boundary of each object included each of contours. Experimental results with various test images have shown that our algorithm produces much better results than the previous algorithms.