iccv iccv2013 iccv2013-365 iccv2013-365-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Alexandra Gilinsky, Lihi Zelnik Manor
Abstract: Computing distances between large sets of SIFT descriptors is a basic step in numerous algorithms in computer vision. When the number of descriptors is large, as is often the case, computing these distances can be extremely time consuming. In this paper we propose the SIFTpack: a compact way of storing SIFT descriptors, which enables significantly faster calculations between sets of SIFTs than the current solutions. SIFTpack can be used to represent SIFTs densely extracted from a single image or sparsely from multiple different images. We show that the SIFTpack representation saves both storage space and run time, for both finding nearest neighbors and for computing all distances between all descriptors. The usefulness of SIFTpack is also demonstrated as an alternative implementation for K-means dictionaries of visual words.
[1] M. Aharon and M. Elad. Sparse and redundant modeling of image content using an image-signature-dictionary. SIAM J.
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11] Imaging Sciences, 1(3):228–247, 2008. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891– 923, 1998. S. Bagon, O. Boiman, and M. Irani. What is a good image segment? a unified approach to segment extraction. In ECCV, pages 30–44, 2008. S. Baker, D. Scharstein, J. Lewis, S. Roth, M. Black, and R. Szeliski. A database and evaluation methodology for optical flow. IJCV, 92(1):1–31, 2001. C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. Patchmatch: a randomized correspondence algorithm for structural image editing. SIGGRAPH, 28(3):24: 1–24: 11, July 2009. F. C. Crow. Summed-area tables for texture mapping. SIGGRAPH, 18(3):207–212, Jan. 1984. G. Csurka, C. Dance, L. Fan, J. Willamowski, and C. Bray. Visual categorization with bags of keypoints. In ECCV, volume 1, pages 1–22, 2004. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SoCG, pages 253–262, 2004. L. Fei-Fei and P. Perona. A bayesian hierarchical model for learning natural scene categories. In CVPR, pages 524–53 1, 2005. K. He and J. Sun. Computing nearest-neighbor fields via propagation-assisted kd-trees. In CVPR, pages 111–1 18, 2012. A. Joulin, F. Bach, and J. Ponce. Discriminative clustering for image co-segmentation. In CVPR, pages 1943–1950,
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22] 2010. A. Joulin, F. Bach, and J. Ponce. Multi-class cosegmentation. In CVPR, pages 542–549, 2012. S. Korman and S. Avidan. Coherency sensitive hashing. In ICCV, pages 1607–1614, 2011. S. Lazebnik, C. Schmid, and J. Ponce. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In CVPR, pages 2169–2178, 2006. C. Liu, J. Yuen, and A. Torralba. Sift flow: Dense correspondence across scenes and its applications. TPAMI, 33(5):978– 994, 2011. D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60(2):91–1 10, 2004. S. Mallat and Z. Zhang. Matching pursuits with timefrequency dictionaries. IEEE Transactions on Signal Processing,, 41(12):3397 –3415, 1993. K. Mikolajczyk and C. Schmid. A performance evaluation of local descriptors. TPAMI, 27(10):1615–1630, 2005. E. Nowak, F. Jurie, and B. Triggs. Sampling strategies for bag-of-features image classification. In ECCV, pages 490– 503, 2006. I. Olonetsky and S. Avidan. Treecann - k-d tree coherence approximate nearest neighbor algorithm. In ECCV, pages 602–615, 2012. Y. C. Pati, R. Rezaiifar, Y. C. P. R. Rezaiifar, and P. S. Krishnaprasad. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Proceedings of the 27 th Annual Asilomar Conference on Signals, Systems, and Computers, pages 40–44, 1993. M. Rubinstein, D. Gutierrez, O. Sorkine, and A. Shamir. A comparative study of image retargeting. SIGGRAPH,
[23]
[24]
[25]
[26]
[27]
[28]
[29] 29(5): 160: 1–160: 10, 2010. E. Shechtman and M. Irani. Matching local self-similarities across images and videos. In CVPR, pages 1–8, 2007. D. Simakov, Y. Caspi, E. Shechtman, and M. Irani. Summarizing visual data using bidirectional similarity. In CVPR, pages 1–8, 2008. J. Sivic and A. Zisserman. Video google: A text retrieval approach to object matching in videos. In CVPR, pages 1470– 1477, 2003. C. Strecha. Dense matching of multiple wide-baseline views. In ICCV, pages 1194–1201, 2003. E. Tola, V. Lepetit, and P. Fua. A fast local descriptor for dense matching. In CVPR, pages 1–8, 2008. A. Vedaldi and B. Fulkerson. VLFeat: An open and portable library of computer vision algorithms, http://www.vlfeat.org/, 2008. J. Yao and W. kuen Cham. 3d modeling and rendering from multiple wide-baseline images by match propagation. Sig. Proc.: Image Comm., 21(6):506–5 18, 2006. 778844