Shape recognition by voting on fast marching iterations

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this study, we present a Fast Marching (FM) - Shape Description integrated methodology that is capable both extracting object boundaries and recognizing shapes. A new speed formula is proposed, and the local front stopping algorithm in [1] is enhanced to freeze the active contour near real object boundaries. GBSD [2] is utilized as shape descriptor on evolving contour. Shape description process starts when a certain portion of the contour is stopped and continues with FM iterations. Shape description at each iteration is treated as a different source of shape information and they are fused to get better recognition results. This approach removes the limitation of traditional recognition systems that have only one chance for shape classification. Test results shown in this study prove that the voted decision result among these iterated contours outperforms the ordinary individual shape recognizers. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Capar, A., & Gokmen, M. (2009). Shape recognition by voting on fast marching iterations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5807 LNCS, pp. 379–388). https://doi.org/10.1007/978-3-642-04697-1_35

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