Structure Driven Image Database Retrieval

A new algorithm is presented which approximates the perceived visual similarity between images. The images are initially transformed into a feature space which captures visual structure, texture and color using a tree of filters. Similarity is the inverse of the distance in this perceptual feature space. Using this algorithm we have constructed an image database system which can perform example based retrieval on large image databases. Using carefully constructed target sets, which limit variation to only a single visual characteristic, retrieval rates are quantitatively compared to those of standard methods.

[1]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[2]  R. Desimone,et al.  Stimulus-selective properties of inferior temporal neurons in the macaque , 1984, The Journal of neuroscience : the official journal of the Society for Neuroscience.

[3]  Christoph von der Malsburg,et al.  Pattern recognition by labeled graph matching , 1988, Neural Networks.

[4]  Rosalind W. Picard,et al.  Finding similar patterns in large image databases , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Christos Faloutsos,et al.  QBIC project: querying images by content, using color, texture, and shape , 1993, Electronic Imaging.

[6]  Don R. Hush,et al.  Query by image example: The CANDID approach , 1995 .

[7]  Rajesh P. N. Rao,et al.  Object indexing using an iconic sparse distributed memory , 1995, Proceedings of IEEE International Conference on Computer Vision.

[8]  Simone Santini,et al.  Gabor space and the development of preattentive similarity , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[9]  Paul A. Viola Complex Feature Recognition: A Bayesian Approach for Learning to Recognize Objects , 1996 .