DocumentCode :
769673
Title :
Dense Photometric Stereo: A Markov Random Field Approach
Author :
Tai-Pang Wu ; Kam-Lun Tang ; Chi-Keung Tang ; Tien-Tsin Wong
Author_Institution :
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon
Volume :
28
Issue :
11
fYear :
2006
Firstpage :
1830
Lastpage :
1846
Abstract :
We address the problem of robust normal reconstruction by dense photometric stereo, in the presence of complex geometry, shadows, highlight, transparencies, variable attenuation in light intensities, and inaccurate estimation in light directions. The input is a dense set of noisy photometric images, conveniently captured by using a very simple set-up consisting of a digital video camera, a reflective mirror sphere, and a handheld spotlight. We formulate the dense photometric stereo problem as a Markov network and investigate two important inference algorithms for Markov random fields (MRFs) - graph cuts and belief propagation - to optimize for the most likely setting for each node in the network. In the graph cut algorithm, the MRF formulation is translated into one of energy minimization. A discontinuity-preserving metric is introduced as the compatibility function, which allows a-expansion to efficiently perform the maximum a posteriori (MAP) estimation. Using the identical dense input and the same MRF formulation, our tensor belief propagation algorithm recovers faithful normal directions, preserves underlying discontinuities, improves the normal estimation from one of discrete to continuous, and drastically reduces the storage requirement and running time. Both algorithms produce comparable and very faithful normals for complex scenes. Although the discontinuity-preserving metric in graph cuts permits efficient inference of optimal discrete labels with a theoretical guarantee, our estimation algorithm using tensor belief propagation converges to comparable results, but runs faster because very compact messages are passed and combined. We present very encouraging results on normal reconstruction. A simple algorithm is proposed to reconstruct a surface from a normal map recovered by our method. With the reconstructed surface, an inverse process, known as relighting in computer graphics, is proposed to synthesize novel images of the given scene under user-specifie- light source and direction. The synthesis is made to run in real time by exploiting the state-of-the-art graphics processing unit (GPU). Our method offers many unique advantages over previous relighting methods and can handle a wide range of novel light sources and directions
Keywords :
Markov processes; computational geometry; computer graphics; maximum likelihood estimation; photometry; stereo image processing; Markov random field approach; compatibility function; computer graphics; dense photometric stereo; digital video camera; discontinuity-preserving metric; graph cut algorithm; graphics processing unit; handheld spotlight; maximum a posteriori estimation; noisy photometric images; reconstructed surface; reflective mirror sphere; robust normal reconstruction; tensor belief propagation algorithm; Belief propagation; Computer graphics; Image reconstruction; Inference algorithms; Layout; Light sources; Markov random fields; Photometry; Surface reconstruction; Tensile stress; Markov random fields; Photometric stereo; belief propagation; graph cuts; normal and surface reconstruction; real-time relighting.; robust inference; Algorithms; Artificial Intelligence; Image Enhancement; Image Interpretation, Computer-Assisted; Information Storage and Retrieval; Markov Chains; Pattern Recognition, Automated; Photogrammetry; Photometry;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.2006.224
Filename :
1704838
Link To Document :
بازگشت