Network flow optimization for restoration of images

Boris A. Zalesky

Journal of Applied Mathematics, 2002, vol. 2, issue 4, 199-218

Abstract: The network flow optimization approach is offered for restoration of gray‐scale and color images corrupted by noise. The Ising models are used as a statistical background of the proposed method. We present the new multiresolution network flow minimum cut algorithm, which is especially efficient in identification of the maximum a posteriori (MAP) estimates of corrupted images. The algorithm is able to compute the MAP estimates of large‐size images and can be used in a concurrent mode. We also consider the problem of integer minimization of two functions, U1(x) = λ∑i|yi − xi|+∑i,j βi,j|xi − xj| and U2(x)=∑i λi (yi−xi)2+∑i,j βi,j (xi−xj)2, with parameters λ, λi, βi,j > 0 and vectors x = (x1, …, xn), y = (y1, …, yn) ∈ {0,…,L−1}n. Those functions constitute the energy ones for the Ising model of color and gray‐scale images. In the case L = 2, they coincide, determining the energy function of the Ising model of binary images, and their minimization becomes equivalent to the network flow minimum cut problem. The efficient integer minimization of U1(x), U2(x) by the network flow algorithms is described.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/S1110757X02110035

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2:y:2002:i:4:p:199-218

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().