Comparison of minimization methods for nonsmooth image segmentation

DOI10.1515/caim-2018-0005zbMath1391.94056OpenAlexW2798123701MaRDI QIDQ1642276

Valentina De Simone, Laura Antonelli

Publication date: 20 June 2018

Published in: Communications in Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/caim-2018-0005

zbMATH Keywords

nonsmooth optimizationimage segmentationfirst order methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

\(l_1\)-regularization for multi-period portfolio selection, Split Bregman iteration for multi-period mean variance portfolio optimization, Adaptive \(l_1\)-regularization for short-selling control in portfolio selection, Fused Lasso approach in portfolio selection, A view of computational models for image segmentation, AN ACTIVE CONTOUR MODEL FOR TEXTURE IMAGE SEGMENTATION USING RÉNYI DIVERGENCE MEASURE

Uses Software

• BSDS

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the application of the spectral projected gradient method in image segmentation
• Coupling image restoration and segmentation: a generalized linear model/Bregman perspective
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Optimal approximations by piecewise smooth functions and associated variational problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Two-Point Step Size Gradient Methods
• New Proximal Point Algorithms for Convex Minimization
• Active contours without edges
• A Nonmonotone Line Search Technique for Newton’s Method