New algorithmic approaches to point constellation recognition

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

This article is free to access.

Abstract

Point constellation recognition is a common problem with many pattern matching applications. Whilst useful in many contexts, this work is mainly motivated by fingerprint matching. Fingerprints are traditionally modelled as constellations of oriented points called minutiae. The fingerprint verifier’s task consists in comparing two point constellations. The compared constellations may differ by rotation and translation or by much more involved transforms such as distortion or occlusion. This paper presents three new constellation matching algorithms. The first two methods generalize an algorithm by Bringer and Despiegel. Our third proposal creates a very interesting analogy between mechanical system simulation and the constellation recognition problem.

Cite

CITATION STYLE

APA

Bourgeat, T., Bringer, J., Chabanne, H., Champenois, R., Clément, J., Ferradi, H., … Voizard, A. (2014). New algorithmic approaches to point constellation recognition. In IFIP Advances in Information and Communication Technology (Vol. 428, pp. 80–90). Springer Science and Business Media, LLC. https://doi.org/10.1007/978-3-642-55415-5_7

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