# An adaptive bandwidth nonlocal means image denoising in wavelet domain

- Su Jeong You
^{1}and - Nam Ik Cho
^{1}Email author

**2013**:60

https://doi.org/10.1186/1687-5281-2013-60

© You and Cho; licensee Springer. 2013

**Received: **20 February 2013

**Accepted: **4 October 2013

**Published: **5 November 2013

## Abstract

This paper proposes a new wavelet domain denoising algorithm. In the results of conventional wavelet domain denoising methods, ringing artifacts or wavelet-shaped noises are sometimes observed due to thresholding of small but important coefficients or due to generation of large coefficients in flat areas. In this paper, nonlocal means filtering is applied to each subband of wavelet decomposition, which can keep small coefficients and does not generate unwanted large coefficients. Since the performance of nonlocal means filtering depends on the appropriate kernel bandwidth, we also propose a method to find global and local kernel bandwidth for each subband. In comparison with conventional methods, the proposed method shows lower PSNR than BM3D when pseudo white Gaussian noise is added, but higher PSNR than the spatial nonlocal means filtering and wavelet thresholding methods. For the mixture noise or Poisson noise, which may better explain the real noise from camera sensors, the proposed method shows better or comparable results than the state-of-the-art methods. Also, it is believed that the proposed method shows better subjective quality for the noisy images captured in the low-illumination conditions.

## Keywords

## Introduction

Denoising is one of the fundamental image processing problems and thus has been studied for a long time. To name a few of the existing methods that are related with our work and the state-of-the-art methods, there are wavelet shrinkage methods [1, 2], a total variation minimization [3], a prior probability modeling [4], nonlocal means filtering [5], and BM3D [6]. Among these, the BM3D generally shows the highest PSNR when the noise is additive white Gaussian.

In the case of wavelet domain thresholding methods [1, 2], an image is transformed into the wavelet domain, and the coefficients in each subband are suppressed by hard or soft thresholding. The advantage of wavelet shrinkage methods is that they require not much computations while providing pleasing results. The probabilistic wavelet coefficient modeling method [4] fits the neighborhoods of coefficients as Gaussian scale mixture (GSM) model and applies the Bayesian least squares (BLS) technique to adjust the coefficients. Although wavelet shrinkage methods and BLS-GSM provide relatively high PSNR improvement, shrinking or modifying wavelet coefficients sometimes bring ringing or wavelet-shaped artifacts. For example, wavelet transformation of a step edge generates small coefficients up to the highest subbands. Hence, when the small coefficients are removed by thresholding and are inverse transformed, then ringing artifacts arise due to the loss of high frequencies. In the case of probabilistic wavelet coefficient modeling, unwanted coefficients can be generated in the homogeneous region, which result in wavelet-shaped artifacts in the spatial domain. Another popular denoising method is the nonlocal means filtering [5], which substitutes a noisy pixel by the weighted sum of neighborhood pixels. The weights are determined based on the kernel density estimation, which can be regarded as a Nadaraya-Watson estimator, i.e., a kind of local constant regression [7]. In other words, the smooth kernel estimate in the nonlocal means approach is a sum of bumps placed on the data points. The kernel function determines the shape of the bumps, and the ‘smoothing parameter’ or ‘bandwidth’ controls the degree of smoothness. In [8], an automatic bandwidth selection method was proposed based on the reduction of entropy of image patterns, and the global bandwidth was applied to the overall area of image. However, it is noted that narrower kernels are suitable for the complex regions, whereas larger kernels would be better for more sparse areas. Hence, it is important to find an appropriate bandwidth according to the local characteristics, which is not an easy task. One of the main factors that strongly influence the local properties of the image is the noise statistics in the neighborhood, and thus, the bandwidth needs to be adaptively determined according to the local noise variance. In summary, we need to estimate the local noise statistics for finding an appropriate bandwidth for the given region. There are many methods for estimating the variance of white additive noise in images, but they cannot be used for the images with non-uniform noise variance. In this consideration, the estimation of local noise statistics is necessary to find the appropriate bandwidth for the given area.

In this paper, inspired by the performance of nonlocal means filtering method in keeping the structures of the image while suppressing the noise, we attempt to apply the nonlocal means filter to the wavelet coefficients. The wavelet coefficients contain the information on the structures of the image, which have different but related characteristics depending on the subbands. This property has been extensively and effectively exploited in many image processing applications, including denoising. However, as stated previously, manipulation of wavelet coefficients sometimes brings ringing artifacts and wavelet-shaped noise. Hence, instead of thresholding or generating the wavelet coefficients, we filter the coefficients based on the nonlocal means approach. This approach keeps small but important wavelet coefficients which would have been thresholded in the conventional schemes and also does not generate large coefficients in homogeneous regions while effectively suppressing noisy ones. In applying the nonlocal means filter, determining the bandwidth is also an important factor for successful filtering. Hence, we also propose a method that gives different bandwidths to each subband and region, depending on its properties and noise statistics.

The experiments are conducted with various types of pseudo noises and also with real noise that is observed in the images taken in low-illumination conditions. It is shown that the proposed method gives lower PSNR than the state-of-the-art methods such as BM3D [6] and BLS-GSM [4] when the white Gaussian noise is added. However, it gives higher PSNR than the conventional wavelet shrinkage methods and the spatial nonlocal means filtering method. Also, it gives higher PSNR than BM3D when the noise is a mixture of Gaussian and impulsive noises and when the noise model is Poisson which better explains the real noise from CCD/CMOS sensors [9]. For the experiments with real noise, images taken under low-illumination conditions and film images are denoised by various denoising methods. Subjective comparison shows that the wavelet domain nonlocal means filtering provides competitive results for real noises, which supports the simulation results with non-Gaussian noises.

The rest of this paper is organized as follows. In the second section, we review the nonlocal means filter and its bandwidth parameter estimation. In the third section, we propose the extension of nonlocal means filter to the wavelet domain denoising with the bandwidth selection method. Then, we show some experimental results on the images degraded by various pseudo noise and the images with real noise. The last section concludes this paper.

## Related works

### Nonlocal means filter

*y*(

*i*) =

*u*(

*i*) +

*n*(

*i*), where

*y*(

*i*),

*u*(

*i*), and

*n*(

*i*) are the noisy observation, original image, and the noise, respectively, at the

*i*th pixel. Also, we define

*N*

_{ i }and

*S*

_{ i }as a square neighborhood and a square search window centered at the pixel

*i*, respectively. Then, the nonlocal means filter can be described as [5]

where **Y**
_{
i
} represents the vector of pixel intensities in *N*
_{
i
}, $Z\left(i\right)=\sum _{j\in {S}_{i}}{e}^{-\frac{\parallel {\mathbf{Y}}_{i}-{\mathbf{Y}}_{j}{\parallel}^{2}}{{h}^{2}}}$ is a normalizing factor, and *h* is the smoothing kernel width which controls the degree of averaging. The denoised pixel $\xfb\left(i\right)$ is obtained by locally weighted averaging, which corresponds to the Nadaraya-Watson estimator [10]. From Equation (1), it can be seen that a small *h* shrinks the area of averaging, and thus, the noise is not suppressed enough. Conversely, if *h* is too large, the weights at the boundary of *S*
_{
i
} are also very large, which results in a blurry output. In the conventional work [5], *h* is set between 10*σ* and 15*σ*, where the noise standard deviation *σ* is estimated from the image statistics.

### Bandwidth selection

*h*is selected to minimize the error between the estimate and true density. For this purpose, the mean square error (MSE) at a point

*x*is defined as [7]

where *p*
_{KDE}(*x*) is the kernel density estimate of true density *p*(*x*), at a point *x*. This shows that there is a tradeoff between the bias and variance, which also means that a large bandwidth reduces the variance of the estimator but increases the bias and vice versa.

There have been several approaches to bandwidth estimation [11], which include *subjective choice* based on the asymptotic mean squared error, *cross-validation methods* using pseudo-likelihood maximization by the leave-one-out criterion, and *plug-in estimator* based on the asymptotically best choice of *h*. Also, the existing methods can be categorized as global or local bandwidth adjustment, where the local adaptivity gives better performance but requires heavy computational burden.

### Wavelet denoising

Thus, instead of thresholding or making probabilistic decision, bilateral filtering of wavelet coefficients is shown to provide competitive results [12]. In our previous work [13], we have also shown that the wavelet domain nonlocal means filter provides higher PSNR than the spatial domain nonlocal means filtering. In this paper, we improve the performance by finding the locally adaptive bandwidth for each subband and region, whereas the previous work applied global bandwidth. In addition, we test the algorithm for various kinds of noise model such as mixture noise or Poisson noise, which better explains the real camera noise. Also, it is tested on real noises that arise in the low-illumination conditions and film grain noise.

