Feature-Based Adaptive Tolerance Tree (FATT): An Efficient Indexing Technique for Content-Based Image Retrieval Using Wavelet Transform

This paper introduces a novel indexing and access method, called Feature- Based Adaptive Tolerance Tree (FATT), using wavelet transform is proposed to organize large image data sets efficiently and to support popular image access mechanisms like Content Based Image Retrieval (CBIR).Conventional database systems are designed for managing textual and numerical data and retrieving such data is often based on simple comparisons of text or numerical values. However, this method is no longer adequate for images, since the digital presentation of images does not convey the reality of images. Retrieval of images become difficult when the database is very large. This paper addresses such problems and presents a novel indexing technique, Feature Based Adaptive Tolerance Tree (FATT), which is designed to bring an effective solution especially for indexing large databases. The proposed indexing scheme is then used along with a query by image content, in order to achieve the ultimate goal from the user point of view that is retrieval of all relevant images. FATT indexing technique, features of the image is extracted using 2-dimensional discrete wavelet transform (2DDWT) and index code is generated from the determinant value of the features. Multiresolution analysis technique using 2D-DWT can decompose the image into components at different scales, so that the coarest scale components carry the global approximation information while the finer scale components contain the detailed information. Experimental results show that the FATT outperforms M-tree upto 200%, Slim-tree up to 120% and HCT upto 89%. FATT indexing technique is adopted to increase the efficiently of data storage and retrieval.

[1]  Shih-Fu Chang,et al.  Image Retrieval: Current Techniques, Promising Directions, and Open Issues , 1999, J. Vis. Commun. Image Represent..

[2]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[3]  Masatoshi Yoshikawa,et al.  The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.

[4]  Ronald Fagin,et al.  Fuzzy queries in multimedia database systems , 1998, PODS '98.

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

[6]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[7]  B. S. Manjunath,et al.  A comparison of wavelet transform features for texture image annotation , 1995, Proceedings., International Conference on Image Processing.

[8]  Christos Faloutsos,et al.  Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.

[9]  Prabir Kumar Biswas,et al.  Texture image retrieval using new rotated complex wavelet filters , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  C.-C. Jay Kuo,et al.  Texture analysis and classification with tree-structured wavelet transform , 1993, IEEE Trans. Image Process..

[11]  Ge Yu,et al.  M+-tree : A New Dynamical Multidimensional Index for Metric Spaces , 2003, ADC.

[12]  Joaquim A. Jorge,et al.  Indexing high-dimensional data for content-based retrieval in large databases , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[13]  Shih-Fu Chang,et al.  VisualSEEk: a fully automated content-based image query system , 1997, MULTIMEDIA '96.

[14]  Moncef Gabbouj,et al.  MUVIS: a content-based multimedia indexing and retrieval framework , 2003, Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings..

[15]  Haixun Wang,et al.  The S2-Tree : An Index Structure for Subsequence Matching of Spatial Objects , 2001, PAKDD.

[16]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

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

[18]  HongJiang Zhang,et al.  A Scheme for Visual Feature based Image Indexing , 2002 .

[19]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[20]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  Moncef Gabbouj,et al.  Hierarchical Cellular Tree: An Efficient Indexing Scheme for Content-Based Retrieval on Multimedia Databases , 2007, IEEE Transactions on Multimedia.

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

[23]  Hans-Peter Kriegel,et al.  The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.

[24]  Pasi Koikkalainen,et al.  Self-organizing hierarchical feature maps , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[25]  Christian Böhm,et al.  Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[26]  Christos Faloutsos,et al.  Fast Indexing and Visualization of Metric Data Sets using Slim-Trees , 2002, IEEE Trans. Knowl. Data Eng..

[27]  Z. Meral Özsoyoglu,et al.  Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[28]  Marcel Worring,et al.  Content-Based Image Retrieval at the End of the Early Years , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[30]  Amihai Motro,et al.  VAGUE: a user interface to relational databases that permits vague queries , 1988, TOIS.

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

[32]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[33]  Shu-Ching Chen,et al.  Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).