Global binary optimization on graphs for classification of high-dimensional data
From MaRDI portal
Publication:890097
DOI10.1007/S10851-015-0567-YzbMATH Open1333.90111OpenAlexW1977309280MaRDI QIDQ890097FDOQ890097
Authors: Ekaterina Merkurjev, Egil Bae, Andrea L. Bertozzi, 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
Recommendations
- Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Graph-based optimization approaches for machine learning, uncertainty quantification and networks
- An MBO scheme on graphs for classification and image processing
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularization on graphs with function-adapted diffusion processes
- The Split Bregman Method for L1-Regularized Problems
- A Review of Image Denoising Algorithms, with a New One
- An algorithm for total variation minimization and applications
- Nonlocal Operators with Applications to Image Processing
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
- Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
- An MBO scheme on graphs for classification and image processing
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Learning Theory
- A new approach to the maximum-flow problem
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Active contours without edges
- Title not available (Why is that?)
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Discrete calculus. Applied analysis on graphs for computational science
- Training invariant support vector machines
- Image segmentation using some piecewise constant level set methods with MBO type of projection
- Title not available (Why is that?)
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- Combinatorial continuous maximum flow
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- Efficient convex optimization for minimal partition problems with volume constraints
- A method based on total variation for network modularity optimization using the MBO scheme
Cited In (17)
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
- Simplified energy landscape for modularity using total variation
- Stochastic block models are a discrete surface tension
- An efficient and versatile variational method for high-dimensional data classification
- The Potts model with different piecewise constant representations and fast algorithms: a survey
- Theoretical analysis of flows estimating eigenfunctions of one-homogeneous functionals
- Graph-based optimization approaches for machine learning, uncertainty quantification and networks
- A fast MBO scheme for multiclass data classification
- Diffuse interface models on graphs for classification of high dimensional data
- Comparisons of different methods for balanced data classification under the discrete non-local total variational framework
- Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model
- Semisupervised data classification via the Mumford-Shah-Potts-type model
- Double-well net for image segmentation
- 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
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
Uses Software
This page was built for publication: Global binary optimization on graphs for classification of high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890097)
