• Journal of International Society for Simulation Surgery
• /
• v.1 no.2
• /
• pp.75-79
• /
• 2014

Purpose The region growing has a critical problem that it often extract vessels with unexpected objects such as a bone which has a similar intensity characteristics to the vessel. We propose the new method to extract arterial vascular anatomy around the stomach from the CTA volume without the post-processing. Materials and Methods Our method, which is also based on the region growing, requires the two seed points from the use. I automatically extracts perigastric arteries using the adaptive region growing method and it does not need any post-processing. Results The three region growing based methods are used to extract perigastric arteries - the conventional region growings with restrict and loose thresholds each and the proposed method. The 3D visualization from the result of our method shows our method extracted the all required arteries for gastric surgery. Conclusion By extracting perigastric arteries using the proposed method, over-segmentation problem that unexpected anatomical objects such as a rib or backbone are also segmented does not occurs anymore. The proposed method does not need to sensitively determine the thresholds of the similarity function. By visualizing the result, the preoperative simulation of arterial vascular anatomy around the stomach can be possible.

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

In this paper, we propose an adaptive pavement region detection method that is robust to changes of structural patterns in a natural scene. In order to segment out a pavement reliably, we propose two step approaches. We first detect the borderline of a pavement and separate out the candidate region of a pavement using VRays. The VRays are straight lines starting from a vanishing point. They split out the candidate region that includes the pavement in a radial shape. Once the candidate region is found, we next employ the adaptive multi-seed region growing(A-MSRG) method within the candidate region. The A-MSRG method segments out the pavement region very accurately by growing seed regions. The number of seed regions are to be determined adaptively depending on the encountered situation. We prove the effectiveness of our approach by comparing its performance against the performances of seed region growing(SRG) approach and multi-seed region growing(MSRG) approach in terms of the false detection rate.

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

In this paper, we propose a smoke detection method using region growing method in outdoor video sequences. Our proposed method is composed of three steps; the initial change area detection step, the boundary finding and expanding step, and the smoke classification step. In the first step, we use a background subtraction to detect changed areas in the current input frame against the background image. In difference images of the background subtraction, we calculate a binary image using a threshold value and apply morphology operations to the binary image to remove noises. In the second step, we find boundaries of the changed areas using labeling algorithm and expand the boundaries to their neighbors using the region growing algorithm. In the final step, ellipses of the boundaries are estimated using moments. We classify whether the boundary is smoke by using the temporal information.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.59-62
• /
• 2002

Watershed Segmentation with Multiple Merging Conditions in Region Growing Process The watershed segmentation method holds the merits of edge-based and region-based methods together, but still shows some problems such as over segmentation and merging fault. We propose an algorithm which overcomes the problems of the watershed method and shows efficient performance for .general images, not for specific ones. The algorithm segments or merges regions by thresholding the depths of the catchment basins, the similarities and the sizes of the regions. The experimental results shows the reduction of the number of the segmented regions that are suitable to human visual system and consciousness.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.2
• /
• pp.125-132
• /
• 2004

In this paper, we propose a new two-stage segmentation method for the effective object recognition which uses region-growing algorithm and k-means clustering method. At first, an image is segmented into many small regions via region growing algorithm. And then the segmented small regions are merged in several regions so that the regions of an object may be included in the same region using typical k-means clustering method. This paper also establishes similarity measurement which is useful for object recognition in an image. Similarity is measured by fuzzy system whose input variables are compactness, magnitude of biasness and orientation of biasness of the object image, which are geometrical features of the object. To verify the effectiveness of the proposed two-stage segmentation method and similarity measurement, experiments for object recognition were made and the results show that they are applicable to object recognition under normal circumstance as well as under abnormal circumstance of being.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.72-75
• /
• 2008

Image segmentation techniques becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Seeded Region Growing (SRG) and Edge Information. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying SRG. Finally the region merging process, using region adjacency graph (RAG), was carried out to get the final segmentation result. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

• Korean Journal of Remote Sensing
• /
• v.21 no.1
• /
• pp.83-89
• /
• 2005

This study utilized a spatial region growing segmentation and a classification using fuzzy membership vectors to detect the changes in the images observed at different dates. Consider two co-registered images of the same scene, and one image is supposed to have the class map of the scene at the observation time. The method performs the unsupervised segmentation and the fuzzy classification for the other image, and then detects the changes in the scene by examining the changes in the fuzzy membership vectors of the segmented regions in the classification procedure. The algorithm was evaluated with simulated images and then applied to a real scene of the Korean Peninsula using the KOMPSAT-l EOC images. In the expertments, the proposed method showed a great performance for detecting changes in land-cover.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.343-344
• /
• 2009

The aim in this paper is to show how to extract scalp of a series of brain MR images by using region growing segmentation algorithm. Most researches are all forces on the segmentation of skull, gray matter, white matter and CSF. Prior to the segmentation of these inner objects in brain, we segmented the scalp and the brain from the MR images. The scalp mask makes us to quickly exclude background pixels with intensities similar those of the skull, while the brain mask obtained from our brain surface. We make use of connected threshold method (CTM) and confidence connected method (CCM). Both of them are two implementations of region growing in Insight Toolkit (ITK). By using these two methods, the results are displayed contrast in the form of 2D and 3D scalp images.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1031-1043
• /
• 2013

Extracting hand region from images is the first part in the process to recognize hand posture and gesture interaction. Therefore, a good segmenting method is important because it determines the overall performance of hand recognition systems. Conventional hand segmentation researches were prone to changing illumination conditions or limited to the ability to detect multiple people. In this paper, we propose a robust technique based on the fusion of skin-color data and depth information for hand segmentation process. The proposed algorithm uses skin-color data to localize accurate seed location for region-growing from a complicated background. Based on the seed location, our algorithm adjusts each detected blob to fill up the hole region. A region-growing algorithm is applied to the adjusted blob boundary at the detected depth image to obtain a robust hand region against illumination effects. Also, the resulting hand region is used to train our skin-model adaptively which further reduces the effects of changing illumination. We conducted experiments to compare our results with conventional techniques which validates the robustness of the proposed algorithm and in addition we show our method works well even in a counter light condition.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.19-27
• /
• 2005

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.