SPARSE TEMPLATE-BASED VARIATIONAL IMAGE SEGMENTATION

DOI10.1142/S1793536911000805zbMath1236.94016OpenAlexW2048513844MaRDI QIDQ3101551

Christoph Schnörr, Jan Lellmann, Dirk Breitenreicher

Publication date: 29 November 2011

Published in: Advances in Adaptive Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793536911000805

zbMATH Keywords

image segmentationlarge-scale convex programmingNesterov methodfast primal-dual methodshape template learning

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Smooth minimization of non-smooth functions
• A modification of the Arrow-Hurwicz method for search of saddle points
• Shape statistics in kernel space for variational image segmentation.
• Diffusion snakes: Introducing statistical shape knowledge into the Mumford-Shah functional
• A multiphase dynamic labeling model for variational recognition-driven image segmentation
• Atomic Decomposition by Basis Pursuit
• Optimal approximations by piecewise smooth functions and associated variational problems
• Compressed sensing and best 𝑘-term approximation
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation