Retrieving similar pictures from iconic databases using G-tree

Abstract G-tree, combining the features of both grids and B-trees, is a disk-based spatial data structure for organizing multidimensional data. This paper presents an efficient access method for retrieving similar pictures from iconic databases using G-tree. The proposed method preserves the merits of G-tree, and hence indexing the pictures in the database, processing range queries for similarity retrieval, inserting/deleting a picture into/from the database, and effective memory utilization can be achieved in practical applications. In order to improve the acceptability of similarity retrieval as compared to previous works, we define a similarity function by the usage of query ranges, and each range corresponds to one object in the query. This similarity function reflects both the direction and the distance knowledge among objects in the pictures. Besides, the result of similarity retrieval can be further refined by simply adjusting the query ranges or increasing the threshold value of the predefined similarity function.

[1]  Chin-Chen Chang,et al.  Retrieving the Most Similar Symbolic Pictures from Pictorial Databases , 1992, Inf. Process. Manag..

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

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

[4]  Shi-Kuo Chang,et al.  An Intelligent Image Database System , 1988, IEEE Trans. Software Eng..

[5]  Chin-Chen Chang,et al.  A fast algorithm to retrieve symbolic pictures , 1992, Int. J. Comput. Math..

[6]  Chaman L. Sabharwal,et al.  A fast implementation of a perfect hash function for picture objects , 1994, Pattern Recognit..

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

[8]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[9]  Akhil Kumar.  G-Tree: A New Data Structure for Organizing Multidimensional Data , 1994, IEEE Trans. Knowl. Data Eng..

[10]  James B. Rothnie,et al.  Attribute based file organization in a paged memory environment , 1974, CACM.

[11]  Kenneth N. Lodding,et al.  Iconic Interfacing , 1983, IEEE Computer Graphics and Applications.

[12]  Suh-Yin Lee,et al.  Similarity retrieval of iconic image database , 1989, Pattern Recognit..

[13]  Chin-Chen Chang,et al.  Application of geometric hashing to iconic database retrieval , 1994, Pattern Recognit. Lett..

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

[15]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[16]  P. W. Huang,et al.  Using 2D C+-strings as spatial knowledge representation for image database systems , 1994, Pattern Recognit..

[17]  Jack A. Orenstein.  Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[18]  Suh-Yin Lee,et al.  2D C-string: A new spatial knowledge representation for image database systems , 1990, Pattern Recognit..

[19]  Paul G. Sorenson,et al.  Algorithms for BD trees , 1986, Softw. Pract. Exp..

[20]  Tzong-Chen Wu,et al.  An exact match retrieval scheme based upon principal component analysis , 1995, Pattern Recognit. Lett..

[21]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[22]  Suh-Yin Lee,et al.  Retrieval of similar pictures on pictorial databases , 1991, Pattern Recognit..

[23]  Hideyuki Tamura,et al.  Image database systems: A survey , 1984, Pattern Recognit..