(Enter summary)
Abstract: Given two--dimensional images T [1::n; 1::n] and P [1::m; 1::m] where m ! n, we develop a
fast rotation invariant filtration algorithm for finding the locations of approximate occurrences
of P in T . In such an occurrence, each pixel of T should match the corresponding
intervals of pixels defined by P . Our filter works by extracting linear sequences of intervals,
called features, from P , and by searching these from T to find candidate positions
and orientations for a whole occurrence of... (Update)
Cited by: More
An Index for Two Dimensional String Matching Allowing.. - Fredriksson, Navarro.. (2000)
(Correct)
Rotation and Lighting Invariant Template Matching - Fredriksson, Mäkinen, Navarro (2004)
(Correct)
Rotation Invariant Histogram Filters for Similarity and.. - Fredriksson
(Correct)
Similar documents (at the sentence level):
6.9%: A Rotation Invariant Filter for Two-dimensional String Matching - Fredriksson, Ukkonen (1998)
(Correct)
Active bibliography (related documents): More All
0.1: Faster Two Dimensional Pattern Matching with Rotations - Amir, Kapah, Tsur
(Correct)
0.1: Combinatorial Methods for Approximate Pattern Matching.. - Fredriksson, Ukkonen (2000)
(Correct)
0.1: Shift, Rotation and Scale Invariant Signatures for.. - Squire, Caelli (1995)
(Correct)
Similar documents based on text: More All
0.7: Faster Template Matching without FFT - Fredriksson, Ukkonen (2001)
(Correct)
0.7: Faster Than FFT: Rotation Invariant Combinatorial.. - Fredriksson, Navarro.. (2002)
(Correct)
0.4: Optimal Exact and Fast Approximate Two Dimensional.. - Fredriksson, Navarro, .. (2002)
(Correct)
Related documents from co-citation: More All
12: Combinatorial methods for approximate pattern matching under rotations and trans..
- Fredriksson, Ukkonen - 2000
11: An index for two dimensional string matching allowing rotations
- Fredriksson, Navarro et al. - 2000
10: A rotation invariant filter for two--dimensional string matching
- Fredriksson, Ukkonen - 1998
BibTeX entry: (Update)
K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognition Letters, 20(11--13):1249--1258, 1999. http://citeseer.ist.psu.edu/fredriksson99combinatorial.html More
@article{ fredriksson99combinatorial,
author = "Fredriksson and Ukkonen",
title = "Combinatorial Methods for Approximate Image Matching under Translations and Rotations",
journal = "PRL: Pattern Recognition Letters",
volume = "20",
year = "1999",
url = "citeseer.ist.psu.edu/fredriksson99combinatorial.html" }
Citations (may not include all citations):
137
Efficient string matching: an aid to bibliographic search (context) - Aho, Corasick - 1975
31
Trie memory (context) - Fredkin - 1960
23
Invariant pattern recognition: a review (context) - Wood - 1996
21
Registration of translated and rotated images using finite f.. (context) - Castro, Morandi - 1987
14
A rotation invariant filter for two--dimensional string matc..
- Fredriksson, Ukkonen - 1998
9
the minimum number of templates required for shift (context) - Caelli, Liu - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.helsinki.fi/u/kfredrik/publications.html): More
A Rotation Invariant Filter for Two-dimensional String Matching - Fredriksson, Ukkonen (1998)
(Correct)
Rotation Invariant Histogram Filters for Similarity and.. - Fredriksson (2000)
(Correct)
Combinatorial Methods for Approximate Pattern Matching.. - Fredriksson, Ukkonen (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC