Abstract
Image priors are of great importance in image restoration tasks. These problems can be addressed by decomposing the degraded image into overlapping patches, treating the patches individually and averaging them back together. Recently, the Expected Patch Log Likelihood (EPLL) method has been introduced, arguing that the chosen model should be enforced on the final reconstructed image patches. In the context of a Gaussian Mixture Model (GMM), this idea has been shown to lead to state-of-the-art results in image denoising and debluring. In this paper we combine the EPLL with a sparse-representation prior. Our derivation leads to a close yet extended variant of the popular K-SVD image denoising algorithm, where in order to effectively maximize the EPLL the denoising process should be iterated. This concept lies at the core of the K-SVD formulation, but has not been addressed before due the need to set different denoising thresholds in the successive sparse coding stages. We present a method that intrinsically determines these thresholds in order to improve the image estimate. Our results show a notable improvement over K-SVD in image denoising and inpainting, achieving comparable performance to that of EPLL with GMM in denoising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharon, M., Elad, M., Bruckstein, A.M.: K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Transactions on Signal Process 54(11), 4311–4322 (2006)
Bruckstein, A.M., Donoho, D.L., Elad, M.: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images. SIAM Review 51(1), 34–81 (2009)
Buades, A., Coll, B., Morel, J.M.: A non-local algorithm for image denoising. In: Conference on Computer Vision and Pattern Recognition (CVPR), pp. 60–65. IEEE (2005)
Dabov, K., Foi, A., Katkovnik, V., Egiazarian, K.: Image denoising with block-matching and 3D filtering. In: Proc. SPIE-IS&T Electron. Imaging, vol. 6064, pp. 1–12 (2006)
Donoho, D., Elad, M., Temlyakov, V.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory 52(1), 6–18 (2006)
Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process. 15(12), 3736–3745 (2006)
Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online Dictionary Learning for Sparse Coding. In: 26th International Conference on Machine Learning, Montreal, Canada (2009)
Mairal, J., Bach, F., Sapiro, G.: Non-local Sparse Models for Image Restoration. In: 12th IEEE International Conference on Computer Vision, vol. 2, pp. 2272–2279 (2009)
Mairal, J., Elad, M., Sapiro, G., Member, S.: Sparse Representation for Color Image Restoration. IEEE Transactions of Image Processing 17(1), 53–69 (2008)
Portilla, J., Strela, V., Wainwright, M.J., Simoncelli, E.P.: Image denoising using scale mixtures of Gaussians in the wavelet domain. IEEE Transactions on Image Processing 12(11), 1338–1351 (2003)
Romano, Y., Protter, M., Elad, M.: Single Image Interpolation via Adaptive Non-Local Sparsity-Based Modeling. IEEE Transactions on Image Processing 23(7), 3085–3098 (2014)
Roth, S., Black, M.J.: Fields of Experts. International Journal of Computer Vision 82(2), 205–229 (2009)
Rubinstein, R., Zibulevsky, M., Elad, M.: Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit. Tech. - Comput. Sci. Dep. - Technical Report, pp. 1–15 (2008)
Tropp, J.: Greed is Good: Algorithmic Results for Sparse Approximation. IEEE Transactions on Information Theory 50(10), 2231–2242 (2004)
Weiss, Y., Freeman, W.T.: What makes a good model of natural images? In: 2007 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE (June 2007)
Zoran, D., Weiss, Y.: From learning models of natural image patches to whole image restoration. In: 2011 International Conference on Computer Vision (ICCV), pp. 479–486 (November 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sulam, J., Elad, M. (2015). Expected Patch Log Likelihood with a Sparse Prior. In: Tai, XC., Bae, E., Chan, T.F., Lysaker, M. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2015. Lecture Notes in Computer Science, vol 8932. Springer, Cham. https://doi.org/10.1007/978-3-319-14612-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-14612-6_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14611-9
Online ISBN: 978-3-319-14612-6
eBook Packages: Computer ScienceComputer Science (R0)