14 research outputs found
Graph Spectral Image Processing
Recent advent of graph signal processing (GSP) has spurred intensive studies
of signals that live naturally on irregular data kernels described by graphs
(e.g., social networks, wireless sensor networks). Though a digital image
contains pixels that reside on a regularly sampled 2D grid, if one can design
an appropriate underlying graph connecting pixels with weights that reflect the
image structure, then one can interpret the image (or image patch) as a signal
on a graph, and apply GSP tools for processing and analysis of the signal in
graph spectral domain. In this article, we overview recent graph spectral
techniques in GSP specifically for image / video processing. The topics covered
include image compression, image restoration, image filtering and image
segmentation
Preconditioning for Allen-Cahn variational inequalities with non-local constraints
The solution of Allen-Cahn variational inequalities with mass constraints is of interest in many applications. This problem can be solved both in its scalar and vector-valued form as a PDE-constrained optimization problem by means of a primal-dual active set method. At the heart of this method lies the solution of linear systems in saddle point form. In this paper we propose the use of Krylov-subspace solvers and suitable preconditioners for the saddle point systems. Numerical results illustrate the competitiveness of this approach
Rayleigh Wave Dispersion Curve Inversion: Occam Versus the L1-Norm
We compare inversions of Rayleigh wave dispersion curves for shear wave velocity depth profiles based on the L2-norm (Occam\u27s Inversion) and L1-norm (TV Regularization). We forward model Rayleigh waves using a finite-element method instead of the conventional technique based on a recursion formula and root-finding. The forward modeling naturally leads to an inverse problem that is overparameterized in depth. Solving the inverse problem with Occam\u27s Inversion gives the smoothest subsurface model that satisfies the data. However, the subsurface need not be smooth and we therefore also solve the inverse problem with TV Regularization, a procedure that does not penalize discontinuities. The use of such a regularization scheme for such an overparameterized inverse problem means blocky subsurface models can be obtained without fixing the layer boundaries in advance. This represents an entirely new philosophy for surface wave inversion
Combining Total Variation and Nonlocal Means Regularization for Edge Preserving Image Deconvolution
We propose a new edge preserving image deconvolution model by combining total variation and nonlocal means regularization. Natural images exhibit an high degree of redundancy. Using this redundancy, the nonlocal means regularization strategy is a good technique for detail preserving image restoration. In order to further improve the visual quality of the nonlocal means based algorithm, total variation is introduced to the model to better preserve edges. Then an efficient alternating minimization procedure is used to solve the model. Numerical experiments illustrate the effectiveness of the proposed algorithm
Recommended from our members
New PDE models for imaging problems and applications
Variational methods and Partial Differential Equations (PDEs) have been extensively employed for the mathematical formulation of a myriad of problems describing physical phenomena such as heat propagation, thermodynamic transformations and many more. In imaging, PDEs following variational principles are often considered. In their general form these models combine a regularisation and a data fitting term, balancing one against the other appropriately. Total variation (TV) regularisation is often used due to its edgepreserving and smoothing properties. In this thesis, we focus on the design of TV-based models for several different applications. We start considering PDE models encoding higher-order derivatives to overcome wellknown TV reconstruction drawbacks. Due to their high differential order and nonlinear nature, the computation of the numerical solution of these equations is often challenging. In this thesis, we propose directional splitting techniques and use Newton-type methods that despite these numerical hurdles render reliable and efficient computational schemes. Next, we discuss the problem of choosing the appropriate data fitting term in the case when multiple noise statistics in the data are present due, for instance, to different acquisition and transmission problems. We propose a novel variational model which encodes appropriately and consistently the different noise distributions in this case. Balancing the effect of the regularisation against the data fitting is also crucial. For this sake, we consider a learning approach which estimates the optimal ratio between the two by using training sets of examples via bilevel optimisation. Numerically, we use a combination of SemiSmooth (SSN) and quasi-Newton methods to solve the problem efficiently. Finally, we consider TV-based models in the framework of graphs for image segmentation problems. Here, spectral properties combined with matrix completion techniques are needed to overcome the computational limitations due to the large amount of image data. Further, a semi-supervised technique for the measurement of the segmented region by means of the Hough transform is proposed