• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.183-186
• /
• 2000

영상 분할(image segmentation)은 주어진 영역에서 의미 있는 영역만을 분리해 내는 과정으로 컴퓨터 비젼 분야에 있어 매우 중요한 단계로 취급되어 진다. 본 연구에서는 기존의 영상 분할 알고리즘들의 문제점을 해결하고자 단계적인 marker 영상을 적용한 watershed 알고리즘을 제안하였다. 제안한 방법은 단계적인 level의 조절에 따라 분할의 정도를 선택할 수 있으며 watershed 알고리즘의 특성인 정확한 물체 검출의 장점들 살릴 수 있다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.210-216
• /
• 2010

In this study, we propose a novel method to segment an individual tooth region in a true color image. The difference of the intensity in RGB is initially extracted and subsequent morphological reconstruction is applied to minimize the spurious segmentation regions. Multiple seeds in the tooth regions are chosen by searching regional minima and a Sobel-mask edge operations is performed to apply MCWA(Marker-Controlled Watershed Algorithm). As the results of applying MCWA transform for our proposed tooth segmentation algorithm, the individual tooth region can be resolved in a CCD tooth color image.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.482-485
• /
• 2000

A modified watershed transform is proposed which is context-free marker-controlled and minima imposition-free to reduce the over-segmentation and to speedup the transform. In contrast to the conventional methods in which a priori knowledge, such as flat zones, zones of homogeneous texture, and morphological distance, is required for marker extraction, context-free marker extraction is proposed by using the attention operator based on the GST (generalized symmetry transform). By using the context-free marker, the proposed watershed transform exploit marker-constrained labeling to speedup the computation and to reduce the over-segmentation by eliminating the unnecessary geodesic reconstruction such as the minima imposition and thereby eliminating the necessity of the post-processing of region merging. The simulation results show that the proposed method can extract context-free markers inside the objects from the complex background that includes multiple objects and efficiently reduces over-segmentation and computation time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.891-894
• /
• 2004

This paper proposes an improved image segmentation algorithm by the watershed algorithm based on the local adaptive threshold on local minima search and the fixing threshold on label allocation. The previous watershed algorithm generates the problem of over-segmentation. The over-segmentation makes the boundary in the inaccuracy region by occurring around the object. In order to solve those problems we quantize the input color image by the vector quantization, remove noise and find the gradient image. We sorted local minima applying the local adaptive threshold on local minima search of the input color image. The simulation results show that the proposed algorithm controls over-segmentation and makes the fine boundary around segmented region applying the fixing threshold based on sorted local minima on label allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4092-4107
• /
• 2015

We propose a background subtraction method for moving cameras based on trajectory classification, image segmentation and label inference. In the trajectory classification process, PCA-based outlier detection strategy is used to remove the outliers in the foreground trajectories. Combining optical flow trajectory with watershed algorithm, we propose a trajectory-controlled watershed segmentation algorithm which effectively improves the edge-preserving performance and prevents the over-smooth problem. Finally, label inference based on Markov Random field is conducted for labeling the unlabeled pixels. Experimental results on the motionseg database demonstrate the promising performance of the proposed approach compared with other competing methods.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.431-434
• /
• 2003

In this paper, we propose an efficient method not only f3r producing accurate region segmentation, solving the over-segmentation problem of watershed algorithm but also f3r reducing post-processing time by reducing computation loads. Through this proposed method, region segmentation of neighboring objects and discrimination of similar intensities were effectively obtained. Input image of watershed algorithm has used the derivative-based detectors such as Sobel and Canny. But proposed method uses the pixels-similarity-based detector, that is, SUSAN. By adopting this proposed method, we can reduce the noise problem and solve the problem of over-segmentation and not lose the edge information of objects. We also propose Zero-Crossing SUSAN. With Zero-Crossing SUSAN, the edge localization, times and computation loads can be improved over those obtained from existing SUSAN

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.169-176
• /
• 2018

In this study, we propose a new Fire Flame Region Extraction using Block Homogeneity Segmentation method of the Fire Image with irregular texture and various colors. It is generally assumed that fire flame extraction plays a very important role. The Color Image with fire flame is divided into blocks and edge strength for each block is computed by using modified color histogram intersection method that has been developed to differentiate object boundaries from irregular texture boundaries effectively. The block homogeneity is designed to have the higher value in the center of region with the homeogenous colors or texture while to have lower value near region boundaries. The image represented by the block homogeneity is gray scale image and watershed transformation technique is used to generate closed boundary for each region. As the watershed transform generally results in over-segmentation, region merging based on common boundary strength is followed. The proposed method can be applied quickly and effectively to the initial response of fire.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.21-29
• /
• 2007

Anisotropic diffusion is one of the widely used techniques in the field of image segmentation. In the conventional anisotropic diffusion [1]-[6], usually 4-neighborhood directions are used: north, south, west and east, except the image diagonal directions, which results in the loss of image details and causes false contours. Existing methods for image segmentation using conventional anisotroplc diffusion can't preserve contour information, or noises with high gradients become more salient as the umber of times of the diffusion increases, resulting in over-segmentation when applied to watershed. In this paper, to overcome the shortcoming of the conventional anisotropic diffusion method, a new arusotropic diffusion method based on diagonal edges is proposed. And a method of watershed segmentation is applied to the proposed method. Experimental results show that the process time of the proposed method including diagonal edges over conventional methods can be up to 2 times faster and the Circle image quality improvement can be better up to $0.45{\sim}2.33(dB)$. Experiments also show that images are segmented very effectively without over segmentation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.449-452
• /
• 2003

This paper propose a extracting method of the region for image using segmentation and edge information. First propose algorithm extract information using canny edge detector and the image was divided by watershed segmentation. And it extract the mage with edge information by merging region. Finally we compare the proposed method with levelset method. In the result proposed method not only extract the image with accurate region but also reduce operation time.