Skip to main content

Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6494))

Abstract

We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recovering a low-rank matrix with both missing entries and corrupted entries, which model all types of non-Lambertian effects such as shadows and specularities. Unlike previous approaches that use Least-Squares or heuristic robust techniques, our method uses advanced convex optimization techniques that are guaranteed to find the correct low-rank matrix by simultaneously fixing its missing and erroneous entries. Extensive experimental results demonstrate that our method achieves unprecedentedly accurate estimates of surface normals in the presence of significant amount of shadows and specularities. The new technique can be used to improve virtually any photometric stereo method including uncalibrated photometric stereo.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Woodham, R.: Photometric method for determining surface orientation from multiple images. Optical Engineering 19, 139–144 (1980)

    Article  Google Scholar 

  2. Silver, W.: Determining shape and reflectance using multiple images. Master’s thesis, MIT (1980)

    Google Scholar 

  3. Shashua, A.: Geometry and photometry in 3d visual recognition. Ph.D dissertation, Department of Brain and Cognitive Science, MIT (1992)

    Google Scholar 

  4. Belhumeur, P., Kriegman, D.: What is the set of images of an object under all possible lighting conditions? In: Proc. of CVPR, pp. 270–277 (1996)

    Google Scholar 

  5. Basri, R., Jacobs, D.: Lambertian reflectance and linear subspaces. PAMI 25, 218–233 (2003)

    Article  Google Scholar 

  6. Georghiades, A.S., Kriegman, D.J., Belhumeur, P.N.: From few to many: illumination cone models for face recognition under variable lighting and pose. PAMI 23, 643–660 (2001)

    Article  Google Scholar 

  7. Jolliffe, I.: Principal Component Analysis. Springer, Heidelberg (1986)

    Book  MATH  Google Scholar 

  8. Fischler, M., Bolles, R.: Random sample consensus: A paradigm for model-fitting with applications to image analysis and automated cartography. Communications of the ACM 24, 381–395 (1981)

    Article  MathSciNet  Google Scholar 

  9. Hernández, C., Vogiatzis, G., Cipolla, R.: Multi-view photometric stereo. PAMI 30, 548–554 (2008)

    Article  Google Scholar 

  10. Miyazaki, D., Hara, K., Ikeuchi, K.: Median photometric stereo as applied to the segonko tumulus and museum objects. IJCV 86, 229–242 (2010)

    Article  Google Scholar 

  11. Mukaigawa, Y., Ishii, Y., Shakunaga, T.: Analysis of photometric factors based on photometric linearization. JOSA 24, 3326–3334 (2007)

    Article  Google Scholar 

  12. Hayakawa, H.: Photometric stereo under a light source with arbitrary motion. JOSA 11, 3079–3089 (1994)

    Article  Google Scholar 

  13. Knill, D.C., Mamassian, P., Kersten, D.: The geometry of shadows. JOSA 14, 3216–3232 (1997)

    Article  Google Scholar 

  14. Wright, J., Ganesh, A., Rao, S., Peng, Y., Ma, Y.: Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization. In: Proc. of Neural Information Processing Systems (2009)

    Google Scholar 

  15. Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Sparse and low-rank matrix decompositions. In: Proc. of IFAC Symp. on System Identification (2009)

    Google Scholar 

  16. Lin, Z., Chen, M., Wu, L., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices (2009) (preprint)

    Google Scholar 

  17. Recht, B., Fazel, M., Parillo, P.: Guaranteed minimum rank solution of matrix equations via nuclear norm minimization. SIAM Review (2008) (to appear)

    Google Scholar 

  18. Candès, E., Recht, B.: Exact matrix completion via convex optimzation. Found. of Comput. Math. (2008)

    Google Scholar 

  19. Candès, E., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory (2009) (to appear)

    Google Scholar 

  20. Ganesh, A., Lin, Z., Wright, J., Wu, L., Chen, M., Ma, Y.: Fast algorithms for recovering a corrupted low-rank matrix. In: Proc. of CAMSAP (2009)

    Google Scholar 

  21. Toh, K., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization (2009) (accepted)

    Google Scholar 

  22. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (2004)

    MATH  Google Scholar 

  23. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problem. SIAM Journal on Imaging Sciences, 183–202 (2008)

    Google Scholar 

  24. http://www-roc.inria.fr/gamma/gamma/download/download.php : 3D meshes research database by INRIA gamma group (2008)

  25. Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. SIGGRAPH Comput. Graph. 15, 307–316 (1981)

    Article  Google Scholar 

  26. Ganesh, A., Wright, J., Li, X., Candès, E., Ma, Y.: Dense error correction for low-rank matrices via principal component pursuit. In: Proc. of ISIT (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, L., Ganesh, A., Shi, B., Matsushita, Y., Wang, Y., Ma, Y. (2011). Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery. In: Kimmel, R., Klette, R., Sugimoto, A. (eds) Computer Vision – ACCV 2010. ACCV 2010. Lecture Notes in Computer Science, vol 6494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19318-7_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19318-7_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19317-0

  • Online ISBN: 978-3-642-19318-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics