Abstract
Finding the nearest subspace is a fundamental problem in many tasks such as recognition, retrieval and optimization. This hard topic has been seldom touched in the literature, except a very few studies that address it using the locality sensitive hashing for subspaces. The existing solutions severely suffer from poor scaling with expensive computational cost or unsatisfying accuracy, when the subspaces originally distribute with arbitrary dimensions. To address these problems, this paper proposes a new and efficient family of locality sensitive hash for linear subspaces of arbitrary dimension. It preserves the angular distances among subspaces by randomly projecting their orthonormal basis and further encoding them with binary codes. The proposed method enjoys fast computation and meanwhile keeps the strong collision probability. Moreover, it owns flexibility to easily balance the performance between the accuracy and efficiency. The experimental results in the tasks of face recognition and video de-duplication demonstrate that the proposed method significantly outperforms the state-of-the-art vector and subspace hashing methods, in terms of both accuracy and efficiency (up to \(16\times \) speedup).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Basri, R., Hassner, T., Zelnik-Manor, L.: Approximate nearest subspace search. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 266–278 (2011)
Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: ACM Symposium on Theory of Computing, pp. 380–388 (2002)
Cheng, J., et al.: Fast and accurate image matching with cascade hashing for 3d reconstruction. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2014)
Dean, T., et al.: Fast, accurate detection of 100,000 object classes on a single machine. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1814–1821 (2013)
Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 643–660 (2001)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115–1145 (1995)
Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 35(12), 2916–2929 (2013)
Hong, R., Hu, Z., Wang, R., Wang, M., Tao, D.: Multi-view object retrieval via multi-scale topic models. IEEE Trans. Image Process. 25(12), 5814–5827 (2016)
Hong, R., Zhang, L., Tao, D.: Unified photo enhancement by discovering aesthetic communities from flickr. IEEE Trans. Image Process. 25(3), 1124–1135 (2016)
Jain, P., Vijayanarasimhan, S., Grauman, K.: Hashing hyperplane queries to near points with applications to large-scale active learning. In: Advances in Neural Information Processing Systems, pp. 928–936 (2010)
Ji, J., Li, J., Tian, Q., Yan, S., Zhang, B.: Angular-similarity-preserving binary signatures for linear subspaces. IEEE Trans. Image Process. 24(11), 4372–4380 (2015)
Knyazev, A.V., Argentati, M.E.: Principal angles between subspaces in an a-based scalar product: algorithms and perturbation estimates. SIAM J. Sci. Comput. 23(6), 2008–2040 (2002)
Liu, W., Wang, J., Mu, Y., Kumar, S., Chang, S.F.: Compact hyperplane hashing with bilinear functions. In: International Conference on Machine Learning, pp. 1–8 (2012)
Liu, X., et al.: Multilinear hyperplane hashing. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 5119–5127 (2016)
Liu, X., He, J., Deng, C., Lang, B.: Collaborative hashing. In: IEEE International Conference on Computer Vision, pp. 2139–2146 (2014)
Liu, X., Li, Z., Deng, C., Tao, D.: Distributed adaptive binary quantization for fast nearest neighbor search. IEEE Trans. Image Process. 26(11), 5324–5336 (2017)
Marques, M., Stošić, M., Costeira, J.: Subspace matching: unique solution to point matching with geometric constraints. In: IEEE International Conference on Computer Vision, pp. 1288–1294 (2009)
Mu, Y., Hua, G., Fan, W., Chang, S.F.: Hash-svm: scalable kernel machines for large-scale visual classification. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 979–986 (2014)
Peng, C., Kang, Z., Cheng, Q.: Subspace clustering via variance regularized ridge regression. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2931–2940 (2017)
Shen, F., Zhou, X., Yang, Y., Song, J., Shen, H.T., Tao, D.: A fast optimization method for general binary code learning. IEEE Trans. Image Process. 25(12), 5610–5621 (2016)
Sim, T., Baker, S., Bsat, M.: The CMU pose, illumination, and expression (PIE) database. In: Proceedings of Fifth IEEE International Conference on Automatic Face and Gesture Recognition, pp. 53–58 (2002)
Song, J., Yang, Y., Huang, Z., Shen, H.T., Hong, R.: Multiple feature hashing for real-time large scale near-duplicate video retrieval. In: ACM on Multimedia Conference, pp. 423–432 (2011)
Wang, X., Atev, S., Wright, J., Lerman, G.: Fast subspace search via grassmannian based hashing. In: IEEE International Conference on Computer Vision, pp. 2776–2783 (2013)
Yang, X., Wang, M., Hong, R., Tian, Q., Rui, Y.: Enhancing person re-identification in a self-trained subspace. ACM Trans. Multimed. Comput. Commun. Appl. 13(3), 27 (2017)
Zhang, F.: Matrix theory: basic results and techniques. Springer Science & Business Media, New York (2011)
Zhou, L., Bai, X., Liu, X., Zhou, J.: Binary coding by matrix classifier for efficient subspace retrieval. In: ACM International Conference on Multimedia Retrieval, pp. 1–8 (2018)
Acknowledgement
This work was supported by National Natural Science Foundation of China 61690202, 61872021, Australian Research Council Projects FL-170100117, DP-180103424, LP-150100671, IH180100002, and MSRA Collaborative Research Grant.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, B., Liu, X., Xia, K., Ramamohanarao, K., Tao, D. (2018). Random Angular Projection for Fast Nearest Subspace Search. In: Hong, R., Cheng, WH., Yamasaki, T., Wang, M., Ngo, CW. (eds) Advances in Multimedia Information Processing – PCM 2018. PCM 2018. Lecture Notes in Computer Science(), vol 11164. Springer, Cham. https://doi.org/10.1007/978-3-030-00776-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-00776-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00775-1
Online ISBN: 978-3-030-00776-8
eBook Packages: Computer ScienceComputer Science (R0)