loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Marius Muja and David G. Lowe

Affiliation: University of British Columbia, Canada

ISBN: 978-989-8111-69-2

Keyword(s): Nearest-neighbors search, Randomized kd-trees, Hierarchical k-means tree, Clustering.

Abstract: For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems that are faster than linear search. Approximate algorithms are known to provide large speedups with only minor loss in accuracy, but many such algorithms have been published with only minimal guidance on selecting an algorithm and its parameters for any given problem. In this paper, we describe a system that answers the question, “What is the fastest approximate nearest-neighbor algorithm for my data?” Our system will take any given dataset and desired degree of precision and use these to automatically determine the best algorithm and parameter values. We also describe a new algorithm that applies priority search on hierarchical k-means trees, which we have found to provide the best known performance on many datasets. After testing a range of alternatives, we have found tha t multiple randomized k-d trees provide the best performance for other datasets. We are releasing public domain code that implements these approaches. This library provides about one order of magnitude improvement in query time over the best previously available software and provides fully automated parameter selection. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.207.82.217

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Muja M.; G. Lowe D. and (2009). FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION.In Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2009) ISBN 978-989-8111-69-2, pages 331-340. DOI: 10.5220/0001787803310340

@conference{visapp09,
author={Marius Muja and David {G. Lowe}},
title={FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION},
booktitle={Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2009)},
year={2009},
pages={331-340},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001787803310340},
isbn={978-989-8111-69-2},
}

TY - CONF

JO - Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2009)
TI - FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
SN - 978-989-8111-69-2
AU - Muja, M.
AU - G. Lowe, D.
PY - 2009
SP - 331
EP - 340
DO - 10.5220/0001787803310340

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.