Abstract
Nuclear norm minimization problems for finding the minimum rank matrix have been well studied in many areas. Schatten p-norm is an extension of nuclear norm and the rank function. Different p provides flexible choices for suiting for different applications. Differing from the viewpoint of rank, we will use Schatten p-norm to characterize the error matrix between the occluded face image and its ground truth. Thus, a Schatten p-norm based matrix regression model is presented and a general framework for solving Schatten p-norm minimization problem with an added l_q regularization is solved by alternating direction method of multipliers (ADMM). The experiments for image classification and face reconstruction show that our algorithm is more effective and efficient, and thus can act as a fast solver for matrix regression problem.
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
Preview
Unable to display preview. Download preview PDF.
References
Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of American Control Conference, vol. 6, pp. 4734–4739 (2001)
Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. arxiv:0706.4138 (2007)
Fazel, M.: Matrix Rank Minimization with Applications. PhD thesis, Stanford University (2002)
Recht, B., Xu, W., Hassibi, B.: Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In: Proceedings of the 47th IEEE Conference on Decision and Control, pp. 3065–3070 (2008)
Candés, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics (2009)
Liu, Z., Vandenberghe, L.: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification. SIAM Journal on Matrix Analysis and Applications 31(3), 1235–1256 (2009)
Hansson, A., Liu, Z., Vandenberghe, L.: Subspace system identification via weighted nuclear norm optimization. In: Proceedings of the IEEE 51st Annual Conference on Decision and Control, pp. 3439–3444 (2012)
Naseem, I., Togneri, R., Bennamoun, M.: Linear regression for face recognition. IEEE Trans. Patt. Anal. Mach. Intell. 32(11), 2106–2112 (2010)
Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(2), 210–227 (2009)
Zhang, L., Yang, M., Feng, X.C.: Sparse representation or collaborative representation: Which helps face recognition? In: 2011 IEEE International Conference on Computer Vision (ICCV), pp. 471–478 (2011)
Yang, J., Qian, J., Luo, L., Zhang, F., Gao, Y.: Nuclear Norm based Matrix Regression with Applications to Face Recognition with Occlusion and Illumination Changes, arXiv:1405.1207 (2014)
Nie, F., Huang, H., Ding, C.: Low–Rank Matrix Recovery via Efficient Schatten p–Norm Minimization. In: Proc. AAAI 2012 (2012)
Li, Z., Liu, J., Yang, Y., Zhou, X., Lu, H.: Clustering-Guided Sparse Structural Learning for Unsupervised Feature Selection (2013)
Li, Z., Liu, J., Zhu, X., Liu, T., Lu, H.: Image annotation using multi-correlation probabilistic matrix factorization. In: Proceedings of the International Conference on Multimedia, pp. 1187–1190. ACM (2010)
Li, Z., Yang, Y., Liu, J., et al.: Unsupervised Feature Selection Using Nonnegative Spectral Analysis. In: Proc. AAAI (2012)
Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17–40 (1976)
Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, pp. 299–331. North-Holland, Amsterdam (1983)
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3, 1–122 (2011)
Lin, Z., Chen, M., Ma, Y.: The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices. arXiv preprint arXiv:1009.5055 (2010)
Krishnan, D., Fergus, R.: Fast Image Deconvolution using Hyper-Laplacian Priors. In: Advances in Neural Information Processing (2009)
Chaux, C., Combettes, P., Pesquet, J.C., Wajs, V.: A variational formulation for frame-based inverse problems. Inverse Probl. 23(4), 1495–1518 (2007)
Yu, Y., Schuurmans, D.: Rank/norm regularization with closed-form solutions: Application to subspace clustering. Arxiv preprint arXiv:1202.3772 (2012)
Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization (2010)
Martinez, A.M., Benavente, R.: The AR Face Database. CVC Technical Report (1998)
Yang, J., Zhang, D., Frangi, A.F., Yang, J.Y.: Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(1), 131–137 (2004)
Yang, J., Zhang, L., Xu, Y., Yang, J.: Sparse Representation Classifier Steered Discriminative Projection With Applications to Face Recognition. IEEE Transactions on Neural Networks and Learning Systems (2012)
Asif, M.S.: Primal Dual Pursuit: A homotopy based algorithm for the Dantzig selector. Master’s thesis, Georgia Institute of Technology (2008)
Yang, M., Zhang, L., Yang, J., Zhang, D.: Robust sparse coding for face recognition. In: CVPR (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, L., Yang, J., Chen, J., Gao, Y. (2014). Schatten p-Norm Based Matrix Regression Model for Image Classification. In: Li, S., Liu, C., Wang, Y. (eds) Pattern Recognition. CCPR 2014. Communications in Computer and Information Science, vol 483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45646-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-45646-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45645-3
Online ISBN: 978-3-662-45646-0
eBook Packages: Computer ScienceComputer Science (R0)