# Robust flash denoising/deblurring by iterative guided filtering

- Hae-Jong Seo
^{1}Email author and - Peyman Milanfar
^{2}

**2012**:3

https://doi.org/10.1186/1687-6180-2012-3

© Seo and Milanfar; licensee Springer. 2012

**Received: **23 June 2011

**Accepted: **6 January 2012

**Published: **6 January 2012

## Abstract

A practical problem addressed recently in computational photography is that of producing a good picture of a poorly lit scene. The consensus approach for solving this problem involves capturing two images and merging them. In particular, using a flash produces one (typically high signal-to-noise ratio [SNR]) image and turning off the flash produces a second (typically low SNR) image. In this article, we present a novel approach for merging two such images. Our method is a generalization of the guided filter approach of He et al., significantly improving its performance. In particular, we analyze the spectral behavior of the guided filter kernel using a matrix formulation, and introduce a novel iterative application of the guided filter. These iterations consist of two parts: a nonlinear anisotropic diffusion of the noisier image, and a nonlinear reaction-diffusion (residual) iteration of the less noisy one. The results of these two processes are combined in an unsupervised manner. We demonstrate that the proposed approach outperforms state-of-the-art methods for both flash/no-flash denoising, and deblurring.

## Keywords

## 1 Introduction

Recently, several techniques [1–5] to enhance the quality of flash/no-flash image pairs have been proposed. While the flash image is better exposed, the lighting is not soft, and generally results in specularities and unnatural appearance. Meanwhile, the no-flash image tends to have a relatively low signal-to-noise ratio (SNR) while containing the natural ambient lighting of the scene. The key idea of flash/no-flash photography is to create a new image that is closest to the look of the real scene by having details of the flash image while maintaining the ambient illumination of the no-flash image. Eisemann and Durand [3] used bilateral filtering [6] to give the flash image the ambient tones from the no-flash image. On the other hand, Petschnigg et al. [2] focused on reducing noise in the no-flash image and transferring details from the flash image to the no-flash image by applying joint (or cross) bilateral filtering [3]. Agrawal et al. [4] removed flash artifacts, but did not test their method on no-flash images containing severe noise. As opposed to a visible flash used by [2–4], recently Krishnan and Fergus [7] used both near-infrared and near-ultraviolet illumination for low light image enhancement. Their so-called "dark flash" provides high-frequency detail in a less intrusive way than a visible flash does even though it results in incomplete color information. All these methods ignored any motion blur by either depending on a tripod setting or choosing sufficiently fast shutter speed. However, in practice, the captured images under low-light conditions using a hand-held camera often suffer from motion blur caused by camera shake.

More recently, Zhuo et al. [5] proposed a flash deblurring method that recovers a sharp image by combining a blurry image and a corresponding flash image. They integrated a so-called flash gradient into a maximum-a-posteriori framework and solved the optimization problem by alternating between blur kernel estimation and sharp image reconstruction. This method outperformed many states-of-the-art single image deblurring [8–10] and color transfer methods [11]. However, the final output of this method looks somewhat blurry because the model only deals with a spatially invariant motion blur.

Others have used multiple pictures of a scene taken at different exposures to generate high dynamic range images. This is called multi-exposure image fusion [12] which shares some similarity with our problem in that it seeks a new image that is of better quality than any of the input images. However, the flash/no-flash photography is generally more difficult due to the fact that there are only a pair of images. Enhancing a low SNR no-flash image with a spatially variant motion blur only with the help of a single flash image is still a challenging open problem.

## 2 Overview of the proposed approach

*Z*) and a no-flash image (

*Y*; Figure 1). We treat these two images,

*Z*and

*Y*, as random variables. The task at hand is to generate a new image (

*X*) that contains the ambient lighting of the no-flash image (

*Y*) and preserves the details of the flash-image (

*Z*). As in [2], the new image

*X*can be decomposed into two layers: a base layer and a detail layer;

*Y*might be noisy or blurry (possibly both), and $\hat{Y}$ is an estimated version of

*Y*, enhanced with the help of

*Z*. Meanwhile, $\hat{Z}$ represents a nonlinear, (low-pass) filtered version of

*Z*so that $Z-\hat{Z}$ can provide details. Note that

