Contour grouping with partial shape similarity

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a novel algorithm is introduced to group contours from clutter images by integrating high-level information (prior of part segments) and low-level information (paths of segmentations of clutter images). The partial shape similarity between these two levels of information is embedded into the particle filter framework, an effective recursively estimating model. The particles in the framework are modeled as the paths on the edges of segmentation results (Normalized Cuts in this paper). At prediction step, the paths extend along the edges of Normalized Cuts; while, at the update step, the weights of particles update according to their partial shape similarity with priors of the trained contour segments. Successful results are achieved against the noise of the testing image, the inaccuracy of the segmentation result as well as the inexactness of the similarity between the contour segment and edges segmentation. The experimental results also demonstrate robust contour grouping performance in the presence of occlusion and large texture variation within the segmented objects. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, C., Bai, X., Li, Q., Yang, X., & Liu, W. (2009). Contour grouping with partial shape similarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5414 LNCS, pp. 167–178). https://doi.org/10.1007/978-3-540-92957-4_15

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