An adaptive contour closure algorithm and its experimental evaluation

33Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The potential of edge-based complete image segmentation into regions has not gained the due attention in the literature thus far. The present paper attempts to explore this potential by proposing an adaptive grouping algorithm to solve the contour closure problem that is the key to a successful edge-based complete image segmentation. The effectiveness of the proposed algorithm will be extensively tested in the range image domain and compared to several region-based segmentation methods within a rigorous comparison framework. On three range image databases of varying quality acquired by different range scanners, it will be shown that the proposed approach is able to achieve very appealing performance with respect to both segmentation quality and computation time. © 2000 IEEE.

Cite

CITATION STYLE

APA

Jiang, X. (2000). An adaptive contour closure algorithm and its experimental evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(11), 1252–1265. https://doi.org/10.1109/34.888710

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free