Distance-based multiple paths quantization of vocabulary tree for object and scene retrieval

Heng Yang, Qing Wang, Ellen Yi Luen Do

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The state of the art in image retrieval on large scale databases is achieved by the work inspired by the text retrieval approaches. A key step of these methods is the quantization stage which maps the high-dimensional feature vectors to discriminatory visual words. This paper mainly proposes a distance-based multiple paths quantization (DMPQ) algorithm to reduce the quantization loss of the vocabulary tree based methods. In addition, a more efficient way to build a vocabulary tree is presented by using sub-vectors of features. The algorithm is evaluated on both the standard object recognition and the location recognition databases. The experimental results have demonstrated that the proposed algorithm can effectively improve image retrieval performance of the vocabulary tree based methods on both the databases.

Original languageEnglish
Title of host publicationComputer Vision, ACCV 2009 - 9th Asian Conference on Computer Vision, Revised Selected Papers
Pages313-322
Number of pages10
EditionPART 1
DOIs
StatePublished - 2010
Event9th Asian Conference on Computer Vision, ACCV 2009 - Xi'an, China
Duration: 23 Sep 200927 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume5994 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Asian Conference on Computer Vision, ACCV 2009
Country/TerritoryChina
CityXi'an
Period23/09/0927/09/09

Fingerprint

Dive into the research topics of 'Distance-based multiple paths quantization of vocabulary tree for object and scene retrieval'. Together they form a unique fingerprint.

Cite this