On the application of the spectral projected gradient method in image segmentation
DOI10.1007/S10851-015-0591-YzbMATH Open1353.68284DBLPjournals/jmiv/AntonelliSS16OpenAlexW1452724831WikidataQ58832710 ScholiaQ58832710MaRDI QIDQ268708FDOQ268708
Authors: Laura Antonelli, V. De Simone, D. 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
Recommendations
- Convergence properties of nonmonotone spectral projected gradient methods
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A modified spectral conjugate gradient projection algorithm for total variation image restoration
- New convergence results for the scaled gradient projection method
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Computing methodologies for image processing (68U10)
Cites Work
- Algorithm 813
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Two-Point Step Size Gradient Methods
- The Split Bregman Method for L1-Regularized Problems
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Dual norms and image decomposition models
- Optimal approximations by piecewise smooth functions and associated variational problems
- Title not available (Why is that?)
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- A scaled gradient projection method for constrained image deblurring
- A Nonmonotone Line Search Technique for Newton’s Method
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- Analysis of monotone gradient methods
- Completely convex formulation of the Chan-Vese image segmentation model
- On spectral properties of steepest descent methods
- High-dimension multilabel problems: convex or nonconvex relaxation?
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Active contours without edges
- 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
- A limited memory steepest descent method
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
Cited In (13)
- Semi-supervised generalized eigenvalues classification
- A coordinate descent method for total variation minimization
- Modification of TV-ROF denoising model based on split Bregman iterations
- Comparison of minimization methods for nonsmooth image segmentation
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- Using gradient directions to get global convergence of Newton-type methods
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- Title not available (Why is that?)
- On the steplength selection in gradient methods for unconstrained optimization
- Split Bregman iteration for multi-period mean variance portfolio optimization
- Gradient method with multiple damping for large-scale unconstrained optimization
- A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
- A view of computational models for image segmentation
Uses Software
This page was built for publication: On the application of the spectral projected gradient method in image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268708)
