\textit{Kernel cuts}: kernel and spectral clustering meet regularization
From MaRDI portal
Publication:2193808
DOI10.1007/s11263-018-1115-1zbMath1464.62331OpenAlexW2894025224WikidataQ129196564 ScholiaQ129196564MaRDI QIDQ2193808
Yuri Boykov, Ismail Ben Ayed, Dmitrii Marin, Meng Tang
Publication date: 20 August 2020
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11263-018-1115-1
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inference from stochastic processes and spectral analysis (62M15)
Related Items
Uses Software
Cites Work
- Fast approximate energy minimization with label costs
- Semi-supervised graph clustering: a kernel approach
- A comparative evaluation of interactive segmentation algorithms
- Geodesic active contours
- An algorithm for total variation minimization and applications
- Technical note: Some properties of splitting criteria
- Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Optimal approximations by piecewise smooth functions and associated variational problems
- Markov Random Field Modeling in Image Analysis
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Active contours without edges
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- A Region Merging Prior for Variational Level Set Image Segmentation
- Effective Level Set Image Segmentation With a Kernel Induced Data Term
- Nonlinear Programming
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- Contour and texture analysis for image segmentation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
