• JSTS:Journal of Semiconductor Technology and Science
• /
• 제12권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• 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
• /
• 제11권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.

• 대한전자공학회논문지SP
• /
• 제40권2호
• /
• pp.1-10
• /
• 2003

Watershed 알고리즘은 형태학 분야에서 연구되어 온 것으로 단순화된 영상에 대한 경사 영상 화소의 밝기 값을 고도로 생각함으로써 영상을 분할하는데 많이 적용하였다. 하지만, 노이즈에 의해 훼손된 영상을 분할 할 경우, 수 많은 local minima로 인해 영상이 과 분할되고, 분할된 영역을 병합하기 위한 계산 시간 증가의 문제점이 발생된다. 이러한 문제점을 해결하기 위해, 본 논문에서는 웨이블릿 변환을 사용한 watershed 기반 영상 분할의 효율성 증대를 위한 방법을 제안한다. 제안한 영상 분할 방법은 웨이블릿 변환을 이용한 영상의 계층적 표현인 피라미드 표현 단계, watershed 알고리즘을 이용한 영상 분할 단계, 웨이블릿 계수(coefficient)를 이용한 영역 병합 단계와 웨이블릿 역 변환(inverse wavelet transform)을 이용한 영역 투영 단계고 구성된다. 제안된 방법은 노이즈가 포함된 훼손된 영상을 분할 시 발생하는 과 분할문제를 감소시킬 뿐만 아니라, 분할 성능의 개선됨을 알 수 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• 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.

• 대한의용생체공학회:의공학회지
• /
• 제42권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.

• 한국정보전자통신기술학회논문지
• /
• 제4권4호
• /
• pp.225-230
• /
• 2011

본 논문에서는 깊이정보에 기반한 watershed와 영역병합 알고리즘을 이용한 얼굴영역 분할 방법을 제안하였다. 얼굴영역 검출은 영역 분할 단계, 초기 화소 영역 검출 단계, 영역 병합의 세 단계로 구성된다. 입력된 컬러 영상은 제안된 알고리즘에 의해 균일한 작은 영역들로 분할된다. 색도정보와 에지 구속 조건을 사용하여 균일한 영역들을 결합함으로써 얼굴영역을 검출한다. 제안한 알고리즘은 색도정보나 에지정보만을 사용하는 기존 방법에서의 문제점을 해결하였다. 제안한 알고리즘의 성능을 평가하기 위해 컴퓨터 시뮬레이션을 하였으며 정확한 얼굴 영역을 분할할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• 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.

• 한국정보통신학회논문지
• /
• 제21권2호
• /
• pp.409-415
• /
• 2017

본 논문은 watershed를 이용한 차도 분할 알고리즘을 제안하고 있다. 제안된 알고리즘은 차량과 차선 정보를 이용해 차도 마커와 배경 마커를 자동 생성하는 automatic marked watershed를 이용한 영역 분할 알고리즘이고 이는 지나치게 많은 영역이나 마커를 위한 수작업 같은 watershed 기반 영역 분할의 문제점들을 해결할 수 있다. 차도 마커는 차선은 포함되나 차량은 배제되는 순수한 차도 영역을 위한 속성을 포함하고 배경 마커는 차량과 배경을 포함하는 나머지 영역을 위한 속성을 포함하고 있다. 실제 도로 영상에 적용된 영역 분할 결과들은 제안된 알고리즘은 다양한 환경에서 적절한 마커들을 생성할 수 있고, 주행 차로와 양옆 차로를 포함한 필수 차도 영역을 적절하게 분할할 수 있는 것을 보여주고, 성능 면에 있어서는 제안된 알고리즘은 수작업으로 생성된 마커를 사용한 기존 알고리즘과 대등함을 보여준다.

• International Journal of Contents
• /
• 제10권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.