Feature Matching Performance of Compact Descriptors for Visual Search.

Data Compression Conference(2014)

引用 27|浏览28
暂无评分
摘要
MPEG is currently developing a standard titled Compact Descriptors for Visual Search (CDVS) for descriptor extraction and compression. In this work, we report comprehensive patch-level experiments for a direct comparison of low bitrate descriptors for visual search. For evaluating different compression schemes, we propose a dataset of matching pairs of image patches from the MPEG-CDVS image-level data sets. We propose a greedy rate allocation scheme for distributing bits across different spatialbins of the SIFT descriptor. We study a scheme based on Entropy Constrained Vector Quantization and greedy rate allocation, which performs close to the performancebound for any compression scheme. Finally, we present extensive feature-level Receiver Operating Characteristic (ROC) comparisons for different compression schemes (VectorQuantization, Transform Coding, Lattice Coding) proposed during the MPEG-CDVS standardization process.
更多
查看译文
关键词
entropy,feature extraction,greedy algorithms,image coding,image matching,image retrieval,sensitivity analysis,vector quantisation,visual perception,MPEG-CDVS image level data sets,SIFT descriptor,bits distribution,compact descriptors for visual search,comprehensive patch level experiment,descriptor compression,descriptor extraction,entropy constrained vector quantization,feature level ROC,feature matching performance,greedy rate allocation scheme,image patch matching pairs,receiver operating characteristic,spatial bins,feature compression
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要