2015
DOI: 10.1016/j.dsp.2014.12.007
|View full text |Cite
|
Sign up to set email alerts
|

A fast and memory-efficient Discrete Focal Stack Transform for plenoptic sensors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…This process yields numerically identical results to building the full 6D scale-slope space (7), but at a fraction of the computational cost. A few efficient methods for computing the focal stack F have been proposed [27], [32]. These generally find at minimum as many layers as there are samples in s or t. Feature detection may not require so many layers, and so we proceed with the more straightforward approach of shifting and summing LF subimages (8), with the understanding that computational savings may be possible for large stack depths.…”
Section: B Simplification Using Focal Stackmentioning
confidence: 99%
“…This process yields numerically identical results to building the full 6D scale-slope space (7), but at a fraction of the computational cost. A few efficient methods for computing the focal stack F have been proposed [27], [32]. These generally find at minimum as many layers as there are samples in s or t. Feature detection may not require so many layers, and so we proceed with the more straightforward approach of shifting and summing LF subimages (8), with the understanding that computational savings may be possible for large stack depths.…”
Section: B Simplification Using Focal Stackmentioning
confidence: 99%
“…Pérez et al [35] proposed a focal stack frequency decomposition algorithm from light field images based on the trigonometric interpolation principle as the discrete focal stack transform. The proposed method in [35] utilizes fast discrete Fourier transform to generate refocus planes in a reasonably fast computational time.…”
Section: Light Field Depth Estimation and Focal Stack Frameworkmentioning
confidence: 99%
“…Pérez et al [35] proposed a focal stack frequency decomposition algorithm from light field images based on the trigonometric interpolation principle as the discrete focal stack transform. The proposed method in [35] utilizes fast discrete Fourier transform to generate refocus planes in a reasonably fast computational time. The reverse of this transformation in studied in [36] where a focal stack is used to obtain a 4D light field image set using discrete focal stack transform.…”
Section: Light Field Depth Estimation and Focal Stack Frameworkmentioning
confidence: 99%
“…with the constant ρ defining the weight of the regularization term. The equivalent KKT-condition to (14) then becomes…”
Section: Regularizationmentioning
confidence: 99%