A hybrid data and space partitioning technique for similarity queries on bounded clusters

Authors:
Piyush K. Bhunre;C. A. Murthy;Arijit Bishnu;Bhargab B. Bhattacharya;Malay K. Kundu
Affiliations:
National University of Singapore, Singapore;Indian Statistical Institute, Kolkata, India;Indian Institute of Technology, Kharagpur, Kharagpur, India;Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India
Venue:
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Year:
2005

Citing 7
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
The revised Fundamental Theorem of Moment Invariants

IEEE Transactions on Pattern Analysis and Machine Intelligence
Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multidimensional access methods

ACM Computing Surveys (CSUR)
Introduction to algorithms

Introduction to algorithms
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Euler vector for search and retrieval of gray-tone images

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new method for generating size-bounded clusters is proposed such that the cardinality of each cluster is less than or equal to a pre-specified value. First, set estimation techniques coupled with Rectangular Intersection Graphs are used to generate adaptive clusters. Then, the size-bounded clusters are obtained by using space partitioning techniques. The clusters can be indexed by a Kd-tree like structure for similarity queries. The proposed method is likely to find applications to Content Based Image Retrieval (CBIR).