A DC optimization-based clustering technique for edge detection
From MaRDI portal
Publication:519782
DOI10.1007/S11590-016-1031-7zbMATH Open1366.90170OpenAlexW2343766162WikidataQ62473062 ScholiaQ62473062MaRDI QIDQ519782FDOQ519782
Authors: Manlio Gaudioso, Walaa Khalaf, Annabella Astorino, Paolo D'Alessandro 
Publication date: 5 April 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1031-7
Recommendations
- Clustered entropy for edge detection
- A Novel Scheme Based on the Diffusion to Edge Detection
- Edge detection in digital images using ant colony optimization
- A novel edge detection method based on the maximizing objective function
- Multispectral image edge detection via Clifford gradient
- Edge detection of a multispectral image based on Clifford algebra
Cites Work
- Title not available (Why is that?)
- An introduction to support vector machines and other kernel-based learning methods.
- Polyhedral separability through successive LP
- DC models for spherical separation
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Title not available (Why is that?)
- Margin maximization in spherical separation
- Edge detection by spherical separation
- Ellipsoidal separation for classification problems
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Title not available (Why is that?)
- Edge detection techniques: Evaluations and comparisons
Cited In (12)
- Edge detection by spherical separation
- Ellipsoidal classification via semidefinite programming
- An augmented subgradient method for minimizing nonsmooth DC functions
- A bundle-type method for nonsmooth DC programs
- DC programming and DCA: thirty years of developments
- Edge measures using similarity regions
- Sequential difference-of-convex programming
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- Classification in the multiple instance learning framework via spherical separation
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- Polyhedral separation via difference of convex (DC) programming
This page was built for publication: A DC optimization-based clustering technique for edge detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519782)
