La modélisation de processus complexes peut impliquer un grand nombre de variables ayant entre elles une structure de corrélation compliquée. Par exemple, les phénomènes spatiaux possèdent souvent une forte régularité spatiale, se traduisant par une corrélation entre variables d’autant plus forte que les régions correspondantes sont proches. Le formalisme des graphes pondérés permet de capturer de manière compacte ces relations entre variables, autorisant la formalisation mathématique de nombreux problèmes d’analyse de données spatiales. La première partie du manuscrit se concentre sur la résolution efficace de problèmes de régularisation spatiale, mettant en jeu des pénalités telle que la variation totale ou la longueur totale des contours. Nous présentons une stratégie de préconditionnement pour l’algorithme generalized forward-backward, spécifiquement adaptée à la résolution de problèmes structurés par des graphes pondérés présentant une grande variabilité de configurations et de poids. Nous présentons ensuite un nouvel algorithme appelé cut pursuit, qui exploite les relations entre les algorithmes de flots et la variation totale au travers d’une stratégie de working set. Ces algorithmes présentent des performances supérieures à l’état de l’art pour des tâches d’agrégations de données geostatistiques. La seconde partie de ce document se concentre sur le développement d’un nouveau modèle qui étend les chaînes de Markov à temps continu au cas des graphes pondérés non orientés généraux. Ce modèle autorise la prise en compte plus fine des interactions entre noeuds voisins pour la prédiction structurée, comme illustré pour la classification supervisée de tissus urbains. / Modeling complex processes often involve a high number of variables with anintricate correlation structure. For example, many spatially-localized processes display spatial regularity, as variables corresponding to neighboring regions are more correlated than distant ones. The formalism of weighted graphs allows us to capture relationships between interacting variables in a compact manner, permitting the mathematical formulation of many spatial analysis tasks. The first part of this manuscript focuses on optimization problems with graph-structure dregularizers, such as the total variation or the total boundary size. We first present the convex formulation and its resolution with proximal splitting algorithms. We introduce a new preconditioning scheme for the existing generalized forward-backward proximal splitting algorithm, specifically designed for graphs with high variability in neighbourhood configurations and edge weights. We then introduce a new algorithm, cut pursuit, which used the links between graph cuts and total variation in a working set scheme. We also present a variation of this algorithm which solved the problem regularized by the non convex total boundary length penalty. We show that our proposed approaches reach or outperform state-of-the-art for geostatistical aggregation as well as image recovery problems. The second part focuses on the development of a new model, expanding continuous-time Markov chain models to general undirected weighted graphs. This allows us to take into account the interactions between neighbouring nodes in structured classification, as demonstrated for a supervised land-use classification task from cadastral data.

La résonance paramagnétique électronique est une technologie permettant de localiser et de caractériser les radicaux libres, fondée sur la propriété de résonance des électrons libres lorsqu’ils sont placés dans un champ magnétique spécifique. Afin d’augmenter la qualité des reconstructions obtenues par des dispositifs d’imagerie de résonance paramagnétique électronique, ce travail propose l’utilisation de méthodes variationnelles pour inverser le modèle de formation des images, qui combine une convolution avec une transformée de Radon. La fonctionnelle proposée repose sur la norme L2 pour le terme d’attache aux données, et sur la variation totale et une seminorme de Besov pour le terme de régularisation. La seminorme de Besov est implémentée grâce à la transformée en curvelets et à la norme L1 qui permet d’appliquer un critère de parcimonie. Les propriétés de ces termes de régularisation permettent de reconstruire des images à la fois pertinentes dans les zones où l’acquisition des données est insuffisante, notamment sur les bords, et suffisamment détaillées dans les zones où l’échantillon est texturé. L’augmentation de la qualité des images reconstruites permet d’envisager des acquisitions sur des durées réduites, ouvrant la voie à des expériences in vivo ou cliniques actuellement limitées par des durées d’acquisition de l’ordre de plusieurs dizaines de minutes. Les algorithmes de minimisation primal-dual de Chambolle-Pock et FISTA sont utilisés pour résoudre les problèmes d’optimisation que pose l’utilisation de méthodes variationnelles. L’étude détaillée du modèle direct permet de mettre en évidence une structure de Toeplitz, dont les propriétés sont utilisées pour résoudre le problème inverse en évitant le recours à la rétroprojection filtrée ou aux transformées de Fourier non-uniformes. Des simulations numériques sont menées sur le fantôme de Shepp-Logan, et valident le modèle proposé qui surpasse à la fois visuellement et quantitativement les techniques de reconstruction couramment utilisées, combinant déconvolution et rétroprojection filtrée. Des reconstructions menées sur des acquisitions réelles, consistant en un échantillon papier d’une encre paramagnétique et en une phalange distale irradiée, valident par l’expérience le choix des fonctionnelles utilisées pour inverser le modèle direct. La grande souplesse de la méthode variationnelle proposée permet d’adapter la fonctionnelle au problème de la séparation de sources qui se pose lorsque deux molécules paramagnétiques différentes sont présentes au sein d’un même échantillon. La fonctionnelle proposée permet de séparer les deux molécules dans le cadre d’une acquisition classique d’imagerie de résonance paramagnétique électronique, ce qui n’était possible jusqu’alors que sur des acquisitions dites hyperspectrales beaucoup plus gourmandes en temps. / Spatial electron paramagnetic resonance imaging (EPRI) is a recent method to localize and characterize free radicals in vivo or in vitro, leading to applications in material and biomedical sciences. To improve the quality of the reconstruction obtained by EPRI, a variational method is proposed to inverse the image formation model. It is based on a least-square data-fidelity term and the total variation and Besov seminorm for the regularization term. To fully comprehend the Besov seminorm, an implementation using the curvelet transform and the L1 norm enforcing the sparsity is proposed. It allows our model to reconstruct both image where acquisition information are missing and image with details in textured areas, thus opening possibilities to reduce acquisition times. To implement the minimization problem using the algorithm developed by Chambolle and Pock, a thorough analysis of the direct model is undertaken and the latter is inverted while avoiding the use of filtered backprojection (FBP) and of non-uniform Fourier transform. Numerical experiments are carried out on simulated data, where the proposed model outperforms both visually and quantitatively the classical model using deconvolution and FBP. Improved reconstructions on real data, acquired on an irradiated distal phalanx, were successfully obtained. Due to its great versatility, the variational approach is easily extended to the source separation problem which happens when two different paramagnetic species are present in the sample. The objective function is consequently modified, and a classic EPRI acquisition yields two images, one for each species. Until now, source separation could only be applied to hyperspectral EPRI data, much more costly in acquisition time.

Magnetic resonance imaging is a diagnostic method to form images of the organs in the body. Long acquisition times are the main disadvantage, however it is possible to accelerate the data acquisition with the method of compressed sensing by sensing fewer samples and formulating an optimization method for image reconstruction. The aim of this thesis is to describe and compare the common optimization methods and to create a software capable of solving them. Another objective is to observe how much the data acquisition can be accelarated without the loss of image quality when dealing with real data. The most promising method in the experiment was total generalized variation (TGV) regularization which was able to reconstruct an image with a proper quality using only a quarter of the data.

The JPEG codec is currently the most widely used image format. This work deals with the design and implementation of an alternative JPEG codec using proximal algorithms in combination with the fixation of points from the original image to suppression of artifacts created in common JPEG coding. To solve the problem, the prox_TV and then the Douglas-Rachford algorithm were used, for which special functions using l_1-norm for image reconstruction were derived. The results of the proposed solution are very good because they can effectively suppress the artefacts created and the result corresponds to the image with a higher set qualitative factor. The proposed method achieves very good results for both simple images and photos, but in the case of large images (1024 × 1024 px) and larger, a large amount of computing time is required, so the method is more suitable for smaller images.

This paper is concerned with the numerical analysis of the autoconvolution equation $x*x=y$ restricted to the interval [0,1]. We present a discrete constrained least squares approach and prove its convergence in $L^p(0,1),1<p<\infinite$ , where the regularization is based on a prescribed bound for the total variation of admissible solutions. This approach includes the case of non-smooth solutions possessing jumps. Moreover, an adaption to the Sobolev space $H^1(0,1)$ and some remarks on monotone functions are added. The paper is completed by a numerical case study concerning the determination of non-monotone smooth and non-smooth functions x from the autoconvolution equation with noisy data y.

No description available.

Speckle noise occurs in a wide range of images due to sampling and digital degradation. Understanding how noise can be present in images have led to multiple denoising techniques. Most of these denoising techniques assume equal noise distribution. When the noise present in the image is not uniform, the resulting denoised image becomes less than the highest standard or quality. For this research, we will be focusing on speckle noise. Unlike Gaussian noise, which affects single pixels on an image, speckle noise affects multiple pixels. Hence it is not possible to remove speckle noise with the traditional gaussian denoising model. We develope a more accurate speckle denoising model and its stable numerical methods. This model is based on the TV minimization and the associated non-linear PDE and Krissian $et$ $al$.'s speckle noise equation model. A realistic and efficient speckle noise equation model was introduced with an edge enhancing feature by adopting a non-convex functional. An effective numerical scheme was introduced and its stability was proved. Also, while working with TV minimization for non-linear PDE and Krissian $et$ $al$ we used a dual approach for faster computation. This work is based on Chambolle's approach for image denoising. The NLM algorithm takes advantage of the high degree of redundancy of any natural image. Also, the NLM algorithm is very accurate since all pixels contribute for denoising at any given pixel. However, due to non-local averaging, one major drawback is computational cost. For this research, we will discuss new denoising techniques based on NLM and total variation for images contaminated by speckle noise. We introduce blockwise and selective denoising methods based on NLM technique and Partial Differential Equations (PDEs) methods for total variation to enhance computational efficiency. Our PDE methods have shown to be very computational efficient and as mentioned before the NLM process is very accurate.

No description available.

No description available.

<p>In this thesis we present new methods for image and video super resolution and video deinterlacing. For image super resolution a new approach for finding a High Resolution (HR) image from a single Low Resolution (LR) image has been introduced. We have done this by employing Compressive Sensing (CS) theory. In CS framework images are assumed to be sparse in a transform domain such as wavelets or contourlets. Using this fact we have developed an approach in which the contourlet domain is considered as the transform domain and a CS algorithm is used to find the high resolution image. Following that, we extend our image super resolution scheme to video super resolution. Our video super resolution method has two steps, the first step consists of our image super resolution method which is applied on each frame separately. Then a post processing step is performed on estimated outputs to increase the video quality. The post processing step consists of a deblurring and a Bilateral Total Variation (BTV) filtering for increasing the video consistency. Experimental results show significant improvement over existing image and video super resolution methods both objectively and subjectively.</p> <p>For video deinterlacing problem a method has been proposed which is also a two step approach. At first 6 interpolators are applied to each missing line and the interpolator which gives the minimum error is selected. An initial deinterlaced frame is constructed using selected interpolator. In the next step this initial deinterlaced frame is fed into a post processing step. The post processing step is a modified version of 2-D Bilateral Total Variation filter. The proposed deinterlacing technique outperforms many existing deinterlacing algorithms.</p> / Master of Science (MSc)