A multiplicative iterative algorithm for box-constrained penalized likelihood image restoration
Image restoration is a computationally intensive problem as a large number of pixel values have to be determined. Since the pixel values of digital images can attain only a finite number of values (e.g., 8-bit images can have only 256 gray levels), one would like to recover an image within some dyna...
| Publié dans: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 21(2012), 7 vom: 01. Juli, Seite 3168-81 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2012
|
| Accès à la collection: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |
| Résumé: | Image restoration is a computationally intensive problem as a large number of pixel values have to be determined. Since the pixel values of digital images can attain only a finite number of values (e.g., 8-bit images can have only 256 gray levels), one would like to recover an image within some dynamic range. This leads to the imposition of box constraints on the pixel values. The traditional gradient projection methods for constrained optimization can be used to impose box constraints, but they may suffer from either slow convergence or repeated searching for active sets in each iteration. In this paper, we develop a new box-constrained multiplicative iterative (BCMI) algorithm for box-constrained image restoration. The BCMI algorithm just requires pixelwise updates in each iteration, and there is no need to invert any matrices. We give the convergence proof of this algorithm and apply it to total variation image restoration problems, where the observed blurry images contain Poisson, Gaussian, or salt-and-pepper noises |
|---|---|
| Description: | Date Completed 15.10.2012 Date Revised 19.06.2012 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2012.2188811 |