nips nips2012 nips2012-202 nips2012-202-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Andrew Ziegler, Eric Christiansen, David Kriegman, Serge J. Belongie
Abstract: Keypoint matching between pairs of images using popular descriptors like SIFT or a faster variant called SURF is at the heart of many computer vision algorithms including recognition, mosaicing, and structure from motion. However, SIFT and SURF do not perform well for real-time or mobile applications. As an alternative very fast binary descriptors like BRIEF and related methods use pairwise comparisons of pixel intensities in an image patch. We present an analysis of BRIEF and related approaches revealing that they are hashing schemes on the ordinal correlation metric Kendall’s tau. Here, we introduce Locally Uniform Comparison Image Descriptor (LUCID), a simple description method based on linear time permutation distances between the ordering of RGB values of two image patches. LUCID is computable in linear time with respect to the number of pixels and does not require floating point computation. 1
[1] Herbert Bay, Andreas Ess, Tinne Tuytelaars, and Luc Van Gool. Speeded-up robust features (SURF). Comput. Vis. Image Underst., 110(3):346–359, June 2008.
[2] D.N. Bhat and S.K. Nayar. Ordinal measures for image correspondence. Pattern Analysis and Machine Intelligence, 20(4):415–423, Apr 1998.
[3] A. Bosch, A. Zisserman, and X. Muoz. Image classification using random forests and ferns. In Computer Vision, 2007. ICCV 2007, pages 1–8, Oct. 2007.
[4] Michael Calonder, Vincent Lepetit, Christoph Strecha, and Pascal Fua. Brief: binary robust independent elementary features. In Proceedings of the 11th European conference on Computer vision: Part IV, ECCV’10, pages 778–792, Berlin, Heidelberg, 2010. Springer-Verlag.
[5] A. Cayley. Lxxvii. note on the theory of permutations. Philosophical Magazine Series 3, 34(232):527– 529, 1849.
[6] Moses S. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, STOC ’02, pages 380–388, New York, NY, USA, 2002.
[7] Michael Deza, Liens ecole Normale Suprieure, and Tayuan Huang. Metrics on permutations, a survey. Journal of Combinatorics, Information and System Sciences, 1998.
[8] Persi Diaconis and R. L. Graham. Spearman’s footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B (Methodological), 39(2):pp. 262–268, 1977.
[9] M. A. Fligner and J. S. Verducci. Distance based ranking models. Journal of the Royal Statistical Society. Series B (Methodological), 48(3):pp. 359–369, 1986.
[10] R. W. Hamming. Error detecting and error correcting codes. Bell System Technical Journal, 29(2):147– 160, 1950.
[11] M. G. Kendall. A new measure of rank correlation. Biometrika, 30(1/2):pp. 81–93, 1938.
[12] S Leutenegger, M Chli, and R Siegwart. BRISK: Binary robust invariant scalable keypoints. In Proc. of the IEEE International Conference on Computer Vision (ICCV), 2011.
[13] Bing Li, Rong Xiao, Zhiwei Li, Rui Cai, Bao-Liang Lu, and Lei Zhang. Rank-SIFT: Learning to rank repeatable local interest points. In Computer Vision and Pattern Recognition (CVPR), pages 1737–1744, June 2011.
[14] Jie Liu and Xiaohui Liang. I-BRIEF: A fast feature point descriptor with more robust features. In SignalImage Technology and Internet-Based Systems (SITIS), pages 322–328, Dec. 2011.
[15] D.G. Lowe. Object recognition from local scale-invariant features. In Computer Vision, volume 2, pages 1150–1157, 1999.
[16] John I. Marden. Analyzing and Modeling Rank Data. Chapman & Hall, 1995.
[17] Krystian Mikolajczyk and Cordelia Schmid. A performance evaluation of local descriptors. IEEE Trans. Pattern Anal. Mach. Intell., 27(10):1615–1630, October 2005.
[18] A. Mittal and V. Ramesh. An intensity-augmented ordinal measure for visual correspondence. In Computer Vision and Pattern Recognition, volume 1, pages 849–856, June 2006.
[19] Ethan Rublee, Vincent Rabaud, Kurt Konolige, and Gary Bradski. ORB: An efficient alternative to SIFT or SURF. International Conference on Computer Vision, 95(1):2564–2571, 2011.
[20] S Scherer, P Werth, and A Pinz. The discriminatory power of ordinal measures – towards a new coefficient. 1, 1999.
[21] Timothy B. Terriberry, Lindley M. French, and John Helmsen. GPU accelerating speeded-up robust features. In Proceedings of the 4th International Symposium on 3D Data Processing, Visualization and Transmission, 3DPVT ’08, pages 355–362, Atlanta, GA, USA, 2008.
[22] M. Toews and W. Wells. Sift-rank: Ordinal description for invariant feature correspondence. In Computer Vision and Pattern Recognition, pages 172–177, June 2009.
[23] Jay Yagnik, Dennis Strelow, David A. Ross, and Ruei-Sung Lin. The power of comparative reasoning. In ICCV, pages 2431–2438, 2011. 9