ACM Home Page
Please provide us with feedback. Feedback
A theory of locally low dimensional light transport
Full text MovMov (23:17),  PdfPdf (5.22 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 26 ,  Issue 3  (July 2007) table of contents
Proceedings of ACM SIGGRAPH 2007
SESSION: Light transport table of contents
Article No. 62  
Year of Publication: 2007
ISSN:0730-0301
Also published in ...
Authors
Dhruv Mahajan  Columbia University
Ira Kemelmacher Shlizerman  Weizmann Institute of Science
Ravi Ramamoorthi  Columbia University
Peter Belhumeur  Columbia University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 99,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276377.1276454
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

Blockwise or Clustered Principal Component Analysis (CPCA) is commonly used to achieve real-time rendering of shadows and glossy reflections with precomputed radiance transfer (PRT). The vertices or pixels are partitioned into smaller coherent regions, and light transport in each region is approximated by a locally low-dimensional subspace using PCA. Many earlier techniques such as surface light field and reflectance field compression use a similar paradigm. However, there has been no clear theoretical understanding of how light transport dimensionality increases with local patch size, nor of the optimal block size or number of clusters.

In this paper, we develop a theory of locally low dimensional light transport, by using Szego's eigenvalue theorem to analytically derive the eigenvalues of the covariance matrix for canonical cases. We show mathematically that for symmetric patches of area A, the number of basis functions for glossy reflections increases linearly with A, while for simple cast shadows, it often increases as √A. These results are confirmed numerically on a number of test scenes. Next, we carry out an analysis of the cost of rendering, trading off local dimensionality and the number of patches, deriving an optimal block size. Based on this analysis, we provide useful practical insights for setting parameters in CPCA and also derive a new adaptive subdivision algorithm. Moreover, we show that rendering time scales sub-linearly with the resolution of the image, allowing for interactive all-frequency relighting of 1024 x 1024 images.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Basri, R., and Jacobs, D. 2001. Lambertian reflectance and linear subspaces. In International Conference on Computer Vision, 383--390.
2
 
3
4
 
5
Garg, G., Talvala, E., Levoy, M., and Lensch, H. 2006. Symmetric photography: Exploiting data-sparseness in reflectance fields. In EuroGraphics Symposium on Rendering, 251--262.
 
6
 
7
Grenander, U., and Szego, G. 1958. Toeplitz Forms and Their Applications. University of Calif. Press, Berkeley and Los Angeles.
8
 
9
Liu, X., Sloan, P., Shum, H., and Snyder, J. 2004. All-frequency precomputed radiance transfer for glossy objects. EuroGraphics Symposium on Rendering 2004, 337--344.
10
11
12
 
13
Nimeroff, J., Simoncelli, E., and Dorsey, J. 1994. Efficient re-rendering of naturally illuminated environments. In EuroGraphics Workshop on Rendering, 359--373.
 
14
 
15
 
16
Okikioulu, K. 1996. The analogue of the strong Szego limit theorem on the 2- and 3- dimensional spheres. Journal of the American Mathematical Society 9, 2, 345--372.
17
 
18
 
19
 
20
21
22
23
24


Collaborative Colleagues:
Dhruv Mahajan: colleagues
Ira Kemelmacher Shlizerman: colleagues
Ravi Ramamoorthi: colleagues
Peter Belhumeur: colleagues