Combinatorial methods for approximate image matching under translations and rotations

Pattern Recognition Letters

Volumn 20, Issue 11-13, 1999, Pages 1249-1258

  Fredriksson, Kimmo ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; IMAGE PROCESSING; OPTIMIZATION;

APPROXIMATE IMAGE MATCHING; COMBINATORIAL STRING MATCHING;

FEATURE EXTRACTION;

EID: 0033220729     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00092-6     Document Type: Article

References (8)

1. Aho, A.V., Corasick, M.J., 1975. Efficient string matching: an aid to bibliographic search. Communications of the ACM 18 (6), 333-340.
2. Caelli, T.M., Liu, Z.Q., 1988. On the minimum number of templates required for shift, rotation and size invariant pattern recognition. Pattern Recognition 21, 205-216.
3. Castro, E.D., Morandi, C., 1987. Registration of translated and rotated images using finite fourier transforms. IEEE Trans. Pattern Anal. Machine Intell. PAMI. 9 (5), 700-703.
4. Fredkin, E., 1960. Trie memory. Communications of the ACM 3 (9), 490-499.
5. Fredriksson, K., Ukkonen, E., 1998. A rotation invariant filter for two-dimensional string matching. In: Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, Springer, Berlin, pp. 118-125.
6. Landau, G.M., Vishkin, U., 1994. Pattern matching in a digitized image. Algorithmica 2 (4/5), 375-408.
7. Takaoka, T., 1996. Approximate pattern matching with grey scale values. In: Houle, M.E., Eades, P. (Eds.), Proceedings of Conference on Computing: The Australian Theory Symposium. Townsville, Australian Computer Science Communications, pp. 196-203.
8. Wood, J., 1996. Invariant pattern recognition: a review. Pattern Recognition 29 (1), 1-17.