Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
type: Item
instance of: scholarly article
title: Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
zbMATH Open document ID: 1390.90624
author: Le Thi Hoai An
author: Pham Dinh Tao
published in: Optimization and Engineering
publication date: 2018-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 62M40
Mathematics Subject Classification ID: 94A13
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6890514
zbMATH Keywords: image restoration
zbMATH Keywords: Markov random field model
zbMATH Keywords: DC programming
zbMATH Keywords: DCA
zbMATH Keywords: smooth/nonsmooth nonconvex programming
zbMATH Keywords: GNC
zbMATH Keywords: graph-cut method
describes a project that uses: NEOS
describes a project that uses: LOQO
MaRDI profile type: Publication
full work available at URL: s11081-017-9359-0
OpenAlex ID: W2621285315
Wikidata QID: Q113106671
cites work: An iterative method for Bayesian Gauss-Markov image restoration
cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Q5689624
cites work: Q4421360
cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: Self-organizing maps by difference of convex functions optimization
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Optimization based DC programming and DCA for hierarchical clustering
cites work: A new efficient algorithm based on DC programming and DCA for clustering
cites work: Combined SVM-based feature selection and classification
cites work: Binary classification via spherical separator by DC programming and DCA
cites work: Multicategory ψ-Learning
cites work: New and efficient DCA based algorithms for minimum sum-of-squares clustering
cites work: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
cites work: A DC Programming Approach for Finding Communities in Networks
cites work: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
cites work: DC approximation approaches for sparse optimization
cites work: Weakly constrained minimization: application to the estimation of images and signals involving constant regions
cites work: Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
cites work: Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
cites work: Q4414854
cites work: On ψ-Learning
cites work: LOQO:an interior point code for quadratic programming
cites work: Prior Learning and Convex-Concave Regularization of Binary Tomography
DOI: 10.1007/S11081-017-9359-0
description: scientific article; zbMATH DE number 6890514