*τ*is a constant that strikes a balance between the two parts. In order to estimate $\hat{Y}$ and $\hat{Z}$, we employ local linear minimum mean square error (LMMSE) predictors

^{a}which explain, justify, and generalize the idea of

*guided filtering*

^{b}as proposed in [1]. More specifically, we assumed that $\hat{Y}$ and $\hat{Z}$ are a liner (affine) function of

*Z*in a window

*ω*

_{ k }centered at the pixel

*k*:

*G*(·) is the guided filtering (LMMSE) operator, $\hat{{y}_{i}}$, $\hat{{z}_{i}}$,

*z*

_{ i }are samples of $\hat{Y}$, $\hat{Z}$,Z respectively, at pixel

*i*, and (

*a*,

*b*,

*c*,

*d*) are coefficients assumed to be constant in

*ωk*(a square window of size

*p*×

*p*) and space-variant. Once we estimate

*a*,

*b*,

*c*,

*d*, Equation 1 can be rewritten as

*z*

_{ i }. While it is not possible to estimate

*α*and

*β*directly from (equation (3); since they in turn depend on

*xi*), the coefficients

*α, β*can be expressed in terms of

*a*,

*b*,

*c*,

*d*which are optimally estimated from two different local linear models shown in Equation 2. Naturally, the simple linear model has its limitations in capturing complex behavior. Hence, we propose an iterative approach to boost its performance as follows:

*α*

_{ n },

*β*

_{ n }, and

*τ*

_{ n }are functions of the iteration number

*n*. A block-diagram of our approach is shown in Figure 2. The proposed method effectively removes noise and deals well with spatially variant motion blur without the need to estimate any blur kernel or to accurately register flash/no-flash image pairs when there is a modest displacement between them.

- (1)
We have provided a significantly expanded statistical derivation and description of the guided filter and its properties in Section 3 and Appendix.

- (2)

- (3)
We provide many more experimental results for both flash/no-flash denoising and de- blurring in Section 5.

- (4)
We describe the key ideas of diffusion and residual iteration and their novel relevance to iterative guided filtering in the Appendix.

- (5)
We prove the convergence of the proposed iterative estimator in the Appendix.

- (6)
As supplemental material, we share our project website

^{c}where flash/no-flash relighting examples are also presented.

In Section 3, we outline the guided filter and study its statistical properties. We describe how we actually estimate the linear model coefficients *a*, *b*, *c*, *d* and *α, β*, and we provide an interpretation of the proposed iterative framework in matrix form in Section 4. In Section 5, we demonstrate the performance of the system with some experimental results, and finally we conclude the article in Section 6.

## 3 The guided filter and its properties

*W*

_{ ij }computed from the guide (e.g., flash) image

*Z*to the more noisy (e.g., no-flash) image

*Y*. Specifically, the filter output sample $\hat{y}$ a pixel

*i*is computed as a weighted average

^{d}:

*W*

_{ ij }is a function of the guide image

*Z*, but is independent of

*Y*. The guided filter kernel

^{e}can be explicitly written as

*ω*| is the total number of pixels (=

*p*

^{2}) in

*ω*

_{ k },

*ε*is a global smoothing parameter, $E{\left[Z\right]}_{k}\approx \frac{1}{\left|\omega \right|}{\sum}_{l\in {\omega}_{k}}{z}_{l}$, and $\mathrm{var}{\left(Z\right)}_{k}\approx \frac{1}{\left|\omega \right|}\sum _{l\in {\omega}_{k}}{z}_{l}^{2}-E{\left[Z\right]}_{k}^{2}$. Note that

*W*

_{ ij }are normalized weights, that is, ∑

_{ j }W

_{ ij }(

*Z*) = 1 Figure 5 shows examples of guided filter weights in four different patches. We can see that the guided filter kernel weights neatly capture underlying geometric structures as do other data-adaptive kernel weights [6, 14, 15]. It is worth noting that the use of the specific form of the guided filter here may not be critical in the sense that any other data-adaptive kernel weights such as

*non-local means kernels*[16] and

*locally adaptive regression kernels*[15] could be used.

Next, we study some fundamental properties of the guided filter kernel in matrix form.

**y**is a column vector of pixels in

