Dense photometric stereo by expectation maximization

9Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We formulate a robust method using Expectation Maximization (EM) to address the problem of dense photometric stereo, Previous approaches using Markov Random Fields (MRF) utilized a dense set of noisy photometric images for estimating an initial normal to encode the matching cost at each pixel, followed by normal refinement by considering the neighborhood of the pixel. In this paper, we argue that they had not fully utilized the inherent data redundancy in the dense set and that its full exploitation leads to considerable improvement. Using the same noisy and dense input, this paper contributes in learning relevant observations, recovering accurate normals and very good surface albedos, and inferring optimal parameters in an unifying EM framework that converges to an optimal solution and has no free user-supplied parameter to wet. Experiments show that our EM approach for dense photometric stereo outperforms the previous approaches using the same input. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wu, T. P., & Tang, C. K. (2006). Dense photometric stereo by expectation maximization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3954 LNCS, pp. 159–172). https://doi.org/10.1007/11744085_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free