## Wavelet domain nonlocal means filter with adaptive bandwidth

The main idea of our work is to apply the nonlocal means filtering to scaling and wavelet coefficients of an image to keep small but important coefficients which might have been shrunk in conventional wavelet denoising. Another contribution is the derivation of global and local bandwidth for the wavelet-domain nonlocal means filtering, according to the subband’s statistics. It is noted that each subband has different noise statistics which may also vary depending on the location in each band. Hence, for each subband, we first find a global bandwidth that can be applied to the overall subband, based on the plug-in method [14]. Then, from Abramson’s rule [15] using the statistics derived in this process, we also find the locally adaptive bandwidth in each subband.

*x*is formulated as

*x*(

*i*) is a neighboring point to

*x*,

*n*is the number of neighbors,

*K*(·) is the kernel function, and

*h*is its bandwidth. The kernel function can be considered a weighting factor that gives larger value when

*x*(

*i*) is close to

*x*, and

*h*is also called the smoothing constant. A typical shape of kernel function is Gaussian, and the bandwidth

*h*determines its width and thus smoothing factor in estimating the kernel density. To obtain the globally optimal bandwidth for the given data, denoted as

*h*

_{go}, the conventional method is to find the

*h*that minimizes the mean integrated squared error (MISE) between ${\widehat{f}}_{h}\left(x\right)$ defined above and the true but unknown density

*f*(

*x*) as [7]

*M*is the number of sample data in the subband. Note that ∥

*f*

^{′′}∥

^{2}is the only unknown term in Equation (5), and the idea behind the plug-in approach is to replace

*f*

^{′′}by an estimate from the data. Silverman’s rule of thumb [16] computes

*f*

^{′′}as if

*f*had the density of the normal distribution

*N*(

*μ*,

*σ*

^{2}) and then the optimal global bandwidth for the subband can be approximated as

**r**= {

*r*

_{1},

*r*

_{2},…,

*r*

_{∣X∣}} is the set of residuals of the entire wavelet coefficients in the subband, and |

*X*| is the total number of coefficients in the subband. The residual

*r*

_{ i }is defined as

where *i* is the index for the pixel position (*m*,*n*), and *X*
_{
m,n
} is the wavelet coefficient at that position. The residual can be considered a prediction error of *X*(*m*,*n*) by its neighboring data, and the median operation over the residuals as Equation (7) gives approximated standard deviation of data. In summary, we estimate the noise standard deviation by Equation (7) for each subband and then the nonlocal means filter with the bandwidth in Equation (6) can be applied to the given subband.

*h*

_{go}to the overall subband. For the derivation of locally adaptive bandwidth, let us denote the

*i*th wavelet coefficient in the

*l*th subband as

where *α*
_{
l
}(*i*) denotes a noise-free coefficient, and *ε*
_{
l
}(*i*) denotes a random variable assumed to be $N(0,{\sigma}_{{\epsilon}_{l}}^{2}(i\left)\right)$. When there seems to be no confusion, we will drop the indexes and subscripts of the above notation in the rest of the paper.

*L*×

*L*coefficients centered at a pixel of interest. This requires a hypothesis test for determining whether a coefficient

*X*is a noise coefficient or not and then we compute the variance of the noise coefficients within the

*L*×

*L*window. Here, the hypothesis test follows the algorithm in probabilistic wavelet shrinkage [18]. To be precise, we first model the wavelet coefficient as a sample of generalized Gaussian random variable with the probability density function

*λ*> 0 is the scale parameter, and

*ν*is the shape parameter. To test whether a given

*X*is a noise coefficient or not, we test its significance by binary hypothesis test:

*H*

_{0}is the hypothesis that

*X*is a noise coefficient, and

*H*

_{1}is a significant one. To assess the hypothesis, we use the Bayes’ rule, where it is assumed that a prior is known, and its parameters are random variables. The Bayes’ rule produces the conditional probability

*P*(

*H*

_{1}|

*X*) =

*μ*

*η*/(1 +

*μ*

*η*), where

*μ*=

*P*(

*H*

_{1})/

*P*(

*H*

_{0}),

*η*=

*f*

_{ G }(

*X*|

*H*

_{1})/

*f*

_{ G }(

*X*|

*H*

_{0}), and the product

*μ*

*η*defines the generalized likelihood ratio. From the assumption of generalized Gaussian prior and the Bayes’ rule, the estimate of the true coefficient is represented as

which is a simple shrinkage rule for the given wavelet coefficient under the hypothesis test. We use $P\left({H}_{1}\right|X)=\frac{\mu \eta}{1+\mu \eta}$ as a measure to decide the noisy coefficients.

*f*

_{ G }(

*X*|

*H*

_{0}) and the noise-free coefficients

*f*

_{ G }(

*X*|

*H*

_{1}) are defined as the following convolutions [18]:

*ϕ*(

*X*;

*σ*) is the zero mean Gaussian density, and the standard deviation

*σ*is computed as Equation (7). The hypothesis test is to define an element as a significant one when it is larger than a threshold and vice versa, and thus the conditional densities are defined as

*B*

_{0}and

*B*

_{1}are the normalizing constants as

*λ*and

*ν*are determined by the noise statistics in each band. To be precise, let

*σ*

_{ X }be the variance of the overall coefficients in the subband,

*m*

_{4,X }be their fourth moment, and

*σ*

_{ α }be the standard deviation of noise-free coefficients in the band. Then, from [19],

*ν*and

*λ*are found from the equations as follows:

*ν*can be derived numerically, and it is used for computing

*λ*from the right equation above. The next step is to compute

*P*(

*H*

_{0}) and

*P*(

*H*

_{1}) as [18]:

where ${\Gamma}_{\text{inc}}(x,a)=\frac{1}{\Gamma \left(a\right)}\underset{0}{\overset{x}{\int}}{t}^{a-1}\stackrel{-t}{\text{exp}}\mathit{\text{dt}}$ is the *incomplete gamma function*.

*T*

_{ α }. If

*P*(

*H*

_{1}|

*X*) <

*T*

_{ α }, then the corresponding coefficient is considered a noisy one. For all the coefficients that are determined to be noisy in the

*L*×

*L*window, the local noise variance ${\widehat{\sigma}}_{\text{lo}}$ is estimated, and in the same manner as

*h*

_{go}in Equation (6) is derived, the local bandwidth is determined as

*L*

_{lo}is the number of noise coefficients in the

*L*×

*L*window centered at

*X*

_{ i }. In summary, Figure 2 shows the block diagram of overall process of the proposed method, and the algorithm is summarized as follows:

### Algorithm 1 Summary of wavelet domain denoising

## Experimental results

Summarizing the experimental results in advance, the proposed method yields higher PSNR than the spatial nonlocal means filtering and conventional wavelet shrinkage methods. However, it shows lower PSNR than the BM3D for the denoising of images corrupted by additive pseudo white Gaussian noise. A recent wavelet domain approach, BLS-GSM, also gives quite high PSNR, slightly less than BM3D. However, for more complex noise models such as mixture of impulsive and Gaussian, uniform noise, or Poisson noise that better explains the real camera noise, the proposed method yields higher PSNR and better subjective quality than the above referenced methods. Also, it is believed that the proposed method yields subjectively better output for the real noise, especially the noises that are often observed in the images taken under low-illumination conditions.

*db*8 filters in MATLAB is used for one-level multiresolution analysis. The window size centered at a wavelet coefficient is 21×21, and the threshold

*T*

_{ α }for classifying a noise coefficient is set as 0.3. In the experiments with the pseudo Gaussian noise, the images are artificially corrupted by the addition of noise with standard deviation,

*σ*= 20 and 30. The proposed method is compared with several state-of-the-art algorithms, and the results are summarized in Tableف1. It can be seen that the BM3D provides the best PSNR for the white Gaussian noise, the proposed method gives the second best PSNR in Barbara, and the BLS-GSM shows the second best PSNR for the rest.

**Denoising performances (dB) of various methods for the pseudo white Gaussian noise**

Denoising |
σ
| Barbara | Lena | Hill | Peppers |
---|---|---|---|---|---|

method | 512 | 512 | 512 | 256 | |

Nonlinear | 20 | 25.79 | 30.55 | 29.07 | 28.87 |

TV[3] | 30 | 23.96 | 26.37 | 25.84 | 25.76 |

Nonlocal | 20 | 28.78 | 31.01 | 29.16 | 29.86 |

means[5] | 30 | 26.65 | 29.22 | 27.26 | 27.53 |

Prob | 20 | 29.30 | 31.80 | 29.65 | 29.80 |

shrink[18] | 30 | 27.02 | 29.96 | 27.96 | 27.66 |

Multi. bi. | 20 | 27.25 | 30.10 | 28.82 | 28.52 |

[12] | 30 | 25.20 | 27.60 | 26.78 | 26.20 |

BLS- | 20 | 29.08 | 32.24 | 30.10 | 30.56 |

GSM [4] | 30 | 26.78 | 30.45 | 28.51 | 28.52 |

BM3D | 20 | 31.77 | 33.05 | 30.71 | 31.28 |

[6] | 30 | 29.81 | 31.26 | 29.15 | 29.28 |

Proposed | 20 | 30.27 | 31.67 | 29.78 | 29.19 |

method | 30 | 28.27 | 29.47 | 28.02 | 27.62 |

**Denoising performances (dB) of various methods for the mixed noise, additive non-Gaussian noise, and Poisson noise**

Image | Noise | Noisy | BLS- | BM3D | Poisson NL | Proposed |
---|---|---|---|---|---|---|

PSNR | GSM [4] | [6] | [21] | method | ||

Barbara | 20% impulse noise | 18.42 | 22.14 | 25.50 | 20.36 | 28.23 |

