Rotation and lighting invariant template matching

Authors:
Kimmo Fredriksson;Veli Mäkinen;Gonzalo Navarro
Affiliations:
Department of Computer Science and Statistics, University of Joensuu, Finland;Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Chile, Chile
Venue:
Information and Computation
Year:
2007

Citing 17
Cited 1

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Introduction to algorithms

Introduction to algorithms
A survey of image registration techniques

ACM Computing Surveys (CSUR)
Sorting in linear time?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Combinatorial methods for approximate image matching under translations and rotations

Pattern Recognition Letters - Special issue on pattern recognition in practice VI
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Image Processing Handbook, Fourth Edition

Image Processing Handbook, Fourth Edition
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A Rotation Invariant Filter for Two-Dimensional String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D arrays

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Average-optimal single and multiple approximate string matching

Journal of Experimental Algorithmics (JEA)
Transposition invariant string matching

Journal of Algorithms
Sequential and indexed two-dimensional combinatorial template matching allowing rotations

Theoretical Computer Science
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Two-dimensional pattern matching with rotations

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is brighter or darker than its occurrence. Furthermore, we consider approximate matching under several tolerance models. We obtain algorithms that are almost optimal both in the worst and the average cases simultaneously. The complexities we obtain are very close to the best current results for the case where only rotations, but not lighting invariance, are supported. These are the first results for this problem under a combinatorial approach.