Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
From MaRDI portal
Recommendations
- Optimization of max-norm objective functions in image processing and computer vision
- When can \(l_p\)-norm objective functions be minimized via graph cuts?
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- scientific article; zbMATH DE number 1849127
- scientific article; zbMATH DE number 7364985
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A note on two problems in connexion with graphs
- Extending the Power Watershed Framework Thanks to \Gamma-Convergence
- Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
- Introduction to algorithms.
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimization of max-norm objective functions in image processing and computer vision
- Strict minimizers for geometric optimization
Cited in
(5)- Efficient hierarchical multi-object segmentation in layered graphs
- Self-driven algorithm for solving supermodular (,+) labeling problems based on subgradient descent
- Toward a sparsity theory on weighted lattices
- Optimization of max-norm objective functions in image processing and computer vision
- A general algorithmic pattern for finding lexicographic max-ordering solutions to combinatorial multicriteria optimization problems
This page was built for publication: Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203352)
