Comparison of minimization methods for nonsmooth image segmentation
DOI10.1515/CAIM-2018-0005zbMATH Open1391.94056OpenAlexW2798123701MaRDI QIDQ1642276FDOQ1642276
Authors: Laura Antonelli, V. De Simone 
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
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
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)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- 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
- A Nonmonotone Line Search Technique for Newton’s Method
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- On the application of the spectral projected gradient method in image segmentation
- Active contours without edges
- Coupling image restoration and segmentation: a generalized linear model/Bregman perspective
- New Proximal Point Algorithms for Convex Minimization
Cited In (9)
- \(l_1\)-regularization for multi-period portfolio selection
- An active contour model for texture image segmentation using Rényi divergence measure
- Fused Lasso approach in portfolio selection
- 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
Uses Software
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)
