In this paper we compare images based on the constellation of their interest points. The fundamental technique for this comparison is our matching algorithm, that is capable to model miss- and multi-matches, while enforcing one-to-one matches. We associate an energy function for the possible matchings. In order to find the matching with the lowest energy, we reformulate this energy function as Markov Random Field and determine the matching with the lowest energy by an efficient minimization strategy. In the experiments, we compare our algorithm against the normalized cross correlation and a naive forth-and-back best neighbor match algorithm. © 2011 Springer-Verlag.
CITATION STYLE
Drayer, B. (2011). Image comparison on the base of a combinatorial matching algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6835 LNCS, pp. 426–431). https://doi.org/10.1007/978-3-642-23123-0_43
Mendeley helps you to discover research relevant for your work.