This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Best-Match Retrieval for Structured Images
July 2001 (vol. 23 no. 7)
pp. 707-718

Abstract—This paper propose a new methodology for fast best-match retrieval of structured images. A triangle inequality property for the tree-distance introduced by Oflazer [17] is proven. This property is, in turn, applied to obtain a saturation algorithm of the trie used to store the database of the collection of pictures. The new approach can be considered as a substantial optimization of Oflazer's technique and can be applied to the retrieval of homogeneous hierarchically structured objects of any kind. The new technique inscribes itself in the number of distance-based search strategies and it is of interest for the indexing and maintenance of large collections of historical and pictorial data. We demonstrate the proposed approach on an example and report data about the speed-up that it introduces in query processing. Direct comparison with MVP-trees algorithm is also presented.

[1] A.V. Aho, M. Ganapathi, and S.W.K. Tjiang, “Code Generation Using Tree Matching and Dynamic Programming,” ACM Trans. Programming Languages and Systems, vol. 11, no. 4, pp. 491-516, Oct. 1989.
[2] R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu, “Proximity Matching Using Fixed-Queries Trees,” Combinatorial Pattern Matching, pp. 198-212, 1994.
[3] T. Bozkaya and M. Özsoyoglu, “Indexing Large Metric Spaces for Similarity Search Queries,” ACM Trans. Database Systems, vol. 24, no. 3, pp. 361-404, Sept. 1999.
[4] S. Brin, “Near Neighbour Search in Large Metric Spaces,” Proc. 21st Int'l Conf. Very Large Data Bases, pp. 574-584, Sept. 1995.
[5] W.A. Burkhard and R.M. Keller, “Some Approaches to Best-Match File Searching,” Comm. ACM, vol. 16, no. 4, pp. 230-236, Apr. 1973.
[6] R. Byrd, “LQL User Notes: An Informal Guide to the Lexical Query Language,” technical report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 1990.
[7] Y.C. Cheng and S.Y. Lu, “Waveform Correlation by Tree Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 5, pp. 299-305, May 1985.
[8] T. Chiueh, “Content Based Image Indexing,” Proc. 20th Int'l Conf. Very Large Data Bases, pp. 582-593, Sept. 1994.
[9] M. Chodorow and J.L. Klavans, “Locating Syntactic Patterns in Text Corpora,” manuscript, Lexical Systems Project, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 1990.
[10] P. Ciaccia, M. Patella, and P. Zezula, “M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. Int'l Conf. Very Large Data Bases, 1997.
[11] R.W. Ehrich and J.P. Foith, “Representation of Random Waveforms by Relational Trees,” IEEE Trans. Computers, vol. 25, pp. 725-736, 1976.
[12] A. Ferro, G. Gallo, and R. Giugno, “Error-Tolerant Retrieval for Structured Images,” Proc. VISUAL '99, pp. 51-59, June 1999.
[13] C.M. Hoffmann and M.J. O'Donnell, “Pattern Matching in Trees,” J. ACM, vol. 29, pp. 68-95, 1982.
[14] B. Moayer and K.S. Fu, “A Tree System Approach for Fingerprint Pattern Recognition,” IEEE Trans. Pattern Analaysis and Machine Intelligence, vol. 8, no. 5, pp. 176-387, May 1986.
[15] M. Neff and B.K. Boguraev, “Dictionaries, Dictionary Grammars, and Dictionary Entry Parsing,” Proc. 27th Ann. Meeting Assoc. Computational Linguistics, June 1989.
[16] S. Nirenburg, S. Beale, and C. Domashnev, “A Full-Text Experiment in Example-Based Translation,” Proc. Int'l Conf. New Methods in Language Processing, pp. 78-87, 1994.
[17] K. Oflazer, “Error-Tolerant Retrieval of Trees,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 12, Dec. 1997.
[18] H. Samet, “Distance Transform for Images Represented by Quadtree,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 3, pp. 298-303, May 1982.
[19] S. Sato and N. Nagao, “Towards Memory-Based Translation,” Proc. 13th Int'l Conf. Computational Linguistics, vol. 3 pp. 247-252, 1990.
[20] D. Shasha, T.-L. Wang, “New Techniques for Best-Match Retrieval,” ACM Trans. Information Systems, vol. 8, no. 2, pp. 140-158, Apr. 1990.
[21] M. Shapiro, “The Choice of Reference Points in Best-Match File Searching,” Comm. ACM, vol. 20, pp. 339-343, May 1997.
[22] B.A. Shapiro and K. Zhang, “Comparing Multiple RNA Secondary Structures Using Tree Comparisons,” Computer Applied Bioscience, vol. 6, no. 4, pp. 309-318, 1990.
[23] K-C Tai, "The Tree-to-Tree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422-433, 1979.
[24] J.K. Uhlmann, “Satisfying General Proximity/Similarity Queries with Metric,” Information Processing Letters, vol. 40, pp. 175-179, 1991.
[25] P. Yianilos, “Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces,” Proc. Third Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 311-321, 1993.
[26] J.T.L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A System for Approximate Tree Matching,” IEEE Trans. Knowledge and Data Eng., vol. 6, no. 4, pp. 559-571, Aug. 1994.

Index Terms:
Structured data storage and retrieval, distance-based query processing, triangle inequality.
Citation:
Alfredo Ferro, Giovanni Gallo, Rosalba Giugno, Alfredo Pulvirenti, "Best-Match Retrieval for Structured Images," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 7, pp. 707-718, July 2001, doi:10.1109/34.935845
Usage of this product signifies your acceptance of the Terms of Use.