*Y*and ${\mathbf{w}}_{i}^{T}=\left[W\left(i,1\right),W\left(i,2\right),\dots ,\phantom{\rule{0.3em}{0ex}}W\left(i,N\right)\right]$ is a vector of weights for each

*i*. Note that

*N*is the dimension

^{f}of

**y**. Writing the above at once for all

*i*we have,

where **z** is a vector of pixels in *Z* and **W** is only a function of **z**. The filter output can be analyzed as the product of a matrix of weights **W** with the vector of the given the input image **y**.

The matrix **W** is symmetric as shown in Equation 8 and the sum of each row of **W** is equal to one (**W1**_{
N
} = **1**_{
N
} ) by definition. However, as seen in Equation 6, the definition of the weights does not necessarily imply that the elements of the matrix **W** are positive in general. While this is not necessarily a problem in practice, we find it useful for our purposes to approximate this kernel with a proper admissible kernel [17]. That is, for the purposes of analysis, we approximate **W** as a positive valued, symmetric positive definite matrix with rows summing to one, as similarly done in [18]. For the details, we refer the reader to the Appendix A.

*λ*

_{ i }(

*i*= 1, ...,

*N*) are real, and the largest eigenvalue of

**W**is exactly one (

*λ*

_{1}= 1), with corresponding eigenvector ${\mathbf{v}}_{1}=\left(1/\sqrt{N}\right){\left[1,1,\dots ,1\right]}^{T}=\left(1/\sqrt{N}\right){\mathbf{1}}_{N}$ as shown in Figure 6. Intuitively, this means that filtering by

**W**will leave a constant signal (i.e., a "flat" image) unchanged. In fact, with the rest of its spectrum inside the unit disk, powers of

**W**converge to a matrix of rank one, with identical rows, which (still) sum to one:

**u**1 summarizes the asymptotic effect of applying the filter

**W**many times. Figure 7 shows what a typical

**u**

_{1}looks like.

**w**

^{ T }) from

**W**'s powers in one patch of size 25 × 25. The vector was reshaped into an image for illustration purposes. We can see that powers of

**W**provide even better structure by generating larger (and more sophisticated) kernels. This insight reveals that applying

**W**multiple times can improve the guided filtering performance, which leads us to the iterative use of the guided filter. This approach will produce the evolving coefficients

*α*

_{ n },

*β*

_{ n }introduced in (4). In the following section, we describe how we actually compute these coefficients based on Bayesian mean square error (MSE) predictions.

## 4 Iterative application of local LMMSE predictors

^{g}

*a*

_{ k },

*b*

_{ k },

*c*

_{ k },

*d*

_{ k }in (3) are chosen so that "on average" the estimated value $\hat{Y}$ is close to the observed value of

*Y*(=

*y*

_{ i }) in

*ω*

_{ k }, and the estimated value $\hat{Z}$ is close to the observed value of

*Z*(=

*z*

_{ i }) in

*ω*

_{ k }. More specifically, we adopt a stabilized MSE criterion in the window

*ω*

_{ k }as our measure of closeness

^{h}:

*ε*

_{1}and

*ε*

_{2}are small constants that prevent ${\widehat{a}}_{k}$, ${\u0109}_{k}$ from being too large. Note that

*c*

_{ k }and

*d*

_{ k }become simply 1 and 0 by setting

*ε*

_{2}= 0. By setting partial derivatives of MSE(

*a*

_{ k },

*b*

_{ k }) with respect to

*a*

_{ k },

*b*

_{ k }, and partial derivatives of MSE(

*c*

_{ k },

*d*

_{ k }) with respect to

*c*

_{ k },

*d*

_{ k }, respectively, to zero, the solutions to minimum MSE prediction in (10) are

where we compute $E\left[Z\right]\approx \frac{1}{\left|\omega \right|}{\sum}_{l\in {\omega}_{k}}{z}_{l},E\left[Y\right]\approx \frac{1}{\left|\omega \right|}{\sum}_{l\in {\omega}_{k}}{y}_{l},E\left[ZY\right]\approx \frac{1}{\left|\omega \right|}{\sum}_{l\in {\omega}_{k}}{z}_{l}{y}_{l},E\left[{Z}^{2}\right]\approx \frac{1}{\left|\omega \right|}{\sum}_{l\in {\omega}_{k}}{z}_{l}^{2}$.

