Skip to main content
Conference ProceedingsOPEN ACCESS

Optimal pixel matching between images

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5414 LNCS 597-610
DOI: 10.1007/978-3-540-92957-4_52
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A two-dimensional continuous dynamic programming (2DCDP) method is proposed for two-dimensional spotting recognition of images. Spotting recognition is simultaneous segmentation and recognition of an image by optimal pixel matching between a reference and an input image. The proposed method performs optimal pixel-wise image matching and two-dimensional pixel alignment, which are not available in conventional algorithms. Experimental results show that 2DCDP precisely matches the pixels of non-linearly deformed images. © 2009 Springer Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Yaguchi, Y., Iseki, K., & Oka, R. (2009). Optimal pixel matching between images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5414 LNCS, pp. 597–610). https://doi.org/10.1007/978-3-540-92957-4_52

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