Woodham R J. Photometric method for determining surface orientation from multiple images. Optical Engineering, 1980, 19(1): 139-144
[2]
Belhumeur P N, Kriegman D J. What is the set of images of an object under all possible lighting conditions? In: Proceedings of the 1996 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. San Francisco, USA: IEEE, 1996. 270-227
[3]
Georghiades A S, Kriegman D J, Belhumeur P N. From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(6): 643-660
[4]
Jolliffe I T. Principal Component Analysis. New York: Springer-Verlag, 1986
[5]
Shi B X, Matsushita Y, Wei Y C, Xu C, Tan P. Self-calibrating photometric stereo. In: Proceedings of the 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. San Francisco, USA: IEEE, 2010. 1118-1125
[6]
Yuille A L, Snow D, Epstein R, Belhumeur P N. Determining generative models of objects under varying illumination: shape and albedo from multiple images using SVD and integrability. International Journal of Computer Vision, 1999, 35(3): 203-222
[7]
Juliá C, Lumbreras F, Sappa A D. A factorization-based approach to photometric stereo. International Journal of Imaging Systems and Technology, 2011, 21(1): 115-119
[8]
Chen P. Optimization algorithms on subspaces: revisiting missing data problem in low-rank matrix. International Journal of Computer Vision, 2008, 80(1): 125-142
[9]
Miyazaki D, Hara K, Ikeuchi K. Median photometric stereo as applied to the segonko tumulus and museum objects. International Journal of Computer Vision, 2010, 86(2-3): 229-242
[10]
Wu L, Ganesh A, Shi B X, Matsushita Y, Wang Y T, Ma Y. Robust photometric stereo via low-rank matrix completion and recovery. In: Proceedings of the 10th Asian Conference on Computer Vision. Queenstown New Zealand: Springer, 2010. 703-717
[11]
Chandrasekaran V, Sanghavi S, Parrilo P A, Willsky A S. Sparse and low-rank matrix decompositions. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL: IEEE, 2009. 962-967
[12]
Recht B, Fazel M, Parillo P A. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 2010, 52(3): 471-501
[13]
Candés E, Tao T. The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory, 2010, 56(5): 2053-2080
[14]
Toh K C, Yun S. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization, 2010, 6: 615-640
[15]
Cook R L, Torrance K E. A reflectance model for computer graphics. ACM SIGGRAPH Computer Graphics, 1981, 15(3): 307-316
[16]
Shashua A. Geometry and Photometry in 3D Visual Recognition[Ph.D. dissertation], Massachusetts Institute of Technology Cambridge, USA, 1992
[17]
Basri R, Jacobs D W. Lambertian reflectance and linear subspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(2): 218-233
[18]
Hayakawa H. Photometric stereo under a light source with arbitrary motion. Journal of the Optical Society of America, 1994, 11(11): 3079-3089
[19]
Belhumeur P N, Kriegman D J, Yuille A L. The bas-relief ambiguity. In: Proceedings of the 1997 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. San Juan, Puerto Rico: IEEE, 1997. 1060-1066
[20]
Jacobs D. Linear fitting with missing data: applications to structure-from-motion and to characterizing intensity images. In: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition. San Juan, Puerto Rico: IEEE, 1997. 206-212
[21]
Fischler M A, Bolles R C. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 1981, 24(6): 381-395
[22]
Guerreiro R F C, Aguiar P M Q. Estimation of rank deficient matrices from partial observations: two-step iterative algorithms. EMMCVPR. Lisbon, Portugal: Springer, 2003. 450-466
[23]
Mukaigawa Y, Ishii Y, Shakunaga T. Analysis of photometric factors based on photometric linearization. Journal of the Optical Society of America, 2007, 24(10): 3326-3334
[24]
Candés E, Li X D, Ma Y, Wright J. Robust principal component analysis? Journal of the ACM, 2011, 58(3): 1-37
[25]
Simchony T, Chellappa R, Shao M. Direct analytical methods for solving Possion equations in computer vision problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1990, 12(5): 435-446
[26]
Lin Z C, Chen M M, Wu L Q, Ma Y. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-rank Matrices. Technical Report UILU-ENG-09-2215, UIUC, USA, 2009
[27]
Candés E, Recht B. Exact matrix completion via convex optimization. Foundation of Computational Mathematics, 2008, 9(6): 717-772
[28]
Ganesh A, Lin Z C, Wright J, Wu L Q, Chen M M, Ma Y. Fast algorithms for recovering a corrupted low-rank matrix. In: Proceedings of the 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. Aruba, Dutch Antilles: IEEE, 2009. 213-216
[29]
Bertsekas D P. Nonlinear Programming. Belmont, MA: Athena Scientific, 2004
[30]
Zhou Z H, Li X D, Wright J, Candés E, Ma Y. Stable principal component pursuit. In: Proceedings of the 2010 IEEE International Symposium on Information Theory. Austin, USA: IEEE, 2010. 1518-1522
