DocumentCode
3416187
Title
Image enhancement using very fast simulated reannealing
Author
Natrajan, Balaji ; Rosen, B.E.
Author_Institution
Div. of Comput. Sci., Texas Univ., San Antonio, TX, USA
fYear
1996
fDate
8-9 Apr 1996
Firstpage
230
Lastpage
235
Abstract
We compare the random greedy algorithm, the Cauchy annealing algorithm and the very fast simulated reannealing algorithm (VFSR) on a piecewise constant image enhancement task. We tested these algorithms on a noise corrupted 64×64 and 256×256 image and show that the VFSR algorithm converges to better solutions than Cauchy annealing, or the random greedy search algorithm
Keywords
image enhancement; noise; piecewise constant techniques; search problems; simulated annealing; Cauchy annealing algorithm; VFSR algorithm; convergence; image enhancement; noise corrupted image; piecewise constant image enhancement; random greedy algorithm; random greedy search algorithm; very fast simulated reannealing; Computational modeling; Computer science; Cost function; Greedy algorithms; Image converters; Image enhancement; Image quality; Simulated annealing; Temperature; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Analysis and Interpretation, 1996., Proceedings of the IEEE Southwest Symposium on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-3200-8
Type
conf
DOI
10.1109/IAI.1996.493758
Filename
493758
Link To Document