Training an Active Random Field for Real-Time Image Denoising
The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
Many computer vision problems can be formulated in a Bayesian framework based on Markov random fields (MRF) or conditional random fields (CRF). Generally, the MRF/CRF model is learned independently of the inference algorithm that is used to obtain the final result. In this paper, we observe considerable gains in speed and accuracy by training the MRF/CRF model together with a fast and suboptimal inference algorithm. An active random field (ARF) is defined as a combination of a MRF/CRF based model and a fast inference algorithm for the MRF/CRF model. This combination is trained through an optimization of a loss function and a training set consisting of pairs of input images and desired outputs. We apply the ARF concept to image denoising, using the Fields of Experts MRF together with a 1-4 iteration gradient descent algorithm for inference. Experimental validation on unseen data shows that the ARF approach obtains an improved benchmark performance as well as a 1000-3000 times speedup compared to the Fields of Experts MRF. Using the ARF approach, image denoising can be performed in real-time, at 8fps on a single CPU for a 256 x 256 image sequence, with close to state-of-the-art accuracy.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892 · cited 3×
“Other more appropriate loss functions could be used instead of the PSNR, for example the Structural Similarity Index (SSIM) [40].”
MethodGenetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010 · cited 1×
“Other optimization methods such as genetic algorithms [14] or simulated annealing [16] could be more appropriate for avoiding local optima and are subject to further investigation.”
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134 · cited 1×
“Other optimization methods such as genetic algorithms [14] or simulated annealing [16] could be more appropriate for avoiding local optima and are subject to further investigation.”
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905 · cited 1×
“We also experimented with gradient ascent, conjugate gradient and the simplex method [24].”
MethodGenetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Image denoising by sparse 3-D transform-domain collaborative filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.901238 · Cited by 9,283 · cited 10×
“Non-local image denoising methods include [6] and especially 3D collaborative filtering (BM3D) [9], th e latter obtaining very good results with low computational expense.”
BackgroundMethodInfluentialOn the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560 · cited 2×
“The MRF model was based on 3-cliques and inference was obtained by limited memory BFGS [21].”
MethodMartin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
A Non-Local Algorithm for Image Denoising
Buades, A., Coll, B., & Morel, J.-M. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.38 · Cited by 7,616 · cited 1×
“Nonlocal image denoising methods include [6] and especially 3-”
Method
Cited by
Items 101–102 of 102
Hybrid image denoising algorithm combining FFDNet and discrete wavelet transform
Zhang, W.-L., Chen, H., Chen, K., Wang, Y.-P., Wang, K.-C., Qin, Y.-X., Liu, J.-Q., Wang, Y., Zhang, M.-Y., & Ma, G.-Z. (2026) · Optik · doi:10.1016/j.ijleo.2026.172860
Liangju, 许. X., & Shuhui, 高. G. (2026) · Laser & Optoelectronics Progress · doi:10.3788/lop252493
Metadata
- Authors
- Barbu, A.
- Affiliations
- Florida State University (US)
- Corresponding author
- Barbu, A.
- ORCID
- Barbu, A.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2009-11
- Volume
- 18
- Issue
- 11
- Pages
- 2451-2462
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2119290843
- Cited by
- 105
- References
- 49
- Citations by year
- 2026: 2 · 2025: 8 · 2024: 3 · 2023: 6 · 2022: 6 · 2021: 10 · 2020: 13 · 2019: 6 · 2018: 13 · 2017: 7 · 2016: 3 · 2015: 6 · 2014: 5 · 2013: 3 · 2012: 3
- FWCI
- 5.15
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Image Processing (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Signal Denoising Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Enhancement Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image Processing Techniques
- Keywords
- image denoising, Markov random fields, conditional random fields, real-time image processing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.