A Tree System Approach for Fingerprint Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
Error-Tolerant Retrieval of Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
The choice of reference points in best-match file searching
Communications of the ACM
Some approaches to best-match file searching
Communications of the ACM
A System for Approximate Tree Matching
IEEE Transactions on Knowledge and Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Proximity Matching Using Fixed-Queries Trees
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Dictionaries, dictionary grammars and dictionary entry parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Toward memory-based translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Developing an object-oriented framework for content-based image retrieval
Software—Practice & Experience
Clustered trie structures for approximate search in hierarchical objects collections
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Hi-index | 0.14 |
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.