loading
Documents

Research.Publish.Connect.

Paper

Authors: Faraj Alhwarin ; Alexander Ferrein and Ingrid Scholl

Affiliation: FH Aachen University of Applied Sciences, Germany

ISBN: 978-989-758-276-9

Keyword(s): Feature Matching, Hash Tree, Fast NN Search.

Related Ontology Subjects/Areas/Topics: Applications ; Clustering ; Computer Vision, Visualization and Computer Graphics ; Data Engineering ; Image Understanding ; Information Retrieval ; Ontologies and the Semantic Web ; Pattern Recognition ; Software Engineering ; Theory and Methods

Abstract: Nearest Neighbour (NN) search is an essential and important problem in many areas, including multimedia databases, data mining and computer vision. For low-dimensional spaces a variety of tree-based NN search algorithms efficiently cope with finding the NN, for high-dimensional spaces, however, these methods are inefficient. Even for Locality Sensitive Hashing (LSH) methods which solve the task approximately by grouping sample points that are nearby in the search space into buckets, it is difficult to find the right parameters. In this paper, we propose a novel hashing method that ensures a high probability of NNs being located in the same hash buckets and a balanced distribution of data across all the buckets. The proposed method is based on computing a selected number of pairwise uncorrelated and uniformly-distributed Circular Random Variables (CRVs) from the sample points. The method has been tested on a large dataset of SIFT features and was compared to LSH and the Fast Library fo r Approximated NN search (FLANN) matcher with linear search as the base line. The experimental results show that our method significantly reduces the search query time while preserving the search quality, in particular for dynamic databases and small databases whose size does not exceed 200k points. (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 54.242.193.41

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:
Alhwarin, F.; Ferrein, A. and Scholl, I. (2018). CRVM: Circular Random Variable-based Matcher - A Novel Hashing Method for Fast NN Search in High-dimensional Spaces.In Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-276-9, pages 214-221. DOI: 10.5220/0006692802140221

@conference{icpram18,
author={Faraj Alhwarin. and Alexander Ferrein. and Ingrid Scholl.},
title={CRVM: Circular Random Variable-based Matcher - A Novel Hashing Method for Fast NN Search in High-dimensional Spaces},
booktitle={Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2018},
pages={214-221},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006692802140221},
isbn={978-989-758-276-9},
}

TY - CONF

JO - Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - CRVM: Circular Random Variable-based Matcher - A Novel Hashing Method for Fast NN Search in High-dimensional Spaces
SN - 978-989-758-276-9
AU - Alhwarin, F.
AU - Ferrein, A.
AU - Scholl, I.
PY - 2018
SP - 214
EP - 221
DO - 10.5220/0006692802140221

Login or register to post comments.

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