Convex layers: A new tool for recognition of projectively deformed point sets

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

Abstract

A new more efficient algorithm for recognition of projectively deformed point sets is presented. It supposes the type of projective transformation, where the orientation of a triangle is preserved. First, convex layers of two compared sets are computed and left-tangents are found. If their structures are different, then an advanced algorithm is used. It creates the new structure of one set according to the other set. If the numbers of the points in the convex layers differ from each other, then the suitable points are moved to other layers, and if the left-tangents do not link the corresponding points, then their structure is corrected. The suitable combination of optimal structure correction criteria was investigated by a numerical experiment, the angle criteria were found as the best. Finally, five-point cross ratios of sequences of the points from both sets are computed and compared.

Cite

CITATION STYLE

APA

Suk, T., & Flusser, J. (1999). Convex layers: A new tool for recognition of projectively deformed point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 454–461). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_55

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