Compressive Dual Photography

The accurate measurement of the light transport characteristics of a complex scene is an important goal in computer graphics and has applications in relighting and dual photography. However, since the light transport data sets are typically very large, much of the previous research has focused on ad...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 28; no. 2; pp. 609 - 618
Main Authors: Sen, Pradeep, Darabi, Soheil
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.04.2009
Subjects:
Algorithms
Computer graphics
I.3.3 [Computer Graphics]: Picture/Image Generation-Digitizing and scanning I.4.1 [Image Processing and Computer Vision]: Digitization and Image Capture-Reflectance
Light
Lighting
Photography
Studies
Systems development
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The accurate measurement of the light transport characteristics of a complex scene is an important goal in computer graphics and has applications in relighting and dual photography. However, since the light transport data sets are typically very large, much of the previous research has focused on adaptive algorithms that capture them efficiently. In this work, we propose a novel, non‐adaptive algorithm that takes advantage of the compressibility of the light transport signal in a transform domain to capture it with less acquisitions than with standard approaches. To do this, we leverage recent work in the area of compressed sensing, where a signal is reconstructed from a few samples assuming that it is sparse in a transform domain. We demonstrate our approach by performing dual photography and relighting by using a much smaller number of acquisitions than would normally be needed. Because our algorithm is not adaptive, it is also simpler to implement than many of the current approaches.
Bibliography:istex:2B30DD44FB0AD524C485630F7CFCD861BA92DC82
ArticleID:CGF1401
ark:/67375/WNG-8M9WZ0VK-0
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2009.01401.x