Fast subspace search via grassmannian based hashing

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2013, Pages 2776-2783

  Wang, Xu ^a   Atev, Stefan ^b   Wright, John ^c   Lerman, Gilad ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Proto Labs Inc   (Portugal)

^c EE Department Columbia University ^*  (United States)

Author keywords

Grassmannian Based Hashing; Locality Sensitive Hashing; Subspace Search

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; FACE RECOGNITION; IMAGE RETRIEVAL;

ARBITRARY DIMENSION; AUTOMATIC FACE RECOGNITION; GRASSMANNIAN; LOCALITY SENSITIVE HASH; LOCALITY SENSITIVE HASHING; NEAREST SUBSPACE SEARCHES; NUMERICAL EXPERIMENTS; SUBSPACE SEARCH;

QUERY PROCESSING;

EID: 84898822518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2013.345     Document Type: Conference Paper

References (23)

1. A. Andoni and P. Indyk. Near optimal hashing algorithms for approximate nearest neighbor in high dimensions. Comm. of the ACM, 51(1), 2008.
2. A. Andoni, P. Indyk, R. Krauthgamer, and H. L. Nguyen. Approximate line nearest neighbor in high dimensions. SODA, 2009.
3. R. Basri, T. Hassner, and L. Zelnik-Manor. Approximate nearest subspace search. TPAMI, 33(2), 2011.
4. R. Basri and D. Jacobs. Lambertian reflectance and linear subspaces. TPAMI, 25(2):218-233, February 2003.
5. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
6. K. Clarkson. A randomized algorithm for closest-point queries. SICOMP, 17:830-847, 1988.
7. R. Epstein, P. Hallinan, and A. Yuille. 5±2 eigenimages suffice: An empirical investigation of low-dimensional lighting models. In IEEE PBMCV, June 1995.
8. A.S. Georghiades, P.N. Belhumeur, and D.J. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. TPAMI, 23(6):643-660, 2001.
9. G. H. Golub and C. F. Van Loan. Matrix computations, 3rd edition. Baltimore: Johns Hopkins University Press, 1996.
10. R. Gross, I. Matthews, J.F. Cohn, T. Kanade, and S. Baker. Multi-pie. Proceedings of the Eighth IEEE International Conference on Automatic Face and Gesture Recognition, 2008.
11. S. Har-Peled, P. Indyk, and R. Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory of computing, 8:321-350, 2012.
12. J. Ho, M. Yang, J. Lim, K. Lee, and D. Kriegman. Clustering appearances of objects under varying illumination conditions. In CVPR, 2003.
13. P. Jain, S. Vijayanarasimhan, and K. Grauman. Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning. In NIPS, 2010.
14. K.C. Lee, J. Ho, and D. Kriegman. Acquiring linear subspaces for face recognition under variable lighting. TPAMI, 27(5):684-698, 2005.
15. W. Liu, J. Wang, Y. Mu, S. Kumar, and S. Chang. Compact hyperplane hashing with bilinear functions. In International Conference on Machine Learning (ICML), Edinburgh, Scotland, 2012.
16. A. Magen. Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications. RANDOM, 2002.
17. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In Proc. 8th Int'l Conf. Computer Vision, volume 2, pages 416-423, July 2001.
18. Y. Mu, J. Wright, and S. Chang. Accelerated large scale optimization by concomitant hashing. In Computer Vision-ECCV, pages 414-427. Springer, 2012.
19. J. Sun, Y. Zhang, and J. Wright. Efficient point-to-subspace query in-1 with application to robust face recognition. 2012.
20. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli. Image quality assessment: From error visibility to structural similarity. IEEE Trans. Image Process., 13(4):600-612, 2004.
21. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Advances in Neural Information Processing Systems (NIPS), 2008.
22. A. Yang, J. Wright, Y. Ma, and S. Sastry. Unsupervised segmentation of natural images via lossy data compression. Comput. Vis. Image Underst., 110(2), May 2008.
23. G. Yu, G. Sapiro, and S. Mallat. Solving inverse problems with piecewise linear estimators: From gaussian mixture models to structured sparsity. Image Processing, IEEE Transactions on, 21(5):2481-2499, 2012.