scientific article; zbMATH DE number 2062604
From MaRDI portal
Publication:4459498
Recommendations
Cited in
(71)- The analysis of the color similarity problem in moving object detection
- New algorithms for convex cost tension problem with application to computer vision
- On a general framework for network representability in discrete optimization
- Image labeling by assignment
- Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
- Conditional random fields for pattern recognition applied to structured data
- Quadtree-based genetic algorithm and its applications to computer vision
- Multi-label moves for MRFs with truncated convex priors
- Fast structured prediction using large margin sigmoid belief networks
- On learning conditional random fields for stereo
- Minimizing energies with hierarchical costs
- Branch-and-mincut: global optimization for image segmentation with high-level priors
- Consistent binocular depth and scene flow with chained temporal profiles
- Graph cuts based tomography enhanced by shape orientation
- 3D reconstruction with depth prior using graph-cut
- Mincut sensitivity data structures for the insertion of an edge
- Iterative multiplicative filters for data labeling
- Multilayer joint segmentation using MRF and graph cuts
- Guest editorial: Energy optimization methods
- Testing statistical hypothesis on random trees and applications to the protein classification problem
- Image segmentation by iterative optimization of multiphase multiple piecewise constant model and Four-Color relabeling
- A variational approach to vesicle membrane reconstruction from fluorescence imaging
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- A surface reconstruction method using global graph cut optimization
- Reduced graphs for min-cut/max-flow approaches in image segmentation
- Exact solutions for discrete graphical models. Multicuts and reduction techniques
- Efficient three-dimensional scene modeling and mosaicing
- Anytime online novelty and change detection for mobile robots
- Learning watershed cuts energy functions
- An improved Riemannian metric approximation for graph cuts
- Variational surface reconstruction based on Delaunay triangulation and graph cut
- On the effects of normalization in adaptive MRF hierarchies
- Robust correspondence recognition for computer vision
- Global minimization for continuous multiphase partitioning problems using a dual approach
- Random exploration of the procedural space for single-view 3D modeling of buildings
- Stereoscopic scene flow computation for 3D motion understanding
- Gradient flows for optimizing triangular mesh-based surfaces: applications to 3D reconstruction problems dealing with visibility
- Fast approximate energy minimization with label costs
- Domain decomposition methods with graph cuts algorithms for total variation minimization
- scientific article; zbMATH DE number 2062605 (Why is no real title available?)
- High Dimensional Consistent Digital Segments
- Active mean fields for probabilistic image segmentation: connections with Chan-Vese and Rudin-Osher-Fatemi models
- Graph cuts in segmentation of a left ventricle from MRI data
- Cut pursuit: fast algorithms to learn piecewise constant functions on general weighted graphs
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- scientific article; zbMATH DE number 1844608 (Why is no real title available?)
- scientific article; zbMATH DE number 1849127 (Why is no real title available?)
- Energy minimization methods
- A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0<p\leq 1\)
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Detecting bots and assessing their impact in social networks
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- Hybrid VCSPs with crisp and valued conservative templates
- Quadratic reformulations of nonlinear binary optimization problems
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Diffusion methods for classification with pairwise relationships
- Optimization of max-norm objective functions in image processing and computer vision
- scientific article; zbMATH DE number 2202241 (Why is no real title available?)
- scientific article; zbMATH DE number 2208895 (Why is no real title available?)
- Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
- When can \(l_p\)-norm objective functions be minimized via graph cuts?
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- Bayesian moving object detection in dynamic scenes using an adaptive foreground model
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- On total variation minimization and surface evolution using parametric maximum flows
- Global binary optimization on graphs for classification of high-dimensional data
- SymStereo: stereo matching using induced symmetry
- A reduction method for graph cut optimization
- Stepwise approach for view synthesis
- Shape from shading using graph cuts
- Bisection approach for pixel labelling problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459498)
