A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://www.micc.unifi.it/downloads/readingroup/2012_acmmm_zhou.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="ACM Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lahlxihmo5fhzpexw7rundu24u" style="color: black;">Proceedings of the 20th ACM international conference on Multimedia - MM '12</a>
Bag-of-Words (BoW) model based on SIFT has been widely used in large scale image retrieval applications. Feature quantization plays a crucial role in BoW model, which generates visual words from the high dimensional SIFT features, so as to adapt to the inverted file structure for indexing. Traditional feature quantization approaches suffer several problems: 1) high computational cost-visual words generation (codebook construction) is time consuming especially with large amount of features; 2)<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2393347.2393377">doi:10.1145/2393347.2393377</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mm/ZhouLLT12.html">dblp:conf/mm/ZhouLLT12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ooq2xwp7rdq3hajjji4b5b4ye">fatcat:7ooq2xwp7rdq3hajjji4b5b4ye</a> </span>
more »... mited reliability-different collections of images may produce totally different codebooks and quantization error is hard to be controlled; 3) update inefficiency-once the codebook is constructed, it is not easy to be updated. In this paper, a novel feature quantization algorithm, scalar quantization, is proposed. With scalar quantization, a SIFT feature is quantized to a descriptive and discriminative bit-vector, of which the first tens of bits are taken out as code word. Our quantizer is independent of collections of images. In addition, the result of scalar quantization naturally lends itself to adapt to the classic inverted file structure for image indexing. Moreover, the quantization error can be flexibly reduced and controlled by efficiently enumerating nearest neighbors of code words. The performance of scalar quantization has been evaluated in partial-duplicate Web image search on a database of one million images. Experiments reveal that the proposed scalar quantization achieves a relatively 42% improvement in mean average precision over the baseline (hierarchical visual vocabulary tree approach), and also outperforms the state-of-the-art Hamming Embedding approach and soft assignment method.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809033000/http://www.micc.unifi.it/downloads/readingroup/2012_acmmm_zhou.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4a/bc/4abcffbe6d5ff5afa3ea71d07c9c32c61d914429.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2393347.2393377"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>