Reduced Graphs for Min-Cut/Max-Flow Approaches in Image Segmentation

Electronic Notes in Discrete Mathematics - Netherlands
doi 10.1016/j.endm.2011.05.012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Clutters That Pack and the Max Flow Min Cut Property: A Conjecture

1993English

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms

1989English

Max Cut for Random Graphs With a Planted Partition

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2004English

Superpixel Cut for Figure-Ground Image Segmentation

ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
InstrumentationEarthPlanetary SciencesEnvironmental Science
2016English

Partitioning Planar Graphs: A Fast Combinatorial Approach for Max-Cut

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

An Extension of Min/Max Flow Framework

Image and Vision Computing
ElectricalComputer VisionSignal ProcessingPattern RecognitionElectronic Engineering
2009English

Local Approximability of Max-Min and Min-Max Linear Programs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2010English

Flow-Cut Gaps and Face Covers in Planar Graphs

2019English

Stabilized MAX-MIN Flow Control Using PID and PII2 Controllers

IEICE Transactions on Communications
Computer NetworksElectronic EngineeringSoftwareElectricalCommunications
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy