Indexing for Retrieval by Similarity

In multimedia databases, it is often the case that objects to be retrieved only approximately meet the conditions specified in the query. Notions of similarity are diverse and application dependent. Nevertheless, the need for indexing is still present. The standard technique for this purpose is to map the query and each object to a point is some multi-dimesional “feature space” such that two similar objects are guaranteed not to be too far apart in this space. Then multidimensional point index structures can be used, with the query region appropriately expanded around the specified query point.

[1]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[2]  Eugene Miya,et al.  On "Software engineering" , 1985, SOEN.

[3]  Olivier D. Faugeras,et al.  HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Frank Manola,et al.  PROBE Spatial Data Modeling and Query Processing in an Image Database Application , 1988, IEEE Trans. Software Eng..

[5]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

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

[7]  H. V. Jagadish,et al.  A retrieval technique for similar shapes , 1991, SIGMOD '91.

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

[9]  S. Sitharama Iyengar,et al.  A New Method of Image Compression using Irreducible Covers of Maximum Rectangles , 1988, IEEE Trans. Software Eng..

[10]  P. Wintz,et al.  An efficient three-dimensional aircraft recognition algorithm using normalized fourier descriptors , 1980 .

[11]  Alberto O. Mendelzon,et al.  Similarity-based queries , 1995, PODS '95.

[12]  Hans-Peter Kriegel,et al.  The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.

[13]  Alfred M. Bruckstein,et al.  On sequential shape descriptions , 1992, Pattern Recognit..

[14]  H. V. Jagadish.  Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[15]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[16]  D. B. Lomet,et al.  A robust multi-attribute search structure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[17]  Deborah S. Franzblau.  Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles , 1989, SIAM J. Discret. Math..