Abstract
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonetheless, the role of the underlying graph structure is still not well understood. On the one hand there are pairwise structures where each node is connected to its local neighbors. These models tend to allow for fast algorithms but do not capture important higher-order statistics of natural scenes. On the other hand there are more powerful models such as Field of Experts (FoE) that consider joint distributions over larger cliques in order to capture image statistics but are computationally challenging. In this paper we consider a graph structure with longer range connections that is designed to both capture important image statistics and be computationally efficient. This structure incorporates long-range connections in a manner that limits the cliques to size 3, thereby capturing important second-order image statistics while still allowing efficient optimization due to the small clique size. We evaluate our approach by testing the models on widely used datasets. The results show that our method is comparable to the current state-of-the-art in terms of PSNR, is better at preserving fine-scale detail and producing natural-looking output, and is more than an order of magnitude faster.
Chapter PDF
Similar content being viewed by others
References
Roth, S., Black, M.J.: Fields of experts: A Framework for Learning Image Priors. In: CVPR (2005)
Besag, J.E.: Spatial interaction and the statistical analysis of lattice systems. J. Royal Stat. Soc. B 36(2) (1974)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. PAMI 6(6), 721–741 (1984)
Szeliski, R.: Bayesian modeling of uncertainty in low-level vision. IJCV 5(3) (1990)
Lan, X., Roth, S., Huttenlocher, D.P., Black, M.J.: Efficient belief propagation with learned higher-order Markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951. Springer, Heidelberg (2006)
Tappen, M.F.: Utilizing variational optimization to learn Markov random fields. In: CVPR (2007)
Murphy, K., Weiss, Y., Jordan, M.: Loopy belief propagation for approximate inference: An empirical study. In: UAI (1999)
Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI 28(10) (2006)
Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on (hyper)trees: Message-passing and linear programming approaches. Technical Report UCB/CSD-03-1269, EECS, UC Berkeley (2003)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: ICCV (1999)
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M.F., Rother, C.: A comparative study of energy minimization methods for Markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951. Springer, Heidelberg (2006)
Lafferty, J., McCallum, A., Pereira, F.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: ICML (2001)
Roth, S., Black, M.J.: Steerable random fields. In: ICCV (2007)
Tappen, M.F., Liu, C., Adelson, E.H., Freeman, W.T.: Learning gaussian conditional random fields for low-level vision. In: CVPR (2007)
Geman, S., Graffigne, C.: Markov random field image models and their applications to computer vision. In: Intl. Congress of Mathematicians (1986)
Weiss, Y., Freeman, W.F.: What makes a good model of natural images? In: CVPR (2007)
Gimel’farb, G.L.: Texture modeling by multiple pairwise pixel interactions. PAMI 18(11) (1996)
Hinton, G.E.: Training products of experts by minimizing contrastive divergence. Neur. Comput. 14(8) (2002)
Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized belief propagation. In: NIPS (2000)
Scharstein, D., Pal, C.: Learning conditional random fields for stereo. In: CVPR (2007)
Collins, M.: Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In: EMNLP (2002)
Sutton, C., McCallum, A.: Piecewise training of undirected models. In: UAI (2005)
Sutton, C., Minka, T.: Local training and belief propagation. Technical Report TR-2006-121, Microsoft Research (2006)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: ICCV (2001)
Huang, J., Mumford, D.: Statistics of natural images and models. In: CVPR (1999)
Freeman, W.T., Pasztor, E.C., Carmichael, O.T.: Learning low-level vision. IJCV 40(1) (2000)
Srivastava, A., Lee, A., Simoncelli, E., Zhu, S.: On advances in statistical modeling of natural images. Journal of Mathematical Imaging and Vision (2003)
Nocedal, J.: Updating quasi-newton matrices with limited storage. Mathematics of Computation 35, 773–782 (1980)
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. IJCV 70(1) (2006)
Portilla, J.: Blind non-white noise removal in images using gaussian scale mixtures in the wavelet domain. In: Benelux Signal Processing Symposium (2004)
Portilla, J., Strela, V., Wainwright, M.J., Simoncelli, E.P.: Image denoising using scale mixtures of gaussians in the wavelet domain. IEEE Trans. Imag. Proc. 12(11) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Huttenlocher, D.P. (2008). Sparse Long-Range Random Field and Its Application to Image Denoising. In: Forsyth, D., Torr, P., Zisserman, A. (eds) Computer Vision – ECCV 2008. ECCV 2008. Lecture Notes in Computer Science, vol 5304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88690-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-88690-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88689-1
Online ISBN: 978-3-540-88690-7
eBook Packages: Computer ScienceComputer Science (R0)