Please use this identifier to cite or link to this item:
Title: Reconstruction of depth and normals from interreflections
Authors: Hua, B.-S.
Ng, T.-T.
Low, K.-L. 
Keywords: depth reconstruction
light transport
normal reconstruction
shape from interreflections
Issue Date: 2013
Citation: Hua, B.-S.,Ng, T.-T.,Low, K.-L. (2013). Reconstruction of depth and normals from interreflections. 2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings : 2557-2561. ScholarBank@NUS Repository.
Abstract: While geometry reconstruction has been extensively studied, several shortcomings still exist. First, traditional geometry reconstruction methods such as geometric or photometric stereo only recover either surface depth or normals. Second, such methods require calibration. Third, such methods cannot recover accurate geometry in the presence of interreflections. In order to address these problems in a single system, we propose an approach to reconstruct geometry from light transport data. Specifically, we investigate the problem of geometry reconstruction from interreflections in a light transport matrix. We show that by solving a system of polynomial equations derived directly from the interreflection matrix, both surface depth and normals can be fully reconstructed. Our system does not require projector-camera calibration, but only make use of a calibration object such as a checkerboard in the scene to pre-determine a few known points to simplify the polynomial solver. Our experimental results show that our system is able to reconstruct accurate geometry from interreflections up to a certain noise level. Our system is easy to set up in practice. © 2013 IEEE.
Source Title: 2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings
ISBN: 9781479923410
DOI: 10.1109/ICIP.2013.6738527
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Nov 23, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.