Because light field provides spatial and angular information, we can alter the position of focal planes after exposure, which is often termed
refocusing. The principle of refocusing is to obtain conventional 2-D photographs from a light field through the
integral transform. The transform takes a lightfield as its input and generates a photograph focused on a specific plane. Assuming L_{F}(s,t,u,v) represents a 4-D light field that records light rays traveling from position (u,v) on the first plane to position (s,t) on the second plane, where F is the distance between two planes, a 2-D photograph at any depth \alpha F can be obtained from the following integral transform: : \mathcal{P}_{\alpha}\left[L_{F}\right](s, t) = {1 \over \alpha^2 F^2}\iint L_F\left(u\left(1 - \frac{1}{\alpha}\right) + \frac{s}{\alpha}, v\left(1 - \frac{1}{\alpha}\right) + \frac{t}{\alpha}, u, v\right)~dudv , or more concisely, :\mathcal{P}_{\alpha}\left[L_{F}\right](\boldsymbol{s})=\frac{1}{\alpha^{2} F^{2}} \int L_{F}\left(\boldsymbol{u}\left(1-\frac{1}{\alpha}\right)+\frac{\boldsymbol{s}}{\alpha}, \boldsymbol{u}\right) d \boldsymbol{u}, where \boldsymbol{s}=(s,t), \boldsymbol{u}=(u,v), and \mathcal{P}_{\alpha}\left[\cdot\right] is the photography operator. In practice, this formula cannot be directly used because a plenoptic camera usually captures discrete samples of the lightfield L_{F}(s,t,u,v), and hence resampling (or interpolation) is needed to compute L_{F}\left(\boldsymbol{u}\left(1-\frac{1}{\alpha}\right)+\frac{\boldsymbol{s}}{\alpha}, \boldsymbol{u}\right). Another problem is high computational complexity. To compute an N\times N 2-D photograph from an N\times N\times N\times N 4-D light field, the complexity of the formula is O(N^4). DFST is designed to generate a collection of refocused 2-D photographs, or so-called
Focal Stack. This method can be implemented by fast
fractional fourier transform (FrFT). The discrete photography operator \mathcal{P}_{\alpha}\left[\cdot\right] is defined as follows for a lightfield L_{F}(\boldsymbol {s},\boldsymbol {u}) sampled in a 4-D grid \boldsymbol {s} = \Delta s \tilde{\boldsymbol {s}}, \tilde{\boldsymbol {s}} = -\boldsymbol {n}_{\boldsymbol {s}}, ..., \boldsymbol {n}_{\boldsymbol {s}}, \boldsymbol {u} = \Delta u \tilde{\boldsymbol {u}}, \tilde{\boldsymbol {u}}=-\boldsymbol {n}_{\boldsymbol {u}},...,\boldsymbol {n}_{\boldsymbol {u}}: :\mathcal{P}_{q}[L](\boldsymbol{s})= \sum_{\tilde{\boldsymbol{u}}=-\boldsymbol{n}_{\boldsymbol{u}}}^{\boldsymbol{n}_{\boldsymbol{u}}} L(\boldsymbol{u} q+\boldsymbol{s}, \boldsymbol{u}) \Delta \boldsymbol{u}, \quad \Delta \boldsymbol{u}=\Delta u\Delta v, \quad q=\left(1-\frac{1}{\alpha}\right) Because (\boldsymbol{u} q+\boldsymbol{s}, \boldsymbol{u}) is usually not on the 4-D grid, DFST adopts
trigonometric interpolation to compute the non-grid values. The algorithm consists of these steps: • Sample the light field L_{F}(\boldsymbol {s},\boldsymbol {u}) with the sampling period \Delta s and \Delta u and get the discretized light field L^d_{F}(\boldsymbol {s},\boldsymbol {u}). • Pad L^d_{F}(\boldsymbol {s},\boldsymbol {u}) with zeros such that the signal length is enough for FrFT without aliasing. • For every \boldsymbol {u}, compute the
Discrete Fourier transform of L^d_{F}(\boldsymbol {s},\boldsymbol {u}), and get the result R1. • For every focal length \alpha F, compute the
fractional fourier transform of R1, where the order of the transform depends on \alpha, and get the result R2. • Compute the inverse Discrete Fourier transform of R2. • Remove the marginal pixels of R2 so that each 2-D photograph has the size (2{n}_{\boldsymbol {s}}+1) by (2{n}_{\boldsymbol {s}}+1) ==Methods to create light fields==