Network flow optimization for restoration of images

Boris A. Zalesky

Journal of Applied Mathematics, 2002, vol. 2, 1-20

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, U 1 ( x ) = λ ∑ i | y i − x i | + ∑ i , j β i , j | x i − x j | and U 2 ( x ) = ∑ i λ i ( y i − x i ) 2 + ∑ i , j β i , j ( x i − x j ) 2 , with parameters λ , λ i , β i , j > 0 and vectors x = ( x 1 , … , x n ) , y = ( y 1 , … , y n ) ∈ { 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 U 1 ( x ) , U 2 ( x ) by the network flow algorithms is described.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2/131829.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2/131829.xml (text/xml)

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:hin:jnljam:131829

DOI: 10.1155/S1110757X02110035

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().