کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4968995 | 1449849 | 2017 | 17 صفحه PDF | دانلود رایگان |
- We provide a theoretical study of ambiguities arising in two-image photometric stereo.
- Disambiguation is formulated as a binary labeling problem, using integrability and a nonstationary Ising model.
- Resolution is achieved efficiently by resorting to the graph cut algorithm.
- An application to three-image photometric stereo with shadows is presented.
This work tackles the problem of two-image photometric stereo. This problem constitutes the intermediate case between conventional photometric stereo with at least three images, which is well-posed, and shape-from-shading, which is ill-posed. We first provide a theoretical study of ambiguities arising in this intermediate case. Based on this study, we show that when the albedo is known, disambiguation can be formulated as a binary labeling problem, using integrability and a nonstationary Ising model. The resulting optimization problem is solved efficiently by resorting to the graph cut algorithm. These theoretical and numerical contributions are eventually validated in an application to three-image photometric stereo with shadows.
Journal: Image and Vision Computing - Volume 57, January 2017, Pages 175-191