Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs
From MaRDI portal
Publication:4689639
DOI10.1137/17M1113436zbMath1401.90157MaRDI QIDQ4689639
Guillaume Obozinski, Loïc Landrieu
Publication date: 17 October 2018
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Directional data; spatial statistics (62H11) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mathematical programming (90C99)
Related Items
The DFS Fused Lasso: Linear-Time Denoising over General Graphs, Active-set Methods for Submodular Minimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- The Adaptive Lasso and Its Oracle Properties
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- On total variation minimization and surface evolution using parametric maximum flows
- An inertial forward-backward algorithm for monotone inclusions
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Constraints on deformable models: Recovering 3D shape and nonrigid motion
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- A note on cluster analysis and dynamic programming
- A multiphase level set framework for image segmentation using the Mumford and Shah model
- Least angle regression. (With discussion)
- The convex geometry of linear inverse problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Optimal segmentation of unbounded functions
- An overview of the Mumford-Shah problem
- Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs
- A Generalized Forward-Backward Splitting
- Optimization with Sparsity-Inducing Penalties
- Optimal approximations by piecewise smooth functions and associated variational problems
- Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
- Total Variation on a Tree
- Total variation and level set methods in image science
- Maximum likelihood detection and estimation of Bernoulli - Gaussian processes
- Minimum cuts and related problems
- Active contours without edges
- Image Segmentation Using Active Contours: Calculus of Variations or Shape Gradients?
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Forward–Backward Greedy Algorithms for Atomic Norm Regularization
- Mumford and Shah Model and its Applications to Image Segmentation andImage Restoration
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Learning with Submodular Functions: A Convex Optimization Perspective
- On Nonlinear Fractional Programming
- Convex Analysis
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
