参考文献
[1]Bartlett M,Movellan J,Sejnowsk T.Face Recognition by Independent Component Analysis[J].IEEE Transactions on Neural Networks,2002,13(11):1450-1464.
[2]Turk M,Pentland A.Eigenfaces for Recognition[J].Journal of Cognitive Neuroscience,1991,3(2):71-86.
[3]Belhumeur P N,Hespanha J P,Kriegman D J.Eigenfaces Vs Fisherfaces:Recognition Using Class Specific Linear Projection[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1997,19(3):711-720.
[4]He X,Yan S,Hu Y.Face Recognition Using Laplaeian-faces[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(3):328-340.
[5]Elad M.Sparse and Redundant Representation Modeling-what Next[J].IEEE Signal Processing Letters,2012,19(1):922-928.
[6]Elad M.Sparse and Redundant Representations:From Theory to Applications in Signal and Image Process-ing[M].Berlin,Germany:Springer,2010:236-348.
[7]Patel V M,Chellappa R.Sparse Representations and Compressive Sensing for Imaging and Vision[M].Berlin,Germany:Springer,2013:254-266.
[8]Wright J,Yang A Y,Ganesh A,et al.Robust Face Recognition via Sparse Representation[J].IEEE Tran-sactions on Pattern Analysis and Machine Intelligence,2009,31(2):210-227.
[9]Deng W H,Hu J,Guo J.Extended SRC:Under Sampled Face Recognition via Intra-class Variant Dictionary[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2012,34(9):1864-1870.
[10]Zhang L,Zhou W,Chang P.Kernel Sparse Representation-based Classifier[J].IEEE Transactions on Signal Processing,2012,60(4):1684-1694.
[11]Gao S,Tsang I,Chia L T.Sparse Representation with Kernels[J].IEEE Transactions on Image Processing,2013,22(2):423-434.
[12]薄纯娟,张汝波,刘冠群,等.基于核非负稀疏表示的人脸识别[J].计算机应用,2014,34(8):2227-2230.
[13]朱杰,杨万扣,唐振民,等.基于字典学习的核稀疏表示人脸识别方法[J].模式识别与人工智能,2012,25(5):859-864.
[14]Elhami E,Vida1 R.Block-sparse Recovery via Convex Optimization[J].IEEE Transactions on Signal Process-ing,2012,60(8):4049-4107.
[15]胡正平,赵淑欢.分辨性分解块稀疏表示遮挡人脸识别算法[J].信号处理,2014,30(2):214-220.
[16]Candès E J,Li X D,Ma Y,et al.Robust Principal Component Analysis[J].Journal of ACM,2011,58(3):201-204.
[17]Wright J,Ganesh A,Rao S,et al.Robust Principal Component Analysis:Exact Recovery of Corrupted Low-rank Matrices via Convex Optimization[J].Neural Information Processing Systems,2009,34(5):2080-2088.
[18]Chen S,Donoho D,Saunders M.Atomic Decomposition by Basis Pursuit[J].SIAM Review,2001,43(1):129-159.
[19]Donoho D.For Most Large Underdetermined Systems of Linear Equations the Minimal 1-norm Near Solution Approximates the Sparest Solution[J].Common Pure and Applied Mathmatics,2006,59(10):907-934.
[20]Lin Z,Liu R,Su Z.Linearized Alternating Direction Method with Adaptive Penalty for Low-rank Representa-tion[J].Neural Information Processing System,2011,25(3):612-620.
[21]Tropp J,Gilbert A.Signal Recovery from Random Measurements via Orthogonal Matching Pursuit[J].IEEE Transactions on Information Theory,2007,53(12):4655-4666.
[22]Needell D,Vershynin R.Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit[J].Foundations of Computational Mathematics,2009,9(1):317-334.
[23]Cai T,Xu G,Zhang J.On Recovery of Sparse Signals viaL1 Minimization[J].IEEE Transactions on Info-rmation Theory,2009,51(12):4203-4215.
[24]Mohimani H,Zadeh M,Jutten C.A Fast Approach for over Complete Sparse Decomposition Based on Smoothed L0 Norm[J].IEEE Transactions on Informa-tion Theory,2009,57(1):289-301.
编辑索书志 |