Deterministic edge-preserving regularization in computed imaging

Many image processing problems are ill posed and must be regularized, Usually, a roughness penalty is imposed on the solution, The difficulty is to avoid the smoothing of edges, which are very important attributes of the image. In this paper, we first give conditions for the design of such an edge-preserving regularization. Under these conditions, me show that it is possible to introduce an auxiliary variable whose role is twofold, First, it marks the discontinuities and ensures their preservation from smoothing, Second, it makes the criterion half-quadratic. The optimization is then easier, We propose a deterministic strategy, based on alternate minimizations on the image and the auxiliary variable, This Leads to the definition of an original reconstruction algorithm, called ARTUR, Some theoretical properties of ARTUR are discussed, Experimental results illustrate the behavior of the algorithm, These results are shown in the field of tomography, but this method can be applied in a large number of applications in image processing.