[1]
[2] Maciel J, Costeira J P. A global solution to sparse correspondence problems[C]//IEEE, 2003, 25(2): 139-154.
[3]
[4] Torresani L, Kolmogorov V, Rother C. Feature correspondence via graph matching: Models and global optimization [C]//ECCV, 2008: 596-609.
[5] Lv Yinhuan, Wang Guotian, Wang Ruli. Research and analusis on the performances of several correlative matching algorithms[J]. Infrared and Laser Engineering, 2003, 32(4):372-376. (in Chinese)
[6]
[7] Yang J, Zhang D, Frangi A F, et al. Two-dimensional PCA A new approach to appearance-based face representation and recognition[C]//IEEE, 2004, 26(1): 131-137.
[8]
[9] Wang L, Wang X, Feng J. Subspace distance analysis with application to adaptive Bayesian algorithm for face recognition[J]. Pattern Recognition, 2006, 39(3): 456-464.
[10]
[11]
[12] Li Fei, Dai Qionghai, Xu Wenli, et al. Weighted subspace distance and its applications to object recognition and retrieval with image sets[C]//IEEE, 2009, 16(3): 227-230.
[13]
[14] Guney N, Ertuzun A. Undoing the affine transformation using blind source separation[C]//ICA, 2006: 360-367.
[15] Zhang Wenlin, Zhang Weiqiang, Liu Jia, et al. A new subspace based speaker adaptation method[J]. Acta Automatica Sinica, 2011, 37(12): 1495-1502.
[16]
[17] Golub G H, Loan C F. Matrix Computations[M]. VS:Johns Hopkins University Press, 1996.