Scribd
Upload
23 views12 pages

An Introduction To Graph-Cut

Graph cut is an algorithm used for finding a globally optimal segmentation solution, also known as Min-cut, which is equivalent to Max-flow. It involves partitioning a graph into two disjoint sets and calculating the dissimilarity based on the total weight of removed edges. The document discusses the applications of graph cuts in segmentation and highlights the existence of polynomial and approximation algorithms for different scenarios.

Uploaded by

indrajeet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
23 views12 pages

An Introduction To Graph-Cut

Graph cut is an algorithm used for finding a globally optimal segmentation solution, also known as Min-cut, which is equivalent to Max-flow. It involves partitioning a graph into two disjoint sets and calculating the dissimilarity based on the total weight of removed edges. The document discusses the applications of graph cuts in segmentation and highlights the existence of polynomial and approximation algorithms for different scenarios.

Uploaded by

indrajeet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

An Introduction to Graph-

Cut
What is Graph Cut?
Graph-cut is an algorithm that finds a globally optimal
segmentation solution.
Also know as Min-cut.
Equivalent to Max-flow.
What is a “cut”?
• A graph G = (V,E) can be partitioned into two disjoint sets
A, B, A  B  V , A  B  0
by simply removing edges connecting the two parts.
• The degree of dissimilarity between these two pieces can be
computed as total weight of the edges that have been removed.
• In graph theoretic language it is called the cut:
cut( A, B)   w(u, v)
uA,vB
Example of Cut
Finding the Minimum-cut
What do graph cuts provide?
For less interesting V, polynomial algorithm for global
minimum!
For a particularly interesting V, approximation algorithm
Proof of NP hardness
For many choices of V, algorithms that find a “strong” local
minimum
Very strong experimental results
Graph Cut based Segmentation

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy