An introduction to continuous optimization for imaging
From MaRDI portal
Publication:5740077
DOI10.1017/S096249291600009XzbMath1343.65064MaRDI QIDQ5740077
Thomas Pock, Antonin Chambolle
Publication date: 8 July 2016
Published in: Acta Numerica (Search for Journal in Brave)
algorithmmagnetic resonance imagingdenoisingoptical flow estimationstereo matchingdeblurringcontinuous optimizationnon-smooth problemmultilabel image segmentation
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
An inverse eikonal method for identifying ventricular activation sequences from epicardial activation maps, A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems, Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, First-order optimization algorithms via inertial systems with Hessian driven damping, First-order inertial algorithms involving dry friction damping, Modular-Proximal Gradient Algorithms in Variable Exponent Lebesgue Spaces, Approximation Schemes for Materials with Discontinuities, Nonsmooth convex optimization for structured illumination microscopy image reconstruction, Accelerated gradient sliding for structured convex optimization, A mixed finite element discretization of dynamical optimal transport, Faster Lagrangian-Based Methods in Convex Optimization, Proportional-integral projected gradient method for conic optimization, Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier, A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives, Decentralized proximal splitting algorithms for composite constrained convex optimization, Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces, Convergence of a Piggyback-Style Method for the Differentiation of Solutions of Standard Saddle-Point Problems, Accelerated additive Schwarz methods for convex optimization with adaptive restart, Inexact first-order primal-dual algorithms, Bayesian Imaging with Data-Driven Priors Encoded by Neural Networks, A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems, Greedy low-rank algorithm for spatial connectome regression, Fast gradient methods for uniformly convex and weakly smooth problems, RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images, Unnamed Item, On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective, Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term, Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application, Contrast invariant SNR and isotonic regressions, Additive Schwarz Methods for Convex Optimization as Gradient Methods, Nonlinear acceleration of momentum and primal-dual algorithms, Discrete processes and their continuous limits, Active Mean Fields for Probabilistic Image Segmentation: Connections with Chan--Vese and Rudin--Osher--Fatemi Models, Convergence study on the proximal alternating direction method with larger step size, Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping, Representation and reconstruction of covariance operators in linear inverse problems, Crouzeix-Raviart approximation of the total variation on simplicial meshes, Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes, Accelerated alternating descent methods for Dykstra-like problems, A First-Order Primal-Dual Algorithm with Linesearch, An abstract convergence framework with application to inertial inexact forward-backward methods, Applying FISTA to optimization problems (with or) without minimizers, Bregman three-operator splitting methods, Image denoising using combined higher order non-convex total variation with overlapping group sparsity, Variational models for color image correction inspired by visual perception and neuroscience, Non-blind and blind deconvolution under Poisson noise using fractional-order total variation, A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method, Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments, Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach. Part II: Theoretical Analysis, Higher-Order Total Directional Variation: Imaging Applications, A review of nonlinear FFT-based computational homogenization methods, Accelerated proximal point method for maximally monotone operators, Approximating the total variation with finite differences or finite elements, On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration, An efficient multi-grid method for TV minimization problems, Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases, Variational networks: an optimal control approach to early stopping variational methods for image restoration, A convex variational model for learning convolutional image atoms from incomplete data, Unnamed Item, A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise, On starting and stopping criteria for nested primal-dual iterations, A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization, Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces, New convergence analysis of a primal-dual algorithm with large stepsizes, A new primal-dual algorithm for minimizing the sum of three functions with a linear operator, Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications, Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization, Total Variation Isoperimetric Profiles, Inexact derivative-free optimization for bilevel learning, Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm, On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting, A sub-Riemannian model of the visual cortex with frequency and phase, A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations, Semisupervised data classification via the Mumford-Shah-Potts-type model, Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations, Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval, Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Accelerated variational PDEs for efficient solution of regularized inversion problems, Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation, Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous Motion Estimation, Modern regularization methods for inverse problems, Bregman primal-dual first-order method and application to sparse semidefinite programming, Multiview attenuation estimation and correction, Dualize, split, randomize: toward fast nonsmooth optimization algorithms, Convergence results of two-step inertial proximal point algorithm, Chan-Vese reformulation for selective image segmentation, A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization, Convergence analysis of the stochastic reflected forward-backward splitting algorithm, Infimal Convolution of Data Discrepancies for Mixed Noise Removal, Image reconstruction in light-sheet microscopy: spatially varying deconvolution and mixed noise, On convergence of the Arrow-Hurwicz method for saddle point problems, DIP-VBTV: A Color Image Restoration Model Combining a Deep Image Prior and a Vector Bundle Total Variation, Generalized fractional algebraic linear system solvers, Proximal Gradient Methods for Machine Learning and Imaging, A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates, A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming, Optimal transportation, modelling and numerical simulation, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, An inexact primal-dual method with correction step for a saddle point problem in image debluring, Sliced optimal transport on the sphere, On a variational problem with a nonstandard growth functional and its applications to image processing, Linearly-convergent FISTA variant for composite optimization with duality, FISTA is an automatic geometrically optimized algorithm for strongly convex functions, The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution, Learning Regularization Parameter-Maps for Variational Image Reconstruction Using Deep Neural Networks and Algorithm Unrolling, A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems, First order inertial optimization algorithms with threshold effects associated with dry friction, Enhanced total variation minimization for stable image reconstruction, Principled analyses and design of first-order methods with inexact proximal operators, Efficient Bayesian Computation for Low-Photon Imaging Problems, A Class of Priors for Color Image Restoration Parameterized by Lie Groups Acting on Pixel Values, On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance, A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection, Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, On inertial iterated Tikhonov methods for solving ill-posed problems, Utility/privacy trade-off as regularized optimal transport, Regularization of inverse problems via time discrete geodesics in image spaces, Solving inverse problems using data-driven models, Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives, Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, Learning Consistent Discretizations of the Total Variation, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Variational Densification and Refinement of Registration Maps, Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging, Shared Prior Learning of Energy-Based Models for Image Reconstruction, A primal-dual flow for affine constrained convex optimization, An Efficient Variational Model for Multiplicative Noise Removal, New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model, Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems, Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization, Bilevel Methods for Image Reconstruction
Cites Work
- Continuous Multiclass Labeling Approaches and Algorithms
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A Parallel Splitting Method for Coupled Monotone Inclusions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Split Bregman Method for L1-Regularized Problems
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- Smooth Optimization with Approximate Gradient
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Accelerated, Parallel, and Proximal Coordinate Descent
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Maximal flow through a domain
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A generalized proximal point algorithm for certain non-convex minimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Minimum cuts and related problems
- Monotone Operators and the Proximal Point Algorithm
- Atomic Decomposition by Basis Pursuit
- Algorithm 778: L-BFGS-B
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- Finite-differences discretizations of the mumford-shah functional
- Proximal Minimization Methods with Generalized Bregman Functions
- Active contours without edges
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Closed-Form MMSE Estimation for Signal Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A Fast Parametric Maximum Flow Algorithm and Applications
- De-noising by soft-thresholding
- A Limited Memory Algorithm for Bound Constrained Optimization
- Matching pursuits with time-frequency dictionaries
- A Convex Approach to Minimal Partitions
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Fast Alternating Direction Optimization Methods
- Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
- Regularized Discrete Optimal Transport
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- Iterative Bregman Projections for Regularized Transportation Problems
- A Convex, Lower Semicontinuous Approximation of Euler's Elastica Energy
- Aspects of Total Variation RegularizedL1Function Approximation
- Learning the parts of objects by non-negative matrix factorization
- Super-Resolution With Sparse Mixing Estimators
- Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
- The Elastic Ratio: Introducing Curvature Into Ratio-Based Image Segmentation
- BM3D Frames and Variational Image Deblurring
- Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
- Analysis Operator Learning and its Application to Image Reconstruction
- Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers
- On the Convergence of Block Coordinate Descent Type Methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Optimally Sparse Multidimensional Representation Using Shearlets
- Deblurring and Denoising of Images by Nonlocal Functionals
- Signal Recovery by Proximal Forward-Backward Splitting
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Proximité et dualité dans un espace hilbertien
- The solution by iteration of nonlinear functional equations in Banach spaces
- Convex programming in Hilbert space
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- A Review of Image Denoising Algorithms, with a New One
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Total Generalized Variation
- Fast Discrete Curvelet Transforms
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Sparse Image and Signal Processing
- Convergence of a block coordinate descent method for nondifferentiable minimization
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Local calibrations for minimizers of the Mumford-Shah functional with a regular discontinuity set.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Operator splittings, Bregman methods and frame shrinkage in image processing
- A variational framework for exemplar-based image inpainting
- Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Universal gradient methods for convex optimization problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- A unified primal-dual algorithm framework based on Bregman iteration
- Compactly supported shearlets are optimally sparse
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Linear convergence of iterative soft-thresholding
- On the convergence rate of Douglas-Rachford operator splitting method
- On total variation minimization and surface evolution using parametric maximum flows
- Non-convex sparse regularisation
- A cortical based model of perceptual completion in the roto-translation space
- Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
- iPiasco: inertial proximal algorithm for strongly convex optimization
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- Sparse directional image representations using the discrete shearlet transform
- Maximum flows and minimum cuts in the plane
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Monotone (nonlinear) operators in Hilbert space
- A minimization method for the sum of a convex function and a continuously differentiable function
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Produits infinis de resolvantes
- A proximal-based deomposition method for compositions method for convex minimization problems
- Image recovery via total variation minimization and related problems
- A direct variational approach to a problem arising in image reconstruction
- Image sharpening by flows based on triple well potentials
- Regularizing flows for constrained matrix-valued images
- Local calibrations for minimizers of the Mumford-Shah functional with rectilinear discontinuity sets
- The cosparse analysis model and algorithms
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Convergence of a splitting inertial proximal method for monotone operators
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Local extremes, runs, strings and multiresolution. (With discussion)
- The calibration method for the Mumford-Shah functional and free-discontinuity problems
- An algorithm for mean curvature motion
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- Soap films and covering spaces
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Error forgetting of Bregman iteration
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Optimality bounds for a variational relaxation of the image partitioning problem
- Total cyclic variation and generalizations
- Convex relaxation of a class of vertex penalizing functionals
- Fast dual minimization of the vectorial total variation norm and applications to color image processing
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Adaptive restart for accelerated gradient schemes
- Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
- Image restoration with discrete constrained total variation. I: Fast and exact optimization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Multiplier and gradient methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Duality and Convex Programming
- Collaborative Total Variation: A General Framework for Vectorial TV Models
- Inexact Bregman iteration with an application to Poisson data reconstruction
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- Accelerated and Inexact Forward-Backward Algorithms
- A Generalized Forward-Backward Splitting
- Tight Convex Relaxations for Vector-Valued Labeling
- A Nonlocal Bayesian Image Denoising Algorithm
- Convex Relaxation of Vectorial Problems with Coupled Regularization
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Splitting Methods in Signal Processing
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Fast Multiple-Splitting Algorithms for Convex Optimization
- The Natural Vectorial Total Variation Which Arises from Geometric Measure Theory
- Variational Analysis in Sobolev and BV Spaces
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- An Upwind Finite-Difference Method for Total Variation–Based Image Smoothing
- Robust principal component analysis?
- Optimal approximations by piecewise smooth functions and associated variational problems
- Learning the Morphological Diversity
- A Singular Value Thresholding Algorithm for Matrix Completion
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Global Solutions of Variational Models with Convex Regularization
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Over-relaxation of the fast iterative shrinkage-thresholding algorithm with variable stepsize