• 한국컴퓨터산업학회논문지
• /
• 제4권12호
• /
• pp.923-928
• /
• 2003

잡음의 혼입, 추가적인 데이터의 삽입에 의해 많은 catchments basins 이 보다 더 부분 분할되어 local minima 가 증가하는 경우 훼손된 Watershed 영상은 관련된 객체 윤곽들이 소실되는 over segmentation 이 발생한다 제안된 Watershed 영상 분할 알고리즘은 반복적으로 유사 gray level 분포를 지니는 인접 영역을 병합, 영상 복원하여 기존의 알고리즘보다 우수한 효과를 나타낼 것으로 기대된다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권2호
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권6호
• /
• pp.523-531
• /
• 2005

확산(Diffusion)을 이용한 기존의 칼라영상 분할은 확산의 횟수가 반복될수록 경계선 정보가 적절히 유지되지 못하거나 잡음을 제거하지 못함으로써 워터쉐드(Watershed) 알고리즘을 적용하는 경우, 과분할을 피할 수 없다는 단점을 갖고 있다. 본 논문에서는 수리 형태학(Mathematical Morphology)과 비선형 확산(Non-Linear Diffusion)을 함께 적용하여 과분할의 문제점을 제거한 워터쉐드 결과를 얻을 수 있는 칼라영상 분할방법을 제안한다. 임의의 칼라 영상을 LUV 색상공간으로 변환하여, 그 각각의 색상공간에 수리 형태학을 응용한 재구성에 의한 닫힘(Reconstruction) 연산과 비선형 확산을 함께 적용하여 경계선을 적절히 유지하면서 잡음을 제거한 단순 영상을 획득할 수 있다. 이 영상에서 칼라 영상의 기울기(Gradient) 정보를 획득하고, 워터쉐드 알고리즘을 적용하여 영상을 분할한다. 실험 결과, 기존의 방법보다 과분할이 현저히 제거되고, 칼라 영상이 매우 효과적으로 분할됨을 확인하였다

• 응용통계연구
• /
• 제22권4호
• /
• pp.709-721
• /
• 2009

본 논문은 형태학적 워터쉐드 알고리즘을 이용하여 잡음에 강한 효율적인 영상분할에 대해서 논의하고자 한다. 기존의 형태학적 워터쉐드 알고리즘에 의한 영상분할은 크게 형태학적 연산자에 의한 영상의 단순화, 경사 영상 생성, 워터쉐드 알고리즘 수행 그리고 영역 병합 등의 여러 단계에 걸쳐 이루어진다. 그러나 기존의 형태학적 워터쉐드 알고리즘에 의한 영상분할은 과분할이 많이 일어나는 단점을 갖고 있다. 본 논문에서는 과분할을 줄이기 위해 잡음에 강한 형태학적 연산자에 의한 경사영상을 생성하고 워터쉐드 알고리즘을 적용 후 통계적인 콜모고로프-스미르노프 검정을 사용하여 인접한 영역 간의 픽셀 값 분포를 비교함으로써 부적절한 영역 병합을 최소화하였다. 본 논문에서 제안한 영상분할의 성능을 평가하기 위해 기존의 방법과 정성적이고 정량적인 비교뿐 만아니라 영상분할에 소요되는 계산시간까지 비교하였다.

• 디지털산업정보학회논문지
• /
• 제5권2호
• /
• pp.157-165
• /
• 2009

Existing methods for image segmentation using 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. This thesis proposes a method for image segmentation by applying morphology operation together with robust anisotropic diffusion. For an input image, transformed into LUV color space, closing by reconstruction and anisotropic diffusion are applied to obtain a simplified image which preserves contour information with noises removed. With gradients computed from this simplifed images, watershed algorithm is applied. Experiments show that color images are segmented very effectively without over-segmentation.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2003년도 하계학술대회 논문집
• /
• pp.90-93
• /
• 2003

본 논문에서는 watershed segmentation을 이용해서 특정한 영역의 윤곽선정보를 바탕으로 영상을 추출하는 방법을 제안한다. 일반적인 영역추출방법에는 폐곡선을 이용한 영역추출방법, snake라 불리는 에너지 최소화를 이용한 active contour 방법 등 여러 가지가 있다. 특히 이러한 방법에는 연산시간이 많이 걸린다는 단점이 있는데, 이러한 문제점을 해결하기 위해서 canny edge detector를 사용하여 윤곽선 정보를 추출하고, watershed segmentation으로 영상을 분할한 후 윤곽선 정보를 이용해서 특정 영상의 영역에 대한 부분을 병합하여 추출하는 방법을 사용하였다. 제안하는 방법으로 기존의 추출 방법중의 하나인 levelset과 비교 실험한 결과 거의 동일한 영상의 결과를 얻을 수 있었으며 연산시간을 줄일 수 있었다.

• Computers and Concrete
• /
• 제5권1호
• /
• pp.61-74
• /
• 2008

Digital image processing algorithms for the analysis and characterization of grains and voids in cemented materials were developed using toolbox functions of a mathematical software package. Utilization of grayscale, color and watershed segmentation algorithms and their performances were demonstrated on artificially prepared self-compacting concrete (SCC) samples. It has been found that color segmentation was more advantageous over the gray scale segmentation for the detection of voids whereas the latter method provided satisfying results for the aggregate grains due to the sharp contrast between their colors and the cohesive matrix. The watershed segmentation method, on the other hand, appeared to be very efficient while separating touching objects in digital images.

• International journal of advanced smart convergence
• /
• 제11권4호
• /
• pp.81-87
• /
• 2022

In this paper, we propose a watershed algorithm that applies a high-frequency enhancement filter to emphasize the boundary and a local adaptive threshold to search for minimum points. The previous method causes the problem of over-segmentation, and over- segmentation appears around the boundary of the object, creating an inaccurate boundary of the region. The proposed method applies a high-frequency enhancement filter that emphasizes the high-frequency region while preserving the low-frequency region, and performs a minimum point search to consider local characteristics. When merging regions, a fixed threshold is applied. As a result of the experiment, the proposed method reduced the number of segmented regions by about 58% while preserving the boundaries of the regions compared to when high frequency emphasis filters were not used.

• 한국멀티미디어학회논문지
• /
• 제17권10호
• /
• pp.1171-1181
• /
• 2014

In this paper, we propose improved methods which are image conversion and extraction method of watershed seed using morphological characteristic of teeth on complement image. Conventional tooth segmentation methods are occurred low detection ratio at molar region and over, overlap segmentation owing to specular reflection and morphological feature of molars. Therefore, in order to solve the problems of the conventional methods, we propose the image conversion method and improved extraction method of watershed seed. First, the image conversion method is performed using RGB, HSI space of tooth image for to extract boundary and seed of watershed efficiently. Second, watershed seed is reconstructed using morphological characteristic of teeth. Last, individual tooth segmentation is performed using proposed seed of watershed by watershed algorithm. Therefore, as a result of comparison with marker controlled watershed algorithm and the proposed method, we confirmed higher detection ratio and accuracy than marker controlled watershed algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.814-818
• /
• 2004

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.