• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.2
• /
• pp.175-185
• /
• 2012

Predictive watershed transform is a popular object segmentation algorithm which achieves a speed-up by identifying image regions that are different from the previous frame and performing object segmentation only for those regions. However, incorrect segmentation is often generated by the predictive watershed transform which uses only local information in merge-split decision on boundary regions. This paper improves the predictive watershed transform to increase the accuracy of segmentation results by using the additional information about the root of boundary regions. Furthermore, the proposed algorithm is processed in a block-based manner such that an image frame is decomposed into blocks and each block is processed independently of the other blocks. The block-based approach makes it easy to implement the algorithm in hardware and also permits an extension for parallel execution. Experimental results show that the proposed watershed transform produces more accurate segmentation results than the predictive watershed transform.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.107-109
• /
• 2004

High-resolution remotely sensed data such as SPOT-5 imagery are employed to study the effectiveness of the watershed segmentation algorithm. Existing problems in this approach are identified and appropriate solutions are proposed. As a case study, the panchromatic SPOT-5 image of part of Beijing urban areas has been segmented by using the MATLAB software. In segmentation, the structuring element has been firstly created, then the gaps between objects have been exaggerated and the objects of interest are converted. After that, the intensity valleys have been detected and the watershed segmentation have been conducted. Through this process, the objects in an image are divided into separate objects. Finally, the effectiveness of the watershed segmentation approach for high-resolution imagery has been summarized. The approach to solve the problems such as over-segmentation has been proposed.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.39-46
• /
• 2019

This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.2
• /
• pp.1-10
• /
• 2003

This paper presents an efficient method for image segmentation based on a multiresolution application of a wavelet transform and watershed segmentation algorithm. The procedure toward complete segmentation consists of four steps: pyramid representation, image segmentation, region merging and region projection. First, pyramid representation creates multiresolution images using a wavelet transform. Second, image segmentation segments the lowest-resolution image of the pyramid using a watershed segmentation algorithm. Third, region merging merges the segmented regions using the third-order moment values of the wavelet coefficients. Finally, the segmented low-resolution image with label is projected into a full-resolution image (original image) by inverse wavelet transform. Experimental results of the presented method can be applied to the segmentation of noise or degraded images as well as reduce over-segmentation.

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

• Journal of Biomedical Engineering Research
• /
• v.42 no.4
• /
• pp.159-166
• /
• 2021

In order to analyze cell images, accurate segmentation of each cell is indispensable. However, the reality is that accurate cell image segmentation is not easy due to various noises, dense cells, and inconsistent shape of cells. Therefore, in this paper, we propose an algorithm that combines marker-based watershed segmentation and ellipse fitting method for glioblastoma cell segmentation. In the proposed algorithm, in order to solve the over-segmentation problem of the existing watershed method, the marker-based watershed technique is primarily performed through "seeding using local minima". In addition, as a second process, the concave point search using ellipse fitting for final segmentation based on the connection line between the concave points has been performed. To evaluate the performance of the proposed algorithm, we compared three algorithms with other algorithms along with the calculation of segmentation accuracy, and we applied the algorithm to other cell image data to check the generalization and propose a solution.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.225-230
• /
• 2011

In this paper, we propose the segmentation method for detecting the facial region by using watershed based on depth information and merge algorithm. The method consists of three steps: watershed segmentation, seed region detection, and merge. The input color image is segmented into the small uniform regions by watershed. The facial region can be detected by merging the uniform regions with chromaticity and edge constraints. The problem in the existing method using only chromaticity or edge can solved by the proposed method. The computer simulation is performed to evaluate the performance of the proposed method. The simulation results shows that the proposed method is superior to segmentation facial region.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.299-300
• /
• 2006

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.409-415
• /
• 2017

This paper proposes a road segmentation algorithm using a watershed. The proposed algorithm is a segmentation algorithm using an automatic marked watershed that automatically creates a road marker and a background marker using information about vehicles and lanes on road and it can solve problems of a watershed-based segmentation such as overmany regions or handworks for markers. The road marker has property for pure road areas in which lanes are included but vehicles are excluded and the background marker has property for the areas left in which vehicles and background are included. Results of segmentation applied to real road images show that the proposed algorithm can automatically creates appropriate markers and it can properly segments the required road area that include the lane with a vehicle and its both side lanes in various environments, and it is equal to the conventional algorithm using markers created by handwork in performance.

• International Journal of Contents
• /
• v.10 no.3
• /
• pp.35-40
• /
• 2014

Text line segmentation is a critical task in handwritten document recognition. In this paper, we propose a novel text-line-segmentation method using baseline estimation and watershed. The baseline-detection algorithm estimates the baseline using Adaptive Head-Tail Connection (AHTC) on the document. Then, the watershed method segments the line region using the baseline-detection result. Finally, the text lines are separated by watershed result and a post-processing algorithm defines the lines more correctly. The scheme successfully segments text lines with 97% accuracy from the handwritten document images in the ICDAR database.