Lena | 20% impulse noise + Gaussian ( | 17.98 | 22.06 | 25.27 | 20.36 | 28.92 |

Boat | 10% impulse noise + Gaussian ( | 18.14 | 22.15 | 24.85 | 24.10 | 27.85 |

Boat | 10% impulse noise + 10% uniform noise | 11.95 | 27.38 | 30.50 | 20.48 | 29.60 |

Barbara | Poisson noise, | 16.95 | 19.13 | 17.82 | 27.04 | 26.56 |

Lena | Poisson noise, | 16.33 | 19.22 | 19.46 | 29.38 | 28.54 |

Boat | Poisson noise, | 15.95 | 18.44 | 18.45 | 26.70 | 26.54 |

Finally, we have also performed experiments changing the decomposition levels and kind of wavelet filters. About the decomposition level, the maximum PSNR was attained for the 1-level decomposition as in our experiment. Further decomposition does not improve the gain because the lower- and mid-band images become small, and thus, there are not enough patches to be used for smoothing the data. In the case of experiments on different kinds of wavelet filters, there was not much difference in the PSNR gain. It is believed that the denoising effect is not much affected by the shape of the coefficients which differs depending on the given wavelet filters as long as the coefficients are effectively denoised.

## Conclusion

We have proposed a new image denoising algorithm based on nonlocal means filtering in the wavelet domain. By the nonlocal means filtering, small wavelet coefficients that constitute an important image structure are well preserved, while noisy coefficients are suppressed. Since the local adaptation of the kernel bandwidth gives better results, we have also proposed a method to find the appropriate kernel bandwidth to each region for the effective nonlocal means filtering. As a result, the proposed method provides comparable or sometimes higher PSNR than the state-of-the-art algorithms. Also, subjective comparisons show that the proposed method keeps the structures of the images very well and gives less ringing artifacts.

## Declarations

### Acknowledgements

We appreciate anonymous reviewers for their valuable comments and helpful suggestions. This research was supported by Samsung Electronics and supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (2009-0083495).

## Authors’ Affiliations

## References

- Donoho DL, Johnstone IM: Ideal spatial adaptation by wavelet shrinkage.
*Biometrika*1994, 81: 425-445. 10.1093/biomet/81.3.425MathSciNetView ArticleMATHGoogle Scholar - Chang SG, Yu B, Vetterli M: Adaptive wavelet thresholding for image denoising and compression.
*IEEE Trans. Image Process*2000, 9(9):1532-1546. 10.1109/83.862633MathSciNetView ArticleMATHGoogle Scholar - Rudin LI, Osher S, Fatemi E: Nonlinear total variation based noise removal algorithms.
*Phys. D*1992, 60: 259-268. 10.1016/0167-2789(92)90242-FView ArticleMathSciNetMATHGoogle Scholar - Portilla J, Strela V, Wainwright M, Simoncelli E: Image denoising using scale mixtures of Gaussians in the wavelet domain.
*IEEE Trans. Image Process*2003, 12(11):1338-1351. 10.1109/TIP.2003.818640MathSciNetView ArticleMATHGoogle Scholar - Buades A, Coll B, Morel JM: A non-local algorithm for image denoising.
*CVPR*2005, 2: 60-65.MATHGoogle Scholar - Dabov K, Foi A, Katkovnik V: Image denoising by sparse 3-D transform-domain collaborative filtering.
*IEEE Trans. Image Proc*2007, 16(8):2080-2095.MathSciNetView ArticleGoogle Scholar - Wand M, Jones M:
*Kernel Smoothing*. Chapman and Hall, London, UK; 1995.View ArticleMATHGoogle Scholar - Awate SP, Whitakerl RT: Unsupervised, information-theoretic, adaptive image filtering for image restoration.
*IEEE Trans. Pattern Anal. Mach. Intell*2006, 28(3):364-376.View ArticleGoogle Scholar - Alter F, Matsushita Y, Tang X: An intensity similarity measure in low-light conditions. In
*Proceeding of European Conference on Computer Vision*. Edited by: Leonardis A, Bischof H, Pinz A. Springer, Berlin; 2006:267-280.Google Scholar - Chu CK, Marron JS: Choosing a kernel regression estimator.
*Stat. Sci*1992, 6: 404-436.MathSciNetView ArticleMATHGoogle Scholar - Jones MC, Marron JS, Sheather SJ: A brief survey of bandwidth selection for density estimation.
*J. Am. Stat. Assoc*1996, 91(3):401-407.MathSciNetView ArticleMATHGoogle Scholar - Zhang M, Gunturk BK: Multiresolution bilateral filtering for image denoising.
*IEEE Trans. Image Process*2008, 17(12):2324-2333.MathSciNetView ArticleGoogle Scholar - You SJ, Cho NI: A new image denoising method based on the wavelet domain nonlocal means filtering. In
*Proceeding of the International Conference on Acoustics, Speech, and Signal Processing*. Czech Republic, Prague; 22–27 May 2011.Google Scholar - Sheather SJ, Jones MC: A reliable data-based bandwidth selection method for kernel density estimation.
*J. R. Stat. Soc. Series B*1991, 53(3):683-690.MathSciNetMATHGoogle Scholar - Abramson I: On bandwidth variation in kernel estimates—a square root law.
*Ann. Stat*1982, 10: 1217-1223. 10.1214/aos/1176345986MathSciNetView ArticleMATHGoogle Scholar - Silverman BW: Monographs on Statistics and Applied Probability: Density Estimation for Statistics and Data Analysis. Chapman and Hall, London);Google Scholar
- Black MJ, Sapiro G: Edges as outliers: anisotropic smoothing using local image statistics. In
*Scale-Space Theories in Computer Vision, Second Int. Conf.*. Edited by: Nielsen M, Johansen P, Olsen OF, Weickert J. (Springer, Berlin; 1999:259-270.View ArticleGoogle Scholar - Pizurica A, Philips W: Estimating the probability of the presence of a signal of interest in multiresolution single- and multiband image denoising.
*IEEE Trans. Image Process*2006, 15(3):654-665.View ArticleGoogle Scholar - Simoncelli EP, Adelson EH: Noise removal via Bayesian wavelet coring.
*Int. Con. Image Proc*1996, 1: 379-382.Google Scholar - Hirakawa K, Parks TW: Joint demosaicing and denoising.
*IEEE Trans. Image Proc*2006, 15(8):2146-2157.View ArticleGoogle Scholar - Deledalle C, Tupin F, Denis L: Poisson NL means: unsupervised non local means for Poisson noise. In
*Proceeding of the International Conference on Image Processing*. Hong Kong; 26–29 Sept 2010.Google Scholar - Luisier F, Blue T, Parks TW: Image denoising in mixed poisson-Gaussian noise.
*IEEE Trans. Image Proc*2011, 20(3):696-708.View ArticleMathSciNetGoogle Scholar - Liu C: The image database. . Accessed Jan 2010 http://people.csail.mit.edu/celiu/

## 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.