4932

Dense Photometric Stereo: A Markov Random Field Approach

Tai-Pang Wu, Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006

@article{wu2006dense,

   title={Dense photometric stereo: A markov random field approach},

   author={Wu, T.P. and Tang, K.L. and Tang, C.K. and Wong, T.T.},

   journal={IEEE transactions on pattern analysis and machine intelligence},

   pages={1830–1846},

   year={2006},

   publisher={IEEE Computer Society}

}

Download Download (PDF)   View View   Source Source   

901

views

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-specified– 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
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: