FIRE: fractal indexing with robust extensions for image databases

As already documented in the literature, fractal image encoding is a family of techniques that achieves a good compromise between compression and perceived quality by exploiting the self-similarities present in an image. Furthermore, because of its compactness and stability, the fractal approach can be used to produce a unique signature, thus obtaining a practical image indexing system. Since fractal-based indexing systems are able to deal with the images in compressed form, they are suitable for use with large databases. We propose a system called FIRE, which is then proven to be invariant under three classes of pixel intensity transformations and under geometrical isometries such as rotations by multiples of /spl pi//2 and reflections. This property makes the system robust with respect to a large class of image transformations that can happen in practical applications: the images can be retrieved even in the presence of illumination and/or color alterations. Additionally, the experimental results show the effectiveness of FIRE in terms of both compression and retrieval accuracy.

[1]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[2]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[3]  Shi-Kuo Chang,et al.  Iconic Indexing by 2-D Strings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Y. Fisher Fractal image compression: theory and application , 1995 .

[5]  Alberto Del Bimbo,et al.  A Three-Dimensional Iconic Environment for Image Database Querying , 1993, IEEE Trans. Software Eng..

[6]  Michele Nappi,et al.  FIRST: Fractal Indexing and Retrieval SysTem for Image Databases , 1998, Image Vis. Comput..

[7]  M. Nappi,et al.  Split decision functions in fractal image coding , 1998 .

[8]  Stan Sclaroff,et al.  Distance to Deformable Prototypes: Encoding Shape Categories for Efficient Search , 1998, Image Databases and Multi-Media Search.

[9]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[10]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[11]  Arnaud E. Jacquin,et al.  Image coding based on a fractal theory of iterated contractive image transformations , 1992, IEEE Trans. Image Process..

[12]  Arnold W. M. Smeulders,et al.  PicToSeek: A Color Image Invariant Retrieval System , 1998, Image Databases and Multi-Media Search.

[13]  SUH-YIN LEE,et al.  Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation , 1992, Pattern Recognit..

[14]  Christos Faloutsos,et al.  Efficient and effective Querying by Image Content , 1994, Journal of Intelligent Information Systems.

[15]  Michele Nappi,et al.  Speed-up in fractal image coding: comparison of methods , 2000, IEEE Trans. Image Process..

[16]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[17]  Euripides G. M. Petrakis,et al.  Similarity Searching in Medical Image Databases , 1997, IEEE Trans. Knowl. Data Eng..

[18]  Luigi Cinque,et al.  Indexing pictorial documents by their content: a survey of current techniques , 1997, Image Vis. Comput..

[19]  Th. Gevers,et al.  Color Image Invariant Segmentation and Retrieval , 1996 .

[20]  Alberto Del Bimbo,et al.  Visual Image Retrieval by Elastic Matching of User Sketches , 1997, IEEE Trans. Pattern Anal. Mach. Intell..