Network flow optimization for restoration of images

DOI10.1155/S1110757X02110035zbMATH Open1116.90321arXivmath/0106180MaRDI QIDQ700929FDOQ700929

Authors: Boris A. Zalesky 

Publication date: 15 October 2002

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Abstract: The network flow optimization approach is offered for restoration of grayscale and color images corrupted by noise. The Ising models are used as a statistical background of the proposed method. The new multiresolution network flow minimum cut algorithm, which is especially efficient in identification of the maximum a posteriori estimates of corrupted images, is presented. The algorithm is able to compute the MAP estimates of large size images and can be used in a concurrent mode. We also describe the efficient solutions of the problem of integer minimization of two energy functions for the Ising models of gray-scale and color images.

Full work available at URL: https://arxiv.org/abs/math/0106180

Recommendations

• Reconstruction of gray-scale images
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• Parametric maximum flow algorithms for fast total variation minimization
• Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
• scientific article; zbMATH DE number 1849127

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Integer programming (90C10)

Cited In (10)

• Mean curvature, threshold dynamics, and phase field theory on finite graphs
• Total variation on a tree
• Title not available (Why is that?)
• Global optimization for first order Markov random fields with submodular priors
• Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
• A new variational model for removal of combined additive and multiplicative noise and a fast algorithm for its numerical approximation
• New time dependent pretreat models based on total variational image restoration
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
• New algorithms for convex cost tension problem with application to computer vision

This page was built for publication: Network flow optimization for restoration of images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700929)