Skip to main content
Conference Proceedings

Efficient random sampling for nonrigid feature matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5875 LNCS(PART 1) 457-467
DOI: 10.1007/978-3-642-10331-5_43
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper aims to match two sets of nonrigid feature points using random sampling methods. By exploiting the principle eigenvector of corres pondence-model-linkage, an adaptive sampling method is devised to efficiently deal with non-rigid matching problems. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Fan, L., & Pylvänäinen, T. (2009). Efficient random sampling for nonrigid feature matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5875 LNCS, pp. 457–467). https://doi.org/10.1007/978-3-642-10331-5_43

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