Abstract. In many numerical applications, for instance in image deconvolution, the nonnegativity of the computed solution is required. When a problem of deconvolution is formulated in a statistical frame, the recorded image is seen as the realization of a random process, where the nature of the noise is taken into account. This formulation leads to the maximization of a likelihood function which depends on the statistical property assumed for the noise. In this paper we revisit, under this unifying statistical approach, some iterative methods coupled with suitable strategies for enforcing nonnegativity and other ones which instead naturally embed nonnegativity. For all these methods we carry out a comparative study taking into account several performance indicators. The reconstruction e±ciency, the computational cost, the consistency with the discrepancy principle (a common technique for guessing the best regularization parameter) and the sensitivity to this choice are compared in a simulated context, by means of an extensive experimentation on both 1D and 2D problems.
|Autori:||ROMANI F; FAVATI P.; LOTTI G.; MENCHI O.|
|Titolo:||Performance analysis of maximum likelihood methods for regularization problems with nonnegativity constraints|
|Anno del prodotto:||2010|
|Digital Object Identifier (DOI):||10.1088/0266-5611/26/8/085013|
|Appare nelle tipologie:||1.1 Articolo in rivista|