Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4968995 | Image and Vision Computing | 2017 | 17 Pages |
â¢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.