Related papers: A Second-Order TGV Discretization with $90^{\circ}…
This paper provides a new algorithm for solving inverse problems, based on the minimization of the $L^2$ norm and on the control of the Total Variation. It consists in relaxing the role of the Total Variation in the classical Total…
In this paper, an eigenvalue mapping-based discretization method is applied to discretize the generalized super-twisting algorithm. The existing eigenvalue mapping is extended to the complex domain which greatly enlarges the range of…
The problem of restoring images corrupted by Poisson noise is common in many application fields and, because of its intrinsic ill posedness, it requires regularization techniques for its solution. The effectiveness of such techniques…
We consider a family of variational time discretizations that are generalizations of discontinuous Galerkin (dG) and continuous Galerkin-Petrov (cGP) methods. The family is characterized by two parameters. One describes the polynomial…
Dual gradient descent combined with early stopping represents an efficient alternative to the Tikhonov variational approach when the regularizer is strongly convex. However, for many relevant applications, it is crucial to deal with…
The Cartesian reverse derivative is a categorical generalization of reverse-mode automatic differentiation. We use this operator to generalize several optimization algorithms, including a straightforward generalization of gradient descent…
Image segmentation with a volume constraint is an important prior for many real applications. In this work, we present a novel volume preserving image segmentation algorithm, which is based on the framework of entropic regularized optimal…
This paper deals with a second order dynamical system with a Tikhonov regularization term in connection to the minimization problem of a convex Fr\'echet differentiable function. The fact that beside the asymptotically vanishing damping we…
The generalized singular value decomposition (GSVD) is a powerful tool for solving discrete ill-posed problems. In this paper, we propose a two-sided uniformly randomized GSVD algorithm for solving the large-scale discrete ill-posed problem…
Discrete gradient methods are well-known methods of Geometric Numerical Integration, which preserve the dissipation of gradient systems. The preservation of the dissipation of a system is an important feature in numerous image processing…
We consider a bilevel optimisation approach for parameter learning in higher-order total variation image reconstruction models. Apart from the least squares cost functional, naturally used in bilevel learning, we propose and analyse an…
Motivated by the fact that both the classical and quantum description of nature rest on causality and a variational principle, we develop a novel and highly versatile discretization prescription for classical initial value problems (IVPs).…
We address the image restoration problem under Poisson noise corruption. The Kullback-Leibler divergence, which is typically adopted in the variational framework as data fidelity term in this case, is coupled with the second-order Total…
In this paper we deal with a general second order continuous dynamical system associated to a convex minimization problem with a Fr\`echet differentiable objective function. We show that inertial algorithms, such as Nesterov's algorithm,…
Inspired by dynamic programming, we propose Stochastic Virtual Gradient Descent (SVGD) algorithm where the Virtual Gradient is defined by computational graph and automatic differentiation. The method is computationally efficient and has…
In this paper, a new regularization term is proposed to solve mathematical image problems. By using difference operators in the four directions; horizontal, vertical and two diagonal directions, an estimation of derivative amplitude is…
The total variation (TV)-seminorm is considered for piecewise polynomial, globally discontinuous (DG) and continuous (CG) finite element functions on simplicial meshes. A novel, discrete variant (DTV) based on a nodal quadrature formula is…
The core of many approaches for the resolution of variational inverse problems arising in signal and image processing consists of promoting the sought solution to have a sparse representation in a well-suited space. A crucial task in this…
This paper introduces a novel variational approach for image compression motivated by recent PDE-based approaches combining edge detection and Laplacian inpainting. The essential feature is to encode the image via a sparse vector field,…
Inverse problems generally require a regularizer or prior for a good solution. A recent trend is to train a convolutional net to denoise images, and use this net as a prior when solving the inverse problem. Several proposals depend on a…