Image Segmentation Method Combining Edge Detection and Watershed Algorithm
A watershed algorithm and image segmentation technology, applied in the field of fuzzy recognition, can solve the problems of inaccurate edges, unclosed edges, over-segmentation, and inconsistencies between edges and target boundaries, etc., and achieve fast results
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0015] Embodiment 1, the specific implementation steps of using templates of the same size are as follows: the first step, image edge extraction: use the Canny algorithm to extract the edge in the image; the second step, edge connection: for each Canny edge, use the same size template After expansion, the edges whose gap is less than 2 times the expansion diameter will be connected; the third step is to segment the image: use the area surrounded by Canny edges as the seed area of the watershed algorithm, and then use the watershed algorithm to grow in the expanded area. The edges generated by the watershed algorithm segment the image into meaningful regions. For two regions with bottlenecks to connect, even if the two regions are split into two regions in the second step, they will still be connected into one region in the third step.
Embodiment 2
[0016] Embodiment 2, the specific implementation steps of using templates of different sizes are as follows: Step 1, use the contour detector to extract edges: Use the Canny algorithm to extract the edges in the image, and find all the endpoints and corners after single pixelation. The endpoint is a point with only one direction edge pixel in the 8-neighborhood, and the corner point is the point with three or more direction edge pixels in the 8-neighborhood. The corner point divides the edge into edge line segments (as shown in Figure 1, the corner represented by X points, triangles represent endpoints). The second step is to fill the gap: For each endpoint in the graph, fill the gap. For each endpoint of a Canny edge, find the nearest endpoint (let the distance to the nearest endpoint be Dpp). In order to prevent the nearest end point from being too far away, and there are close edges that can be connected, as in the case of end point 2 in Figure 2-a, then the edge line segm...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


