A spatially continuous max-flow and min-cut framework for binary labeling problems (Q2454034): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00211-013-0569-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970535101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examples of max-flow and min-cut problems with duality gaps in continuous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization for continuous multiphase partitioning problems using a dual approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binary level set model and some applications to Mumford-Shah image segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for total variation minimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Continuous Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of the split Bregman method: segmentation and surface reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural discretizations for the divergence, gradient, and curl on logically rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the level set method and applications to image segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Mathematical Models in Computer Vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal flow through a domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Flows and Minimum Cuts in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spatially continuous max-flow and min-cut framework for binary labeling problems / rank
 
Normal rank

Latest revision as of 15:30, 8 July 2024

scientific article
Language Label Description Also known as
English
A spatially continuous max-flow and min-cut framework for binary labeling problems
scientific article

    Statements

    A spatially continuous max-flow and min-cut framework for binary labeling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2014
    0 references
    binary labeling problems
    0 references
    max-flow/min-cut models
    0 references
    image segmentation
    0 references
    optimization
    0 references
    primal/dual problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references