Image segmentation along discontinuous boundaries
From MaRDI portal
The process of dividing an image into linked homogeneous regions is examined for the case where the boundaries of these regions may not be identified fully, without gaps. To solve this problem, the image is presented as a graph, the parameter of depth is introduced, and a definition is given for relative closure. Formal analysis of the graph structure results in a segmentation algorithm that uses parallel-serial procedures of the wave type.
Recommendations
- scientific article; zbMATH DE number 554681
- scientific article; zbMATH DE number 3972018
- scientific article; zbMATH DE number 3890565
- Segmentation of image with intensity inhomogeneity
- scientific article; zbMATH DE number 1746665
- A discrete level set approach to image segmentation
- Vector image segmentation by piecewise continuous approximation
Cited in
(8)- Image segmentation by contours and regions cooperation.
- Soft image segmentation by weighted linked pyramid
- scientific article; zbMATH DE number 3972018 (Why is no real title available?)
- scientific article; zbMATH DE number 4039359 (Why is no real title available?)
- scientific article; zbMATH DE number 1222897 (Why is no real title available?)
- scientific article; zbMATH DE number 1269474 (Why is no real title available?)
- scientific article; zbMATH DE number 554681 (Why is no real title available?)
- Vector image segmentation by piecewise continuous approximation
This page was built for publication: Image segmentation along discontinuous boundaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083869)