*ω*

_{ k }results in different predictions of these coefficients. Hence, one must compute an aggregate estimate of these coefficients coming from all windows that contain the pixel of interest. As an illustration, consider a case where we predict $\hat{{y}_{i}}$ using observed values of

*Y*in

*ω*

_{ k }of size 3 × 3 as shown in Figure 9. There are nine possible windows that involve the pixel of interest

*i*. Therefore, one takes into account all nine

*a*

_{ k },

*b*

_{ k }'s to predict $\hat{{y}_{i}}$. The simple strategy suggested by He et al. [1] is to average them as follows:

*Z*=

*z*

_{ i }is

The idea of using these averaged coefficients $\widehat{a}$, $\widehat{b}$ is analogous to the simplest form of aggregating multiple local estimates from overlapped patches in image denoising and super-resolution literature [19]. The aggregation helps the filter output look locally smooth and contain fewer artifacts.^{i} Recall that $\hat{{y}_{i}}$ and ${\widehat{z}}_{i}-{z}_{i}$ correspond to the base layer and the detail layer, respectively. The effect of the regularization parameters *ε*_{1} and *ε*_{2} is quite the opposite in each case in the sense that the higher *ε*_{2} is, the more detail through ${\widehat{z}}_{i}-{z}_{i}$ can be obtained; whereas the lower *ε*_{1} ensures that the image content in $\hat{Y}$ is not over-smoothed.

*p*is small and the underlying data have a simple pattern. However, the linear models are too simple to deal effectively with more complicated structures, and thus there is a need to use larger window sizes. As we alluded to earlier, the estimation of these linear coefficients in an iterative fashion can deal well with more complex behavior of the image content. More specifically, by initializing ${\widehat{x}}_{i,0}={y}_{i}$, Equation 3 can be updated as follows

where *n* is the iteration number and τ _{
n
} *>* 0 is set to be a monotonically decaying function^{k} of *n* such that ${\sum}_{n=1}^{\infty}{\tau}_{n}$ converges. Figure 3 shows an example to illustrate that the resulting coefficients at the 20th iteration predict the underlying data better than *α*_{1}, β_{1} do. Similarly, ${\hat{X}}_{20}$ improves upon ${\hat{X}}_{1}$ as shown in Figure 4. This iteration is closely related to *diffusion* and *residual iteration* which are two important methods [18] which we describe briefly below, and with more detail in Appendix.

**W**and

**W**

_{ d }are guided filter kernel matrices composed of the guided filter kernels

*W*and

*W*

_{ d }respectively.

^{l}Explicitly writing the iterations, we observe

*P*

_{ n }is a polynomial function of

**W**. The block-diagram in Figure 2 can be redrawn in terms of the matrix formulation as shown in Figure 10. The first term ${\widehat{\mathbf{y}}}_{n}$ in Equation 16 is called the diffusion process that enhances SNR. The net effect of each application of

**W**is essentially a step of anisotropic diffusion [20]. Note that this diffusion is applied to the no-flash image

**y**which has a low SNR. On the other hand, the second term ${\widehat{\mathbf{z}}}_{n}$ is connected with the idea of residual iteration [21]. The key idea behind this iteration is to filter the residual signals

^{m}to extract detail. We refer the reader to Appendix B and [18] for more detail. By effectively combining the diffusion and residual iteration [as in (16)], we can achieve the goal of flash/no-flash pair enhancement which is to generate an image somewhere between the flash image

**z**and the no-flash image

**y**, but of better quality than both.

^{ n }

## 5 Experimental results

In this section, we apply the proposed approach to flash/no-flash image pairs for denoising and deblurring. We convert images *Z* and *Y* from RGB color space to CIE Lab, and perform iterative guided filtering separately in each resulting channel. The final result is converted back to RGB space for display. We used the implementation of the guided filter [1] from the author's website.^{o} All figures in this section are best viewed in color.^{p}

### 5.1 Flash/no-flash denoising

#### 5.1.1 Visible flash [2]

