Image restoration by combining local genetic algorithm with adaptive pre-conditioning<sup>∗</sup> (Q4528026)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1558337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Image restoration by combining local genetic algorithm with adaptive pre-conditioning<sup>∗</sup> |
scientific article; zbMATH DE number 1558337 |
Statements
Image restoration by combining local genetic algorithm with adaptive pre-conditioning<sup>∗</sup> (English)
0 references
19 November 2001
0 references
adaptive pre-conditioning
0 references
numerical examples
0 references
image restoration
0 references
Markov random fields
0 references
genetic algorithm
0 references
local search method
0 references
Wiener filtering
0 references
median filtering
0 references
0.88174033
0 references
0.86729366
0 references
0.8581495
0 references
0.85603213
0 references
The authors discuss a technique for image restoration. Basically there are two steps. The first step is to apply the theory of Markov random fields to reformulate the image restoration problem as a global optimization problem. The second step is to solve the optimization problem. This is done by a combination of a genetic algorithm and a conventional local search method; the advantages of the genetic algorithm are domain independence, nonlinearity, and robustness. To avoid losing good candidates for the optimization problem the algorithm stores two sets of solutions: a current population and an elite set. On the elite set a local search can be done. This partly compensates the slow convergence of the genetic algorithm. The authors experimentally compare their algorithm in a number of interesting test cases with the results from Wiener filtering and median filtering, two widely used techniques.
0 references
