TY - GEN
T1 - Passive photometric stereo from motion
AU - Lim, Jongwoo
AU - Ho, Jeffrey
AU - Yang, Ming Hsuan
AU - Kriegman, David
PY - 2005
Y1 - 2005
N2 - We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Starting with an initial piecewise linear surface, the algorithm iteratively estimates a new surface based on the previous surface estimate and the photometric information available from the input image sequence. During each iteration, standard photometric stereo techniques are applied to estimate the surface normals up to an unknown generalized bas-relief transform, and a new surface is computed by integrating the estimated normals. The algorithm essentially consists of a sequence of matrix factorizations (of intensity values) followed by minimization using gradient descent (integration of the normals). Conceptually, the algorithm admits a clear geometric interpretation, which is used to provide a qualitative analysis of the algorithm's convergence. Implementation-wise, it is straightforward, being based on several established photometric stereo and structure from motion algorithms. We demonstrate experimentally the effectiveness of our algorithm using several videos of hand-held objects moving in front of a fixed light and camera.
AB - We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Starting with an initial piecewise linear surface, the algorithm iteratively estimates a new surface based on the previous surface estimate and the photometric information available from the input image sequence. During each iteration, standard photometric stereo techniques are applied to estimate the surface normals up to an unknown generalized bas-relief transform, and a new surface is computed by integrating the estimated normals. The algorithm essentially consists of a sequence of matrix factorizations (of intensity values) followed by minimization using gradient descent (integration of the normals). Conceptually, the algorithm admits a clear geometric interpretation, which is used to provide a qualitative analysis of the algorithm's convergence. Implementation-wise, it is straightforward, being based on several established photometric stereo and structure from motion algorithms. We demonstrate experimentally the effectiveness of our algorithm using several videos of hand-held objects moving in front of a fixed light and camera.
UR - http://www.scopus.com/inward/record.url?scp=33745881365&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745881365&partnerID=8YFLogxK
U2 - 10.1109/ICCV.2005.185
DO - 10.1109/ICCV.2005.185
M3 - Conference contribution
AN - SCOPUS:33745881365
SN - 076952334X
SN - 9780769523347
T3 - Proceedings of the IEEE International Conference on Computer Vision
SP - 1635
EP - 1642
BT - Proceedings - 10th IEEE International Conference on Computer Vision, ICCV 2005
T2 - Proceedings - 10th IEEE International Conference on Computer Vision, ICCV 2005
Y2 - 17 October 2005 through 20 October 2005
ER -