Using Ifs and moments to build a quasi invariant image index

  • Jean Michel Marie-Julie
  • Hassane Essafi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1406)


Automatic indexing or registration is an essential task for image databases. It allows to archive, organise and retrieve a large amount of images by using inner properties. In this paper, we propose an indexing technique which allows to solve indexing problems due to geometric or photometric transformations, inferred by the different image acquisitions. This approach is based on an invariant partition of the image thanks to the use of interest points (or keypoints) and a characterisation with Ifs parameters or barycentric moments. The research process is based on a similarity measure taking in account a numerical distance and a localisation criterion. This work is based on a local characterisation of the image, we use the interest points to build a triangular partition or a set of triangles. We associate to each polygon a vector containing its photometric properties. In other approaches the keypoints are directly characterised by local invariants. The use of the Ifs parameters to index the image has been studied in early publications, the improvement (robustness against rotations and scaling) comes from the use of the invariant partition and the barycentric coordinates. The research process is particularly important, it uses traditional spatial relations and integrate them with a numerical distance to calculate a score associated to each image.


Spatial Relation Image Database Interest Point Delaunay Triangulation Distance Score 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P. Aigrain, H. Zhang, D. Petkovic. “Content-based Representation and Retrieval of Visual Media: A State-of-the-Art Review”, Multimedia Tools and Applications special issue on Representation and Retrieval of Visual Media Google Scholar
  2. [2]
    L. Gottesfeld Brown. ≪ A survey of Image Registration Techniques ≫, ACM Computing Surveys, Vol. 24, No. 4, December 1992Google Scholar
  3. [3]
    W. Niblack, R. Barber, W. Equitz, M.D. Flickner, E. H. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, G. Taubin. “QBIC Project: querying images by content, using color, texture, and shape”, Storage and Retrieval for Image and Video DatabasesGoogle Scholar
  4. [4]
    B. Scassellati, S. Alexopoulos, M.D. Flickner. “Retrieving images by 2D shape: a comparison of computation methods with human perceptual judgments”, Storage and Retrieval for Image and Video DatabasesGoogle Scholar
  5. [5]
    Y. Fisher. “Fractal Compression: Theory and Application to Digital Images”, Springer Verlag, New York 1994.Google Scholar
  6. [6]
    A. Jacquin. “Image Coding Based on a Fractal Theory of Iterated Contractive Image Transformation”, IEEE Transaction on Image Processing, 1992, Vol 1Google Scholar
  7. [7]
    D. M. Monro, F. Dudbridge. ≪ Fractal approximation functions for image and signal coding ≫, 3rd IMA Conference on Mathematics in Signal Processing, University of Warwick, 1992Google Scholar
  8. [8]
    F. Davoine, J.-M. Chassery. ≪ Adaptative Delaunay Triangulation for Attractor Image Coding ≫ 12th International Conference on Pattern Recognition, Oct. 1994.Google Scholar
  9. [9]
    A. Pentland, R.W. Picard, S. Sclaroff. “Photobook: Content-Based Manipulation of Image Databases”, International Journal of Computer Vision, Fall 1995.Google Scholar
  10. [10]
    J. M. Marie-Julie, H. Essafi ≪ Image Database Indexing and Retrieval using the Fractal Transform ≫, ECMAST'97, Milan.Google Scholar
  11. [11]
    J.M. Marie-Julie — H. Essafi. “Fast parallel multimedia data base access based on wavelet multiresolution pyramidal decomposition”, MVA'96, IAPR Workshop on Machine Vision Applications.Google Scholar
  12. [12]
    C. Schmid, R. Mohr. ≪ Combining greyvalue invariants with local constraints for object recognition ≫, Pattern Analysis and Machine Intelligence, 1997.Google Scholar
  13. [13]
    C. Harris, M. Stephens. ≪ A combined corner and edge detector ≫, Plessey Research Roke Manor, United KingdomGoogle Scholar
  14. [14]
    C.A. RothWell, A. Zisserman, D.A. Forsyth, J.L. Lundy. ≪ Canonical frames for planar object recognition ≫ 2nd European Conference on Computer Vision, 1992Google Scholar
  15. [15]
    B. Funt, G. Finlayson ≪ Color constant indexing ≫. IEEE Transactions on Pattern and Machine Intelligence, 13 (9), 1991Google Scholar
  16. [16]
    M.A. Turk, A.P. Pentland. ≪ Face recognition using eigenfaces ≫. Conference on Computer Vision and Pattern Recognition, 1991Google Scholar
  17. [17]
    H. Murase, S.K. Nayar, ≪ Visual learning and recognition of 3D objects from appearance ≫, International Journal of Computer Vision, 14, 1995Google Scholar
  18. [18]
    R. Mehrotra, J.E. Gary. “Similar-Shape Retrieval In Shape Data Management”, Computer September 1995Google Scholar
  19. [19]
    H. Moravec. ≪ Visual mapping by a robot rover ≫, 6th International Joint Conference on Artificial Intelligence, 1979Google Scholar
  20. [20]
    A. Nene, S. K. Nayar. ≪ A simple algorithm for nearest neighbour search in high dimension ≫, Dept. of Computer Science Columbia University, New York, Technical report No. CUCS-030-95Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jean Michel Marie-Julie
    • 1
  • Hassane Essafi
    • 1
  1. 1.LETI(CEA-Technologies Avancées) DEIN/SLA - CEA SaclayGif sur Yvette CedexFrance

Personalised recommendations