Image Segmentation via Edge Contour Finding: A Graph Theoretic Approach
Abstract
A graph-theoretic approach for image segmentation is presented. The pixels of the image are represented by the vertices of an undirected adjacency graph G. All neighboring pairs of pixels are linked by arcs with capacities assigned to reflect the strength of an edge element between the linked vertices. Segmentation is achieved by removing arcs corresponding to selected minimum cuts of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. This is equivalent to partitioning the image using closed contours of edge elements, which consist mostly of strong edges. The method accurately locates region boundaries and at the same time rejects contours containing isolated strong edges. The minimum cuts in G can be computed from a partially cut-equivalent tree of G. A fast algorithm for constructing partially equivalent trees that can handle graphs with several hundred thousand vertices is developed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Wu and Leahy. "Image Segmentation via Edge Contour Finding: A Graph Theoretic Approach." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223127Markdown
[Wu and Leahy. "Image Segmentation via Edge Contour Finding: A Graph Theoretic Approach." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/wu1992cvpr-image/) doi:10.1109/CVPR.1992.223127BibTeX
@inproceedings{wu1992cvpr-image,
title = {{Image Segmentation via Edge Contour Finding: A Graph Theoretic Approach}},
author = {Wu, Zhenyu and Leahy, Richard M.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {613-619},
doi = {10.1109/CVPR.1992.223127},
url = {https://mlanthology.org/cvpr/1992/wu1992cvpr-image/}
}