2014
DOI: 10.1117/12.2074695
|View full text |Cite
|
Sign up to set email alerts
|

Computational imaging of light in flight

Abstract: Many computer vision tasks are hindered by image formation itself, a process that is governed by the so-called plenoptic integral. By averaging light falling into the lens over space, angle, wavelength and time, a great deal of information is irreversibly lost. The emerging idea of transient imaging operates on a time resolution fast enough to resolve non-stationary light distributions in real-world scenes. It enables the discrimination of light contributions by the optical path length from light source to rec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…Depending on the application domain, existing algorithms to simulate transient light transport trade off accuracy for speed. As a forward model for efficient reconstruction of the geometry of occluded objects, Hullin [2014] and Klein et al [2016] extended Smith et al's [2008] transient version of the radiosity method [Goral et al 1984] on the GPU. This method is limited to Lambertian surface reflections, and second-bounce interactions.…”
Section: Light Transport Simulation Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Depending on the application domain, existing algorithms to simulate transient light transport trade off accuracy for speed. As a forward model for efficient reconstruction of the geometry of occluded objects, Hullin [2014] and Klein et al [2016] extended Smith et al's [2008] transient version of the radiosity method [Goral et al 1984] on the GPU. This method is limited to Lambertian surface reflections, and second-bounce interactions.…”
Section: Light Transport Simulation Algorithmsmentioning
confidence: 99%
“…For the particular case of K = 2, this approach allows for a very fast reconstruction [Dorrington et al 2011;Godbaz et al 2012;Adam et al 2016;Naik et al 2015]. Wu et al [2012a;2014] noted that in streak images this Ksparse model is actually convolved by the sensor temporal point spread function (PSF) (Figure 5, left), which presents a Gaussian shape [Velten et al 2013]. Following this observation, the authors model Equation ( 7) as a sum of Gaussians instead:…”
Section: Sparsity and Compressibilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Despite all these available hardware options, the reconstruction step is still a bottleneck, limiting the applicability of this technology in the wild. Different approaches have been proposed for reconstruction, either by solving a non-convex optimization on three-dimensional geometry [11,12] or a depth map [8], or by back-projecting the space-time captured image on a voxelized geometry representation [3,13]. In both cases, the large amount of data being processed, together with the complexity of the reconstruction algorithms, impose computation times in the order of several hours.…”
Section: Introductionmentioning
confidence: 99%
“…Different approaches have been proposed for reconstruction, either by solving a non-convex optimization on three-dimensional geometry [11,12] or a depth map [8], or by back-projecting the space-time captured image on a voxelized geometry representation [3,13]. In both cases, the large amount of data being processed, together with the complexity of the reconstruction algorithms, impose computation times in the order of several hours.…”
Section: Introductionmentioning
confidence: 99%