A Framework for Image Denoising Using First and Second Order Fractional Overlapping Group Sparsity (HF-OLGS) Regularizer

Denoising images subjected to Gaussian and Poisson noise has attracted attention in many areas of image processing. This paper introduces an image denoising framework using higher order fractional overlapping group sparsity prior to sparser image representation constraint. The proposed prior has a capability of avoiding staircase effects in both edges and oscillatory patterns (textures). We adopt the alternating direction method of multipliers for optimizing the proposed objective function by converting it into a constrained optimization problem using variable splitting approach. Finally, we conduct experiments on various degraded images and compare our results with those of several state-of-the-art methods. The numerical results show that the proposed fractional order image denoising framework improves the peak signal to noise ratio of an image by preserving the textures and eliminating the staircases effects. This leads to visually pleasant restored images which exhibit a higher value of Structural SIMilarity score when compared to that of other methods

AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON-SEPARABLE L1-REGULARIZATION

Ph.DDOCTOR OF PHILOSOPH

Splitting Methods in Image Processing

It is often necessary to restore digital images which are affected by noise (denoising), blur (deblurring), or missing data (inpainting). We focus here on variational methods, i.e., the restored image is the minimizer of an energy functional. The first part of this thesis deals with the algorithmic framework of how to compute such a minimizer. It turns out that operator splitting methods are very useful in image processing to derive fast algorithms. The idea is that, in general, the functional we want to minimize has an additive structure and we treat its summands separately in each iteration of the algorithm which yields subproblems that are easier to solve. In our applications, these are typically projections onto simple sets, fast shrinkage operations, and linear systems of equations with a nice structure. The two operator splitting methods we focus on here are the forward-backward splitting algorithm and the Douglas-Rachford splitting algorithm. We show based on older results that the recently proposed alternating split Bregman algorithm is equivalent to the Douglas-Rachford splitting method applied to the dual problem, or, equivalently, to the alternating direction method of multipliers. Moreover, it is illustrated how this algorithm allows us to decouple functionals which are sums of more than two terms. In the second part, we apply the above techniques to existing and new image restoration models. For the Rudin-Osher-Fatemi model, which is well suited to remove Gaussian noise, the following topics are considered: we avoid the staircasing effect by using an additional gradient fitting term or by combining first- and second-order derivatives via an infimal-convolution functional. For a special setting based on Parseval frames, a strong connection between the forward-backward splitting algorithm, the alternating split Bregman method and iterated frame shrinkage is shown. Furthermore, the good performance of the alternating split Bregman algorithm compared to the popular multistep methods is illustrated. A special emphasis lies here on the choice of the step-length parameter. Turning to a corresponding model for removing Poisson noise, we show the advantages of the alternating split Bregman algorithm in the decoupling of more complicated functionals. For the inpainting problem, we improve an existing wavelet-based method by incorporating anisotropic regularization techniques to better restore boundaries in an image. The resulting algorithm is characterized as a forward-backward splitting method. Finally, we consider the denoising of a more general form of images, namely, tensor-valued images where a matrix is assigned to each pixel. This type of data arises in many important applications such as diffusion-tensor MRI

Separable Inverse Problems, Blind Deconvolution, and Stray Light Correction for Extreme Ultraviolet Solar Images.

The determination of the inputs to a system given noisy output data is known as an inverse problem. When the system is a linear transformation involving unknown side parameters, the problem is called separable. A quintessential separable inverse problem is blind deconvolution: given a blurry image one must determine the sharp image and point spread function (PSF) that were convolved together to form it. This thesis describes a novel optimization approach for general separable inverse problems, a new blind deconvolution method for images corrupted by camera shake, and the first stray light correction for extreme ultraviolet (EUV) solar images from the EUVI/STEREO instruments. We present a generalization of variable elimination methods for separable inverse problems beyond least squares. Existing variable elimination methods require an explicit formula for the optimal value of the linear variables, so they cannot be used in problems with Poisson likelihoods, bound constraints, or other important departures from least squares. To address this limitation, we propose a generalization of variable elimination in which standard optimization methods are modified to behave as though a variable has been eliminated. Computational experiments indicate that this approach can have significant speed and robustness advantages. A new incremental sparse approximation method is proposed for blind deconvolution of images corrupted by camera shake. Unlike current state-of-the-art variational Bayes methods, it is based on simple alternating projected gradient optimization. In experiments on a standard test set, our method is faster than the state-of-the-art and competitive in deblurring performance. Stray light PSFs are determined for the two EUVI instruments, EUVI-A and B, aboard the STEREO mission. The PSFs are modeled using semi-empirical parametric formulas, and their parameters are determined by semiblind deconvolution of EUVI images. The EUVI-B PSFs were determined from lunar transit data, exploiting the fact that the Moon is not a significant EUV source. The EUVI-A PSFs were determined by analysis of simultaneous A/B observations from December 2006, when the instruments had nearly identical lines of sight to the Sun. We provide the first estimates of systematic error in EUV deconvolved images.PHDApplied and Interdisciplinary MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/99797/1/shearerp_1.pd