Comparison of minimization methods for nonsmooth image segmentation

DOI10.1515/CAIM-2018-0005MaRDI QIDQ1642276zbMATH OpenOpenAlexFDO

Authors Laura Antonelli, V. De Simone

Publication date 20 June 2018

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

image segmentationnonsmooth optimizationfirst order methods

Mathematics Subject Classification ID

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

Recommendations

• Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
• Completely convex formulation of the Chan-Vese image segmentation model
• Efficient nonsmooth nonconvex optimization for image restoration and segmentation
• Variational image segmentation models involving non-smooth data-fidelity terms
• Convex non-convex image segmentation

Cites work

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

Cited in

(9)

• l₁-regularization for multi-period portfolio selection
• Fused Lasso approach in portfolio selection
• An active contour model for texture image segmentation using Rényi divergence measure
• A Minimum Description Length-Based Image Segmentation Procedure, and Its Comparison with a Cross-Validation-Based Segmentation Procedure
• Adaptive \(l_1\)-regularization for short-selling control in portfolio selection
• Completely convex formulation of the Chan-Vese image segmentation model
• Split Bregman iteration for multi-period mean variance portfolio optimization
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• A view of computational models for image segmentation

Describes a project that uses

Uses Software

• BSDS

This page was built for publication: Comparison of minimization methods for nonsmooth image segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642276)