Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
From MaRDI portal
Publication:1642987
DOI10.1007/s11081-017-9359-0zbMath1390.90624OpenAlexW2621285315WikidataQ113106671 ScholiaQ113106671MaRDI QIDQ1642987
Publication date: 18 June 2018
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-017-9359-0
DCAimage restorationDC programmingMarkov random field modelgraph-cut methodGNCsmooth/nonsmooth nonconvex programming
Random fields; image analysis (62M40) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Detection theory in information and communication theory (94A13)
Related Items
Announcement: Howard Rosenbrock Prize 2020 ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Announcement: Howard Rosenbrock prize 2021 ⋮ Announcement: Howard Rosenbrock Prize 2022 ⋮ Announcement: Howard Rosenbrock Prize 2019 ⋮ DC programming and DCA: thirty years of developments ⋮ A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging ⋮ Announcement: Howard Rosenbrock Prize 2017 ⋮ Announcement: Howard Rosenbrock Prize 2018 ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DC approximation approaches for sparse optimization
- Self-organizing maps by difference of convex functions optimization
- An iterative method for Bayesian Gauss-Markov image restoration
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Weakly constrained minimization: application to the estimation of images and signals involving constant regions
- A new efficient algorithm based on DC programming and DCA for clustering
- Binary classification via spherical separator by DC programming and DCA
- Optimization based DC programming and DCA for hierarchical clustering
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- On ψ-Learning
- LOQO:an interior point code for quadratic programming
- A DC Programming Approach for Finding Communities in Networks
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Multicategory ψ-Learning
- Combined SVM-based feature selection and classification
