Share Email Print

Proceedings Paper

Subspace methods for computational relighting
Author(s): Ha Q. Nguyen; Siying Liu; Minh N. Do
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We propose a vector space approach for relighting a Lambertian convex object with distant light source, whose crucial task is the decomposition of the reflectance function into albedos (or reflection coefficients) and lightings based on a set of images of the same object and its 3-D model. Making use of the fact that reflectance functions are well approximated by a low-dimensional linear subspace spanned by the first few spherical harmonics, this inverse problem can be formulated as a matrix factorization, in which the basis of the subspace is encoded in the spherical harmonic matrix S. A necessary and sufficient condition on S for unique factorization is derived with an introduction to a new notion of matrix rank called nonseparable full rank. An SVD-based algorithm for exact factorization in the noiseless case is introduced. In the presence of noise, the algorithm is slightly modified by incorporating the positivity of albedos into a convex optimization problem. Implementations of the proposed algorithms are done on a set of synthetic data.

Paper Details

Date Published: 14 February 2013
PDF: 10 pages
Proc. SPIE 8657, Computational Imaging XI, 865703 (14 February 2013); doi: 10.1117/12.2011522
Show Author Affiliations
Ha Q. Nguyen, Univ. of Illinois at Urbana-Champaign (United States)
Siying Liu, Univ. of Illinois at Urbana-Champaign (United States)
Minh N. Do, Univ. of Illinois at Urbana-Champaign (United States)

Published in SPIE Proceedings Vol. 8657:
Computational Imaging XI
Charles A. Bouman; Ilya Pollak; Patrick J. Wolfe, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?