Bilevel optimization for calibrating point spread functions in blind deconvolution
From MaRDI portal
Publication:256105
DOI10.3934/ipi.2015.9.1139zbMath1343.49023OpenAlexW4230389606WikidataQ115155133 ScholiaQ115155133MaRDI QIDQ256105
Publication date: 9 March 2016
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2015.9.1139
image processingprojected gradient methodblind deconvolutionbilevel optimizationequilibrium constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Methods involving semicontinuity and convergence; relaxation (49J45)
Related Items
Optimality Conditions for Bilevel Imaging Learning Problems with Total Variation Regularization ⋮ Bilevel Imaging Learning Problems as Mathematical Programs with Complementarity Constraints: Reformulation and Theory ⋮ Linearly convergent bilevel optimization with single-step inner methods ⋮ Optimal selection of the regularization function in a weighted total variation model. I: Modelling and theory ⋮ Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests ⋮ Bilevel parameter learning for higher-order total variation regularisation models ⋮ Tensor completion via bilevel minimization with fixed-point constraint to estimate missing elements in noisy data ⋮ Bilevel parameter learning for nonlocal image denoising models ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ Modern regularization methods for inverse problems ⋮ Solving inverse problems using data-driven models ⋮ A geometric integration approach to nonsmooth, nonconvex optimisation ⋮ An optimal bilevel optimization model for the generalized total variation and anisotropic tensor parameters selection ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel Methods for Image Reconstruction
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Blind motion deblurring using multiple images
- Robinson's implicit function theorem and its extensions
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- Image denoising: learning the noise model via nonsmooth PDE-constrained optimization
- Direct Blind Deconvolution
- Solution Sensitivity from General Principles
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A Bilevel Optimization Approach for Parameter Learning in Variational Models
- Nonconvex TV$^q$-Models in Image Restoration: Analysis and a Trust-Region Regularization--Based Superlinearly Convergent Solver
- Mathematical Programs with Complementarity Constraints in Function Space: C- and Strong Stationarity and a Path-Following Algorithm
- False Characteristic Functions and Other Pathologies in Variational Blind Deconvolution. A Method of Recovery
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Strongly Regular Generalized Equations
- An active set strategy based on the augmented Lagrangian formulation for image restoration
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Variational Analysis
- A Generalized Mathematical Program with Equilibrium Constraints
- The APEX Method in Image Sharpening and the Use of Low Exponent Lévy Stable Laws
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
- Blind and Semi-Blind Deblurring of Natural Images
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- A non-iterative regularization approach to blind deconvolution
- Image Processing and Analysis
- Sensitivity Analysis of Parameterized Variational Inequalities
- Mathematical Programs with Equilibrium Constraints
- Blind Image Deconvolution
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
- Regularization methods for blind deconvolution and blind source separation problems
This page was built for publication: Bilevel optimization for calibrating point spread functions in blind deconvolution
