Rotation invariant histogram filters for similarity and distance measures between digital images

Fast rotation invariant filtering algorithms are presented for speeding-up the search for the position of a given pattern template from a large image. The algorithms work for several distance/similarity measures. The algorithms give useful correlation information as such, and can be used as filtering algorithms for more sophisticated methods. The results are presented in the 2D case, but extensions to 3D are straightforward. The algorithms are based on color histograms computed from the pattern. A technique is described for pruning the filtered positions incrementally, using a simple, yet effective boundary that divides the search space in two.

[1]  Chris A. Glasbey,et al.  Fast computation of moving average and related filters in octagonal windows , 1997, Pattern Recognit. Lett..

[2]  A. Aggarwal,et al.  Efficient minimum cost matching using quadrangle inequality , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[3]  Juha Kärkkäinen,et al.  Two and higher dimensional pattern matching in optimal expected time , 1994, SODA '94.

[4]  Amihood Amir Multidimensional Pattern Matching: A Survey , 1992 .

[5]  Esko Ukkonen,et al.  Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[6]  Azriel Rosenfeld,et al.  A distance metric for multidimensional histograms , 1985, Comput. Vis. Graph. Image Process..

[7]  Esko Ukkonen,et al.  A Rotation Invariant Filter for Two-Dimensional String Matching , 1998, CPM.

[8]  JEFFREY WOOD,et al.  Invariant pattern recognition: A review , 1996, Pattern Recognit..

[9]  Lisa M. Brown,et al.  A survey of image registration techniques , 1992, CSUR.

[10]  Gonzalo Navarro,et al.  An Index for Two Dimensional String Matching Allowing Rotations , 2000, IFIP TCS.

[11]  Gad M. Landau,et al.  Pattern matching in a digitized image , 1992, SODA '92.

[12]  Fabrizio Luccio,et al.  Simple and Efficient String Matching with k Mismatches , 1989, Inf. Process. Lett..

[13]  Esko Ukkonen,et al.  Algorithms For 2 – D Hamming Distance Under Rotations ( extended abstract ) 1 , 1999 .

[14]  Jorma Tarhio A sublinear algorithm for two-dimensional string matching , 1996, Pattern Recognit. Lett..

[15]  Zvi Galil,et al.  Truly alphabet-independent two-dimensional pattern matching , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[16]  Esko Ukkonen,et al.  Combinatorial methods for approximate image matching under translations and rotations , 1999, Pattern Recognit. Lett..

[17]  Gary Benson,et al.  Alphabet independent two dimensional matching , 1992, STOC '92.

[18]  Gonzalo Navarro,et al.  Fast Two-Dimensional Approximate Pattern Matching , 1999, LATIN.