|Matthieu Guerquin-Kern||Master Project|
|Département EEA, Ecole normale supérieure de Cachan||August 2007|
Inverse problem are challenging due to the presence of noise.
In order to solve such an inverse problem we could use a variational approach, that is, the solution could be expressed as the minimization of a functional. This functional typically consists of a fidelity and a regularization term (assuming that the solution is rather regular). Recently developed algorithms have a regularity term that consists of wavelet coefficients   .
Daubechies et al. proposed an iterative algorithm for orthonormal wavelet bases with two simple steps. The goal of my work was to design a de-noising algorithm using semi-orthogonal wavelet bases.
First, we devised a computationally-efficient method for the de-noising problems. We ensured the convergence for semi-orthogonal wavelet bases. Moreover, we proved that it can easily be extended to every linear inverse problem.
Finally, we implemented the algorithm and studied the impact of each parameter. We used the semi-orthogonal fractional-spline wavelet transform , and observed, in particular the importance of pre and post-filtering.