^{q}. We compare our results with the method based on the joint bilateral filter [2] in Figures 11, 12, and 13. Our proposed method effectively denoised the no-flash image while transferring the fine detail of the flash image and maintaining the ambient lighting of the no-flash image. We point out that the proposed iterative application of the guided filtering in terms of diffusion and residual iteration yielded much better results than one application of either the joint bilateral filtering [2] or the guided filter [1].

#### 5.1.2 Dark flash [7]

*dark flash*method proposed in [7]. Let us call the dark flash image

*Z*. Dark flash may introduce shadows and specularities in images, which affect the results of both the denoising and detail transfer. We detect those regions using the same methods proposed by [2]. Shadows are detected by finding the regions where

*|Z*-

*Y|*is small, and specularities are found by detecting saturated pixels in

*Z*. After combining the shadow and specularities mask, we blur it using a Gaussian filter to feather the boundaries. By using the resulting mask, the output ${\hat{X}}_{n}$ at each iteration is alpha-blended with a low-pass filter version of

*Y*as similarly done in [2, 7]. In order to realize ambient lighting conditions, we applied the same mapping function to the final output as in [7]. Figures 14, 15, 16, 17, 18, and 19 show that our results yield better detail with less color artifacts than the results of [7].

### 5.2 Flash/no-flash deblurring

^{r}. Here, we show experimental results on a couple of flash/no-flash image pairs where no-flash images suffer from mild noise and strong motion blur. We compare our method with Zhuo et al. [5]. As shown in Figures 20, 21, 22, 23, and 24, our method outperforms the method by [5], obtaining much finer details with better color contrast even though our method does not estimate a blur kernel at all. The results by Zhuo et al. [5] tend to be somewhat blurry and distort the ambient lighting of the real scene. We point out that we only use a single blurred image in Figure 24 while Zhuo et al. [5] used two blurred images and one flash image.

## 6 Summary and future work

The guided filter has proved to be more effective than the joint bilateral filter in several applications. Yet we have shown that it can be improved significantly more still. We analyzed the spectral behavior of the guided filter kernel using a matrix formulation and improved its performance by applying it iteratively. Iterations of the proposed method consist of a combination of diffusion and residual iteration. We demonstrated that the proposed approach yields outputs that not only preserve fine details of the flash image, but also the ambient lighting of the no-flash image. The proposed method outperforms state-of-the-art methods for flash/no-flash image denoising *and* deblurring. It would be interesting to see if the performance of other nonparametric filer kernels such as bilateral filters and locally adaptive regression kernels [15] can be further improved in our iterative framework. It is also worthwhile to explore several other applications such as joint upsampling [22], image matting [23], mesh smoothing [24, 25], and specular highlight removal [26] where the proposed approach can be employed.

## Appendix

### Positive definite and symmetric row-stochastic approximation of W

**W**with a symmetric, positive definite, and row-stochastic matrix. First, as we mentioned earlier, the matrix

**W**can contain negative values as shown in Figure 3. We employ the Taylor series approximation (exp (

*t*) ≈ 1 +

*t*) to ensure that

**W**has both positive elements, and is positive-definite. To be more concrete, consider a simple example; namely, a local patch of size 5

*×*5 as follows:

*ω*

_{ k }of size

*|ω|*= 3

*×*3. Let $M\left({z}_{i},{z}_{j}\right)={\sum}_{k:\left(i,j\in {\omega}_{k}\right)}\frac{\left({z}_{i}-E{\left[Z\right]}_{k}\right)\left({z}_{j}-E{\left[Z\right]}_{k}\right)}{\mathsf{\text{var}}\phantom{\rule{1em}{0ex}}{\left(Z\right)}_{k+\epsilon}}$ in Equation 6. Then,

*W*centered at the index 13 can be written and approximated as follows:

**W**(composed of strictly positive elements now) to a doubly-stochastic, symmetric, positive definite matrix as again done in [18]. The algorithm we use to effect this approximation is due to Sinkhorn [27, 28], who proved that given a matrix with strictly positive elements, there exist diagonal matrices

**R**= diag(

**r**) and

**C**= diag(

**c**) such that

Furthermore, the vectors **r** and **c** are unique to within a scalar (i.e., *α* **r**, **c** */α*.) Sinkhorn's algorithm for obtaining **r** and **c** in effect involves repeated normalization of the rows and columns (see Algorithm 1 for details) so that they sum to one, and is provably convergent and optimal in the cross-entropy sense [29].

