Optimizing Visual Vocabularies Using Soft Assignment Entropies
Författare
Summary, in English
The state of the art for large database object retrieval in images is based on quantizing descriptors of interest points into visual words. High similarity between matching image representations (as bags of words) is based upon the assumption that matched points in the two images end up in similar words in hard assignment or in similar representations in soft assignment techniques. In this paper we study how ground truth correspondences can be used to generate better visual vocabularies. Matching of image patches can be done e.g. using deformable models or from estimating 3D geometry. For optimization of the vocabulary, we propose minimizing the entropies of soft assignment of points. We base our clustering on hierarchical k-splits. The results from our entropy based clustering are compared with hierarchical k-means. The vocabularies have been tested on real data with decreased entropy and increased true positive rate, as well as better retrieval performance.
Avdelning/ar
Publiceringsår
2011
Språk
Engelska
Sidor
255-268
Publikation/Tidskrift/Serie
Lecture Notes in Computer Science
Volym
6495
Fulltext
- Available as PDF - 389 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Förlag
Springer
Ämne
- Computer Vision and Robotics (Autonomous Systems)
- Mathematics
Conference name
10th Asian Conference on Computer Vision (ACCV 2010), 2010
Conference date
2010-11-08 - 2010-11-12
Conference place
Queenstown, New Zealand
Status
Published
Forskningsgrupp
- Mathematical Imaging Group
ISBN/ISSN/Övrigt
- ISSN: 0302-9743
- ISSN: 1611-3349
- ISBN: 978-3-642-19281-4 (print)
- ISBN: 978-3-642-19282-1(online)