Gilles Aubert

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, we 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 2D single photon emission tomography, but this method can be applied in a large number of applications in image processing.

A Variational Approach to Removing Multiplicative Noise

This paper focuses on the problem of multiplicative noise removal. We draw our inspiration from the modeling of speckle noise. By using a MAP estimator, we can derive a functional whose minimizer corresponds to the denoised image we want to recover. Although the functional is not convex, we prove the existence of a minimizer and we show the capability of our model on some numerical examples. We study the associated evolution problem, for which we derive existence and uniqueness results for the solution. We prove the convergence of an implicit scheme to compute the solution.

A Variational Method in Image Recovery

This paper is concerned with a classical denoising and deblurring problem in image recovery. Our approach is based on a variational method. By using the Legendre--Fenchel transform, we show how the nonquadratic criterion to be minimized can be split into a sequence of half-quadratic problems easier to solve numerically. First we prove an existence and uniqueness result, and then we describe the algorithm for computing the solution and we give a proof of convergence. Finally, we present some experimental results for synthetic and real images.

Image Decomposition into a Bounded Variation Component and an Oscillating Component

We construct an algorithm to split an image into a sum u + v of a bounded variation component and a component containing the textures and the noise. This decomposition is inspired from a recent work of Y. Meyer. We find this decomposition by minimizing a convex functional which depends on the two variables u and v, alternately in each variable. Each minimization is based on a projection algorithm to minimize the total variation. We carry out the mathematical study of our method. We present some numerical results. In particular, we show how the u component can be used in nontextured SAR image restoration.

Image Segmentation Using Active Contours: Calculus of Variations or Shape Gradients?

We consider the problem of segmenting an image through the minimization of an energy criterion involving region and boundary functionals. We show that one can go from one class to the otherby solving Poissons orHelmholtzs equation with well-chosen boundar y conditions. Using this equivalence, we study the case of a large class of region functionals by standard methods of the calculus of variations and derive the corresponding Euler-Lagrange equations. We revisit this problem using the notion of a shape derivative and show that the same equations can be elegantly derived without going through the unnatural step of converting the region integrals into boundary integrals. We also define a larger class of region functionals based on the estimation and comparison to a prototype of the probability density distribution of image features and show how the shape derivative tool allows us to easily compute the corresponding Gateaux derivatives and Euler-Lagrange equations. Finally we apply this new functional to the problem of regions segmentation in sequences of color images. We briefly describe our numerical scheme and show some experimental results.

Two deterministic half-quadratic regularization algorithms for 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. The authors first give sufficient conditions for the design of such an edge-preserving regularization. Under these conditions, it is possible to introduce an auxiliary variable whose role is twofold. Firstly, it marks the discontinuities and ensures their preservation from smoothing. Secondly, it makes the criterion half-quadratic. The optimization is then easier. The authors propose a deterministic strategy, based on alternate minimizations on the image and the auxiliary variable. This yields two algorithms, ARTUR and LEGEND. The authors apply these algorithms to the problem of SPECT reconstruction.<<ETX>>

Variational approach for edge-preserving regularization using coupled PDEs

This paper deals with edge-preserving regularization for inverse problems in image processing. We first present a synthesis of the main results we have obtained in edge-preserving regularization by using a variational approach. We recall the model involving regularizing functions phi and we analyze the geometry-driven diffusion process of this model in the three-dimensional (3-D) case. Then a half-quadratic theorem is used to give a very simple reconstruction algorithm. After a critical analysis of this model, we propose another functional to minimize for edge-preserving reconstruction purposes. It results in solving two coupled partial differential equations (PDEs): one processes the intensity, the other the edges. We study the relationship with similar PDE systems in particular with the functional proposed by Ambrosio-Tortorelli in order to approach the Mumford-Shah functional developed in the segmentation application. Experimental results on synthetic and real images are presented.

DREAM 2 S: Deformable Regions Driven by an Eulerian Accurate Minimization Method for Image and Video Segmentation

This paper deals with image and video segmentation using active contours. We propose a general form for the energy functional related to region-based active contours. We compute the associated evolution equation using shape derivation tools and accounting for the evolving region-based terms. Then we apply this general framework to compute the evolution equation from functionals that include various statistical measures of homogeneity for the region to be segmented. Experimental results show that the determinant of the covariance matrix appears to be a very relevant tool for segmentation of homogeneous color regions. As an example, it has been successfully applied to face segmentation in real video sequences.

A variational model for image classification and restoration

We present a variational model devoted to image classification coupled with an edge-preserving regularization process. The discrete nature of classification (i.e., to attribute a label to each pixel) has led to the development of many probabilistic image classification models, but rarely to variational ones. In the last decade, the variational approach has proven its efficiency in the field of edge-preserving restoration. We add a classification capability which contributes to provide images composed of homogeneous regions with regularized boundaries, a region being defined as a set of pixels belonging to the same class. The soundness of our model is based on the works developed on the phase transition theory in mechanics. The proposed algorithm is fast, easy to implement, and efficient. We compare our results on both synthetic and satellite images with the ones obtained by a stochastic model using a Potts regularization.

Computing optical flow via variational techniques

Defined as the apparent motion in a sequence of images, the optical flow is very important in the computer vision community where its accurate estimation is necessary for many applications. It is o...