Comparison of minimization methods for nonsmooth image segmentation
type: Item
instance of: scholarly article
title: Comparison of minimization methods for nonsmooth image segmentation
zbMATH Open document ID: 1391.94056
published in: Communications in Applied and Industrial Mathematics
publication date: 2018-06-20T00:00:00Z
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6891987
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: first order methods
zbMATH Keywords: image segmentation
author: Laura Antonelli
author: V. De Simone
describes a project that uses: BSDS
MaRDI profile type: Publication
full work available at URL: caim-2018-0005
OpenAlex ID: W2798123701
cites work: Active contours without edges
cites work: Optimal approximations by piecewise smooth functions and associated variational problems
cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Coupling image restoration and segmentation: a generalized linear model/Bregman perspective
cites work: On the application of the spectral projected gradient method in image segmentation
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Two-Point Step Size Gradient Methods
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Geometric applications of the split Bregman method: segmentation and surface reconstruction
cites work: Q5580053
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Q3320132
DOI: 10.1515/CAIM-2018-0005
description: scientific article; zbMATH DE number 6891987