Sciweavers

Share
ACCV
2010
Springer

Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery

8 years 8 months ago
Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
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.
Lun Wu, Arvind Ganesh, Boxin Shi, Yasuyuki Matsush
Added 12 May 2011
Updated 12 May 2011
Type Journal
Year 2010
Where ACCV
Authors Lun Wu, Arvind Ganesh, Boxin Shi, Yasuyuki Matsushita, Yongtian Wang, Yi Ma
Comments (0)
books