On the application of the spectral projected gradient method in image segmentation

DOI10.1007/s10851-015-0591-yzbMath1353.68284OpenAlexW1452724831WikidataQ58832710 ScholiaQ58832710MaRDI QIDQ268708

Laura Antonelli, Valentina De Simone, Daniela di Serafino

Publication date: 15 April 2016

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-015-0591-y

zbMATH Keywords

image segmentationregion-based variational modelspectral projected gradient

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10)

Related Items (11)

Comparison of minimization methods for nonsmooth image segmentation ⋮ Split Bregman iteration for multi-period mean variance portfolio optimization ⋮ Gradient method with multiple damping for large-scale unconstrained optimization ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ A family of modified spectral projection methods for nonlinear monotone equations with convex constraint ⋮ Modification of TV-ROF denoising model based on split Bregman iterations ⋮ Using gradient directions to get global convergence of Newton-type methods ⋮ A coordinate descent method for total variation minimization ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ Semi-supervised generalized eigenvalues classification ⋮ A view of computational models for image segmentation

Uses Software

• SPG
• RecPF

Cites Work

• Unnamed Item
• Operator splittings, Bregman methods and frame shrinkage in image processing
• Variational image segmentation models involving non-smooth data-fidelity terms
• An efficient gradient method using the Yuan steplength
• Duality-based algorithms for total-variation-regularized image restoration
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• A limited memory steepest descent method
• On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
• An algorithm for total variation minimization and applications
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Analysis of monotone gradient methods
• Completely convex formulation of the Chan-Vese image segmentation model
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Dual norms and image decomposition models
• On spectral properties of steepest descent methods
• High-Dimension Multilabel Problems: Convex or Nonconvex Relaxation?
• Optimal approximations by piecewise smooth functions and associated variational problems
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• A scaled gradient projection method for constrained image deblurring
• Two-Point Step Size Gradient Methods
• Active contours without edges
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique for Newton’s Method
• Algorithm 813

This page was built for publication: On the application of the spectral projected gradient method in image segmentation