2D-affine invariants that distribute uniformly and can be tuned to any convex feature domain

We derive and discuss a set of parametric equations which, when given a convex 2D feature domain, K, will generate affine invariants with the property that the invariants' values are uniformly distributed in the region [0,1]/spl times/[0,1]. Definition of the shape of the convex domain K allows computation of the parameters' values and thus the proposed scheme can be tuned to a specific feature domain. The features of all recognizable objects (models) are assumed to be two-dimensional points and uniformly distributed over K. The scheme leads to improved discrimination power, improved computational-load and storage-load balancing and can also be used to determine and identify biases in the database of recognizable models (over-represented constructs of object points). Obvious enhancements produce rigid-transformation and similarity-transformation invariants with the same good distribution properties, making this approach generally applicable. An extension to the case of affine invariants for feature points in three-dimensional space, with the invariants now being uniformly distributed in the region [0,1]/spl times/[0,1]/spl times/[0,1], has also been carried out and is discussed briefly. We present results for several 2D convex domains using both synthetic data and real databases.

[1]  Isidore Rigoutsos,et al.  A Bayesian Approach to Model Matching with Geometric Hashing , 1995, Computer Vision and Image Understanding.

[2]  B. Salzberg Practical spatial database access methods , 1991, [Proceedings] 1991 Symposium on Applied Computing.

[3]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[4]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[5]  F. Dehne,et al.  Hypercube algorithms for parallel processing of pointer-based quadtrees , 1995 .

[6]  Christos Faloutsos,et al.  Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.

[7]  Daphna Weinshall,et al.  3D object recognition by indexing structural invariants from multiple views , 1993, 1993 (4th) International Conference on Computer Vision.

[8]  F. Stein,et al.  Efficient two dimensional object recognition , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[9]  Anil K. Jain,et al.  3D object recognition using invariant feature indexing of interpretation tables , 1992, CVGIP Image Underst..

[10]  Alex Delis,et al.  The Impact of Hashing Function Choice on the Load Balancing in Very Large Dartasets , 1996, SEKE.

[11]  Alan H. Lipkus,et al.  Similarity searching on CAS Registry substances. 2. 2D structural similarity , 1994, J. Chem. Inf. Comput. Sci..

[12]  Rakesh Mohan,et al.  Multidimensional indexing for recognizing visual shapes , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  Edith Schonberg,et al.  Two-Dimensional, Model-Based, Boundary Matching Using Footprints , 1986 .

[14]  Robert M. Haralick,et al.  Optimal affine-invariant matching: performance characterization , 1992, Electronic Imaging.

[15]  I. Rigoutsos,et al.  Searching in parallel for similar strings [biological sequences] , 1994, IEEE Computational Science and Engineering.