Sciweavers

63 search results - page 1 / 13
» Faster Two Dimensional Pattern Matching with Rotations
Sort
View
CPM
2004
Springer
142views Combinatorics» more  CPM 2004»
13 years 10 months ago
Faster Two Dimensional Pattern Matching with Rotations
Amihood Amir, Oren Kapah, Dekel Tsur
IFIPTCS
2000
13 years 8 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
ICIP
2001
IEEE
14 years 6 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
IEICET
2010
124views more  IEICET 2010»
12 years 11 months ago
Fast Polar and Spherical Fourier Descriptors for Feature Extraction
Polar Fourier Descriptor(PFD) and Spherical Fourier Descriptor(SFD) are rotation invariant feature descriptors for two dimensional(2D) and three dimensional(3D) image retrieval an...
Zhuo Yang, Sei-ichiro Kamata
LATIN
1998
Springer
13 years 9 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro