English
Related papers

Related papers: New Pair of Primal Dual Algorithms for Bregman Ite…

200 papers

In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…

Data Structures and Algorithms · Computer Science 2009-11-09 Stefanie Jegelka , Suvrit Sra , Arindam Banerjee

Many imaging problems require solving an inverse problem that is ill-conditioned or ill-posed. Imaging methods typically address this difficulty by regularising the estimation problem to make it well-posed. This often requires setting the…

Methodology · Statistics 2020-08-17 Ana F. Vidal , Valentin De Bortoli , Marcelo Pereyra , Alain Durmus

Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist addressing the…

Optimization and Control · Mathematics 2024-06-18 Zakhar Shumaylov , Jeremy Budd , Subhadip Mukherjee , Carola-Bibiane Schönlieb

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved…

Image and Video Processing · Electrical Eng. & Systems 2025-08-26 Edward P. Chandler , Shirin Shoushtari , Brendt Wohlberg , Ulugbek S. Kamilov

We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate…

Optimization and Control · Mathematics 2018-06-27 Peter Ochs , Jalal Fadili , Thomas Brox

We present an approach for variational regularization of inverse and imaging problems for recovering functions with values in a set of vectors. We introduce regularization functionals, which are derivative-free double integrals of such…

Optimization and Control · Mathematics 2018-12-24 René Ciak , Melanie Melching , Otmar Scherzer

In this paper, we consider a primal-dual domain decomposition method for total variation regularized problems appearing in mathematical image processing. The model problem is transformed into an equivalent constrained minimization problem…

Numerical Analysis · Mathematics 2019-12-10 Chang-Ock Lee , Jongho Park

This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution…

Optimization and Control · Mathematics 2018-03-28 Emanuel Laude , Daniel Cremers

Multiplicative noise models occur in the study of several coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser imaging. This type of noise is also commonly referred to as speckle. Multiplicative…

Optimization and Control · Mathematics 2009-03-25 Jose M. Bioucas-Dias , Mario A. T. Figueiredo

In this work, we propose a new criterion for choosing the regularization parameter in Tikhonov regularization when the noise is white Gaussian. The criterion minimizes a lower bound of the predictive risk, when both data norm and noise…

Numerical Analysis · Mathematics 2020-06-24 Federico Benvenuto , Bangti Jin

In this paper, with the parametric symmetric coercive elliptic boundary value problem as an example of the primal-dual variational problems satisfying the strong duality, we develop primal-dual reduced basis methods (PD-RBM) with robust…

Numerical Analysis · Mathematics 2020-09-18 Shun Zhang

Several well-known algorithms in the field of combinatorial optimization can be interpreted in terms of the primal-dual method for solving linear programs. For example, Dijkstra's algorithm, the Ford-Fulkerson algorithm, and the Hungarian…

Optimization and Control · Mathematics 2016-01-19 Randy Cogill

Despite a variety of available techniques the issue of the proper regularization parameter choice for inverse problems still remains one of the biggest challenges. The main difficulty lies in constructing a rule, allowing to compute the…

Numerical Analysis · Mathematics 2017-10-13 Ernesto De Vito , Massimo Fornasier , Valeriya Naumova

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…

Numerical Analysis · Mathematics 2022-09-14 Alireza Hosseini

In this paper we propose a new statistical stopping rule for constrained maximum likelihood iterative algorithms applied to ill-posed inverse problems. To this aim we extend the definition of Tikhonov regularization in a statistical…

Numerical Analysis · Mathematics 2012-12-14 Federico Benvenuto , Michele Piana

In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…

Optimization and Control · Mathematics 2017-08-04 Guillaume Garrigos , Lorenzo Rosasco , Silvia Villa

We consider a statistical inverse learning problem, where the task is to estimate a function $f$ based on noisy point evaluations of $Af$, where $A$ is a linear operator. The function $Af$ is evaluated at i.i.d. random design points $u_n$,…

Machine Learning · Statistics 2021-11-02 Tatiana A. Bubba , Martin Burger , Tapio Helin , Luca Ratti

All imaging modalities such as computed tomography (CT), emission tomography and magnetic resonance imaging (MRI) require a reconstruction approach to produce an image. A common image processing task for applications that utilise those…

In this paper, we are concerned with efficiently solving the sequences of regularized linear least squares problems associated with employing Tikhonov-type regularization with regularization operators designed to enforce edge recovery. An…

Numerical Analysis · Mathematics 2023-06-29 Matthias Bolten , Scott P. MacLachlan , Misha E. Kilmer

We tackle highly nonconvex, nonsmooth composite optimization problems whose objectives comprise a Moreau-Yosida regularized term. Classical nonconvex proximal splitting algorithms, such as nonconvex ADMM, suffer from lack of convergence for…

Optimization and Control · Mathematics 2018-02-28 Emanuel Laude , Tao Wu , Daniel Cremers
‹ Prev 1 8 9 10 Next ›