**Algorithm 1 Algorithm for scaling a matrix A to a nearby doubly-stochastic matrix**
$\widehat{\mathbf{A}}$

Given a matrix **A**, let (*N*, *N*) be size(**A**) and initialize **r** = ones(*N*, 1);

for *k* = 1 : *iter*;

**c** = 1./(**A**^{
T
}**r**);

**r** = 1./(**A c**);

end

**C** = diag(**c**); **R** = diag(**r**);

$\hat{\mathbf{A}}=\mathbf{R}\mathbf{A}\mathbf{C}$

### Diffusion and residual iteration

#### Diffusion

**W**is in effect equivalent to a nonlinear anisotropic

*diffusion*process [20, 30]. We define ${\widehat{\mathbf{y}}}_{0}=\mathbf{y}$, and

where $\stackrel{\u0304}{\mathbf{y}}$ is a scaled version of *by*, and therefore the left-hand side of the above is a discretization of the derivative operator $\frac{\partial \u0233\left(t\right)}{\partial t}$, and as detailed in [18], **W** - **I** is effectively the nonlinear Laplacian operator corresponding to the kernel in (6).

#### Residual iteration

An alternative to repeated applications of the filter **W** is to consider the *residual* signals, defined as the difference between the estimated signal and the measured signal. This results in a variation of the diffusion estimator which uses the residuals as an additional forcing term. The net result is a type of reaction-diffusion process [31]. In statistics, the use of the residuals in improving estimates has a rather long history, dating at least back to the study of Tukey [21] who termed the idea "twicing". More recently, the idea has been suggested in the applied mathematics community under the rubric of *Bregman* iterations [32], and in the machine learning and statistics literature [33] as *L*_{2}*-boosting*.

^{s}${\widehat{\mathbf{z}}}_{0}=\mathbf{W}\mathbf{z}$. With this definition, we write the iterated estimates as

where *F*_{
n
} is a polynomial function of **W** of order *n* + 1. The first iterate ${\widehat{\mathbf{z}}}_{1}$ is precisely the "twicing" estimate of Tukey [21].

### Convergence of the proposed iterative estimator

*P*

_{ n }is a polynomial function of

**W**. The first (direct diffusion) term in the iteration is clearly stable and convergent as described in (9). Hence, we need to show the stability of the second part. To do this, we note that the spectrum of

*P*

_{ n }can be written, and bounded in terms of the eigenvalues

*λ*

_{ i }of

**W**as follows:

where the inequality follows from the knowledge that 0 ≤ *λ*_{
N
} ≤ ... *λ*_{3} ≤ *λ*_{2} <*λ*_{1} = 1. Furthermore, in Section 4 we defined *τ*_{
n
} to be a monotonically decreasing sequence such that ${\sum}_{n=1}^{\mathrm{\infty}}{\tau}_{n}=c<\mathrm{\infty}$. Hence, all eigenvalues *λ*_{
i
} (*P*_{
n
} ) are upper bounded by the constant *c*, independent of the number of iterations *n*, ensuring the stability of the iterative process.

## End notes

^{a}More detail is provided in Section 4.

^{b}The guided filter [1] reduces noise while preserving edges as bilateral filter [6] does. However, the guided filter outperforms the bilateral filter by avoiding the gradient reversal artifacts that may appear in such applications as detail enhancement, high dynamic range (HDR) compression, and flash/no-flash denoising.

^{c}http://users.soe.ucsc.edu/~milanfar/research/rokaf/.html/IGF/.

^{d}$\widehat{\mathsf{\text{y}}}$ in Equation 2 can be rewritten in terms of filtering and we refer the reader to a supplemental material http://personal.ie.cuhk.edu.hk/~hkm007/eccv10/eccv10supp.pdf for derivation.

^{e}Cross (or joint) bilateral filter [2, 3] is defined in a similar way.

^{f}

*N*is different from the window size

*p*(

*N*≥

*p*).

^{g}Note that

*k*is used to clarify that the coefficients are estimated for the window

*ω*

_{ k }.

^{h}Shan et al. [8] recently proposed a similar approach for high dynamic range compression.

^{i}It is worthwhile to note that we can benefit from more adaptive way of combining multiple estimates of coefficients, but this subject is not treated in this article.

^{k}We use ${\tau}_{n}=\frac{1}{{n}^{2}}$ throughout the all experiments.

^{l}Recall

*W*in Equation 6. The difference between

*W*and

*W*

_{ d }lies in the parameter

*ε*as follows (

*ε*

_{2}

*> ε*

_{1}):

^{m} This is generally defined as the difference between the estimated signal $\hat{Z}$ and the measured signal *Z*, but in our context refers to the detail signal. ^{
n
} We refer the reader to Appendix C for proof of convergence of the proposed iterative estimator. ^{o}http://personal.ie.cuhk.edu.hk/~hkm007/. ^{p} We refer the reader to the project Website http://users.soe.ucsc.edu/~milanfar/research/rokaf/.html/IGF/. ^{q} The window size *p* for **W**_{
d
} and **W** was set to 21 and 5 respectively for all the denoising examples. ^{r} The window size *p* for **W**_{
d
} and **W** was set to 41 and 81, respectively, for the deblurring examples to deal with displacement between the flash and no-flash image. ^{s} Note that due to the use of residuals, this is a different initialization than the one used in the diffusion iterations.

## Declarations

### Acknowledgements

We thank Dilip Krishnan for sharing the post-processing code [7] for dark-flash examples. This study was supported by the AFOSR Grant FA 9550-07-01-0365 and NSF Grant CCF-1016018. This study was done while the first author was at the University of California.

## Authors’ Affiliations

## References

