Global binary optimization on graphs for classification of high-dimensional data
From MaRDI portal
Publication:890097
DOI10.1007/s10851-015-0567-yzbMath1333.90111OpenAlexW1977309280MaRDI QIDQ890097
Andrea L. Bertozzi, Ekaterina Merkurjev, Egil Bae, Xue-Cheng Tai
Publication date: 9 November 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/1vr5w0td
Related Items
Comparisons of different methods for balanced data classification under the discrete non-local total variational framework ⋮ Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data ⋮ Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model ⋮ Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds ⋮ An effective region force for some variational models for learning and clustering ⋮ Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images ⋮ Stochastic block models are a discrete surface tension ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ Theoretical Analysis of Flows Estimating Eigenfunctions of One-Homogeneous Functionals ⋮ Diffuse Interface Models on Graphs for Classification of High Dimensional Data ⋮ Semisupervised data classification via the Mumford-Shah-Potts-type model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- Image segmentation using some piecewise constant level set methods with MBO type of projection
- An algorithm for total variation minimization and applications
- \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
- Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- An MBO Scheme on Graphs for Classification and Image Processing
- Combinatorial Continuous Maximum Flow
- Nonlocal Operators with Applications to Image Processing
- The Split Bregman Method for L1-Regularized Problems
- Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Discrete Calculus
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- A new approach to the maximum-flow problem
- Active contours without edges
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- A Method Based on Total Variation for Network Modularity Optimization Using the MBO Scheme
- Learning Theory
- A Review of Image Denoising Algorithms, with a New One
- Training invariant support vector machines
