Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-19282-1_21 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
soft assignment,hierarchical k-means,better retrieval performance,hard assignment,large database object retrieval,image patch,similar representation,soft assignment technique,image representation,hierarchical k-splits,visual vocabulary,soft assignment entropy,ground truth,k means,bag of words | Computer vision,3d geometry,Pattern recognition,Computer science,Visual vocabularies,Ground truth,Artificial intelligence,Cluster analysis,Quantization (signal processing),True positive rate,Vocabulary,Visual Word | Conference |
Volume | ISSN | Citations |
6495 | 0302-9743 | 5 |
PageRank | References | Authors |
0.40 | 16 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yubin Kuang | 1 | 189 | 14.78 |
| Kalle Åström | 2 | 914 | 95.40 |
| Lars Kopp | 3 | 5 | 0.40 |
| Magnus Oskarsson | 4 | 196 | 22.85 |
| Martin Byröd | 5 | 184 | 11.22 |