106 search results - page 9 / 22 » Fast Approximate Point Set Matching for Information Retrieva... |
CIKM
2003
Springer
15 years 2 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
105
click to vote
DAGSTUHL
2006
14 years 11 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
66
Voted
MM
2010
ACM
14 years 9 months ago
2010
ACM
TOP-SURF is an image descriptor that combines interest points with visual words, resulting in a high performance yet compact descriptor that is designed with a wide range of conte...
108
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...