FIRST: Fractal Indexing and Retrieval SysTem for Image Databases

We present an image indexing method and a system to perform content-based retrieval in heterogeneous image databases (IDB). The method is based upon the fractal framework of the iterated function systems (IFS) widely used for image compression. The image index is represented through a vector of numeric features, corresponding to contractive functions (CF) of the IFS framework. The construction of the index vector requires a preliminary processing of the images to select an appropriate set of indexing features (i.e. contractive functions). The latter will be successively used to fill in the vector components, computed as frequencies by which the selected contractive functions appear inside the images. In order to manipulate the index vectors efficiently we use discrete Fourier transform (DFT) to reduce their cardinalities and use a spatial access method (SAM), like R*-tree, to improve search performances. The sound theoretical framework underlying the method enabled us to formally prove some properties of the index. However, for a complete validation of the indexing method, also in terms of effectiveness and efficacy, we performed several experiments on a large collection of images from different domains, which revealed good system performances with a low percentage of false alarms and false dismissals. q 1998 Elsevier Science B.V. All rights reserved.

[1]  H. V. Jagadzsh Linear Clustering of Objects with Multiple Attributes , 1998 .

[2]  Sergio Orefice,et al.  A methodology and interactive environment for iconic language design , 1994, Int. J. Hum. Comput. Stud..

[3]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[4]  Jeffrey D. Uuman Principles of database and knowledge- base systems , 1989 .

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

[6]  Alan V. Oppenheim,et al.  Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  K. Wakimoto,et al.  Efficient and Effective Querying by Image Content , 1994 .

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

[9]  Peter Schäuble,et al.  Metadata for integrating speech documents in a text retrieval system , 1994, SGMD.

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

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

[12]  William I. Grosky,et al.  A pictorial index mechanism for model-based matching , 1992, Data Knowl. Eng..

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

[14]  Michele Nappi,et al.  Color image coding combining linear prediction and iterated function systems , 1997, Signal Process..

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

[16]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.

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

[18]  Riccardo Distasi,et al.  Speeding Up Fractal Encoding of Images Using a Block Indexing Technique , 1997, ICIAP.

[19]  Shi-Kuo Chang,et al.  Principles of pictorial information systems design , 1988 .

[20]  Dietmar Saupe The futility of square isometries in fractal image compression , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

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

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

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