- He K, Sun J, Tang X: Guided image filtering.
*Proceedings of European Conference Computer Vision (ECCV)*2010.Google Scholar - Petschnigg G, Agrawala M, Hoppe H, Szeliski R, Cohen M, Toyama K: Digital photography with flash and no-flash image pairs.
*ACM Trans Graph*2004, 21(3):664-672.View ArticleGoogle Scholar - Eisemann E, Durand F: Flash photography enhancement via intrinsic relighting.
*ACM Trans Graph*2004, 21(3):673-678.View ArticleGoogle Scholar - Agrawal A, Raskar R, Nayar S, Li Y: Removing photography artifacts using gradient projection and flash-exposure sampling.
*ACM Trans Graph*2005, 24: 828-835. 10.1145/1073204.1073269View ArticleGoogle Scholar - Zhuo S, Guo D, Sim T: Robust flash deblurring.
*IEEE Conference on Computer Vison and Pattern Recognition*2010.Google Scholar - Tomasi C, Manduchi R: Bilateral Filtering for Gray and Color Images.
*Proceedings of the 1998 IEEE International Conference of Compute Vision Bombay, India*1998, 836-846.Google Scholar - Krishnan D, Fergus R: Dark flash photography.
*ACM Trans Graph*2009, 28(4):594-611.Google Scholar - Shan Q, Jia J, Brown MS: Globally optimized linear windowed tone-mapping.
*IEEE Trans Vis Comput Graph*2010, 16(4):663-675.View ArticleGoogle Scholar - Fergus R, Singh B, Hertsmann A, Roweis ST, Freeman WT: Removing camera shake from a single image.
*ACM Trans Graph (SIGGRAPH)*2006, 25: 787-794. 10.1145/1141911.1141956View ArticleGoogle Scholar - Yuan L, Sun J, Quan L, Shum HY: Progressive inter-scale and intra-scale non-blind image deconvolution.
*ACM Trans Graph*2008, 27(3):1-10.View ArticleGoogle Scholar - Tai YW, Jia J, Tang CK: Local color transfer via probabilistic segmentation by expectation-maximization.
*IEEE Conference on Computer Vison and Pattern Recognition*2005.Google Scholar - Hasinoff W:
*Variable-aperture photography.*PhD Thesis, Department of Computer Science, University of Toronto; 2008.Google Scholar - Seo H, Milanfar P: Computational photography using a pair of flash/no-flash images by iterative guided filtering.
*IEEE International Conference on Computer Vision (ICCV)*2011. SubmittedGoogle Scholar - Buades A, Coll B, Morel JM: A review of image denoising algorithms, with a new one.
*Multi-scale Model Simulat (SIAM)*2005, 4(2):490-530.MathSciNetView ArticleMATHGoogle Scholar - Takeda H, Farsiu S, Milanfar P: Kernel regression for image processing and reconstruction.
*IEEE Trans Image Process*2007, 16(2):349-366.MathSciNetView ArticleGoogle Scholar - Buades A, Coll B, Morel JM: Nonlocal image and movie denoising.
*Int J Comput Vis*2008, 76(2):123-139. 10.1007/s11263-007-0052-1View ArticleGoogle Scholar - Hofmann T, Scholkopf B, Smola AJ: Kernel methods in machine learning.
*Ann Stat*2008, 36(3):1171-1220. 10.1214/009053607000000677MathSciNetView ArticleMATHGoogle Scholar - Milanfar P: A tour of modern image processing.
*IEEE Signal Process Mag*2011. [http://users.soe.ucsc.edu/~milanfar/publications/journal/ModernTour_FinalSubmission.pdf]Google Scholar - Protter M, Elad M, Takeda H, Milanfar P: Generalizing the non-local-means to super-resolution reconstruction.
*IEEE Trans Image Process*2009, 18: 36-51.MathSciNetView ArticleGoogle Scholar - Perona P, Malik J: Scale-space and edge detection using anistropic diffusion.
*IEEE Trans Pattern Anal Mach Intell*1990, 12(9):629-639.View ArticleGoogle Scholar - Tukey JW:
*Exploratory Data Analysis*. Addison Wesley, Reading, MA; 1977.MATHGoogle Scholar - Kopf J, Cohen MF, Lischinski D, Uyttendaele M: Joint bilateral upsampling.
*ACM Trans Graph*2007, 26(3):96. 10.1145/1276377.1276497View ArticleGoogle Scholar - He K, Sun J, Tang X: Fast matting using large kernel matting Laplacian matrices.
*IEEE Conference on Computer Vision and Pattern Recognition (CVPR)*2010.Google Scholar - Fleishman S, Drori I, Cohen-Or D: Bilateral mesh denoising.
*ACM Trans Graph*2003, 22(3):950-953. 10.1145/882262.882368View ArticleGoogle Scholar - Jones T, Durand F, Desbrun M: Non-iterative feature preserving mesh smoothing.
*ACM Trans Graph*2003, 22(3):943-949. 10.1145/882262.882367View ArticleGoogle Scholar - Yang Q, Wang S, Ahuja N: Real-time specular highlight removal using bilateral filtering.
*ECCV*2010.Google Scholar - Knight PA: The Sinkhorn-Knopp algorithm: convergence and applications.
*SIAM J Matrix Anal Appl*2008, 30: 261-275. 10.1137/060659624MathSciNetView ArticleMATHGoogle Scholar - Sinkhorn R: A relationship between arbitrary positive matrices and doubly stochastic matrices.
*Ann Math Stat*1964, 35(2):876-879. 10.1214/aoms/1177703591MathSciNetView ArticleMATHGoogle Scholar - Darroch J, Ratcliff D: Generalized iterative scaling for log-linear models.
*Ann Math Stat*1972, 43: 1470-1480. 10.1214/aoms/1177692379MathSciNetView ArticleMATHGoogle Scholar - Singer A, Shkolinsky Y, Nadler B: Diffusion interpretation of nonlocal neighborhood filters for signal denoising.
*SIAM J Imaging Sci*2009, 2: 118-139. 10.1137/070712146MathSciNetView ArticleMATHGoogle Scholar - Cottet G, Germain L: Image processing through reaction combined with nonlinear diffusion.
*Math Comput*1993, 61: 659-673. 10.1090/S0025-5718-1993-1195422-2MathSciNetView ArticleMATHGoogle Scholar - Osher S, Burger M, Goldfarb D, Xu J, Yin W: An iterative regularization method for total variation-based image restoration.
*Multiscale Model Simulat*2005, 4(2):460-489. 10.1137/040605412MathSciNetView ArticleMATHGoogle Scholar - Buhlmann P, Yu B: Boosting with the
*L*_{2}loss: regression and classification.*J Am Stat Assoc*2003, 98(462):324-339. 10.1198/016214503000125MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.