In this article, *interactive image segmentation* with *graph-cut* is going to be discussed. and it will be used to segment the source object from the background in an image. This segmentation technique was proposed by Boycov and Jolli in this paper.

Let’s implement “*intelligent paint*” interactive segmentation tool using graph cuts algorithm on a *weighted image grid*. Our task will be to separate the foreground object from the background in an image.

Since it can be difficult sometimes to automatically define what’s *foreground* and what’s *background* for an image, the user is going to help us with a few interactive scribble lines using which our algorithm is going to identify the foreground and the background, after that it will be the algorithms job to obtain a complete segmentation of the foreground from the background image.

The following figures show how an input image gets scribbling from a user with two different colors (which is also going to be input to our algorithm) and the ideal segmented image output.

**Scribbled Input Image Expected Segmented Output Image**

The following describes how the segmentation problem is transformed into a graph-cut problem:

- Let’s first define the
*Directed**Graph*as follows:**G = (V, E)**- Each of the
*pixels*in the image is going to be a*vertex*in the graph. There will be another couple of specialvertices: a*terminal*(corresponds to the*source vertex**foreground*object) and a*sink*(corresponds to the background object in the image). Hence,**vertex**.**|V(G)| = width x height + 2** - Next, let’s defines the
*edges*of the graph. As obvious, there is going to be two types of edges:(edges that connect the terminal nodes to the non-terminal nodes) and non-terminal (edges that connect the non-terminal nodes only).**terminal** - There will be a
*directed edge*from the*terminal node*to each of non-terminal nodes in the graph. Similarly, a**source***directed edge*will be there from each non-terminal node (pixel) to the other*terminal node*. These are going to be all the terminal edges and hence,**sink**.**|****E_T(G)****| = 2 x width x height** - Each of the non-terminal nodes (pixels) are going to be connected by edges with the nodes corresponding to the
*neighboring pixels*(defined by 4 or 8 neighborhood of a pixel). Hence,**|***E_N(G)*.**| = |****Nb****d| x width x height**

- Each of the
- Now let’s describe how to compute the
*edge weights*in this graph.- In order to compute the
*terminal*edge weights, we need to estimate the feature distributions first, i.e., starting with the assumption that each of the nodes corresponding to the scribbled pixels have the probability 1.0 (since we want the solution to respect the regional hard constraints marked by the user-seeds / scribbles) to be in foreground or background object in the image (distinguished by the scribble color, e.g.), we have to compute the probability that a node belongs to the foreground (or background) for all the other non-terminal nodes. - The simplest way to compute and is to first fit a couple of
*Gaussian distributions*on the scribbles by computing the*parameters*with

(μ, ∑)*MLE*from the scribbled pixel intensities and then computing the*(class-conditional)*probabilities from the individual*pdfs*(followed by a normalization) for each of the pixels as shown in the next figures. The following code fragment show how the pdfs are being computed.123456789101112131415161718192021222324252627`import`

`numpy as np`

`from`

`collections`

`import`

`defaultdict`

`def`

`compute_pdfs(imfile, imfile_scrib):`

`'''`

`# Compute foreground and background pdfs`

`# input image and the image with user scribbles`

`'''`

`rgb`

`=`

`mpimg.imread(imfile)[:,:,:`

`3`

`]`

`yuv`

`=`

`rgb2yiq(rgb)`

`rgb_s`

`=`

`mpimg.imread(imfile_scrib)[:,:,:`

`3`

`]`

`yuv_s`

`=`

`rgb2yiq(rgb_s)`

`# find the scribble pixels`

`scribbles`

`=`

`find_marked_locations(rgb, rgb_s)`

`imageo`

`=`

`np.zeros(yuv.shape)`

`# separately store background and foreground scribble pixels in the dictionary comps`

`comps`

`=`

`defaultdict(`

`lambda`

`:np.array([]).reshape(`

`0`

`,`

`3`

`))`

`for`

`(i, j)`

`in`

`scribbles:`

`imageo[i,j,:]`

`=`

`rgbs[i,j,:]`

`# scribble color as key of comps`

`comps[`

`tuple`

`(imageo[i,j,:])]`

`=`

`np.vstack([comps[`

`tuple`

`(imageo[i,j,:])], yuv[i,j,:]])`

`mu, Sigma`

`=`

`{}, {}`

`# compute MLE parameters for Gaussians`

`for`

`c`

`in`

`comps:`

`mu[c]`

`=`

`np.mean(comps[c], axis`

`=`

`0`

`)`

`Sigma[c]`

`=`

`np.cov(comps[c].T)`

`return`

`(mu, Sigma)`

3. In order to compute the

*non-terminal*edge weights, we need to compute the similarities in between a pixel node and the nodes corresponding to its neighborhood pixels, e.g., with the formula shown in the next figures (e.g., how similar neighborhood pixels are in RGB / YIQ space).

- In order to compute the
- Now that the underlying graph is defined, the segmentation of the foreground from the background image boils down to computing the
in the graph or equivalently computing the**min-cut**(the dual problem) from the**max-flow***source*to*sink*. - The intuition is that the
*min-cut solution*will keep the pixels with high probabilities to belong to the side of the source (foreground) node and likewise the background pixels on the other side of the cut near the sink (background) node, since it’s going to respect the (relatively) high-weight edges (by not going through the highly-similar pixels). - There are several standard algorithms, e.g.,
(by finding an*Ford-Fulkerson**augmenting path*with*O*(*E*max|*f*|) time complexity) or(by using*Edmonds-Karp**bfs*to find the shortest augmenting path, with O(VE^{2}) time complexity) to solve the max-flow problem that run fast, in polynomial time in V or E. Here we are going to use an implementation (with*pymaxflow*) based on, which is shown to run faster on some images empirically.*Vladimir Kolmogorov*

The following figures / animations show the interactive-segmentation results (computed probability densities, subset of the flow-graph & min-cut, final segmented image) on a few images, some of them taken from the above-mentioned courses / videos, some of them taken from Berkeley Vision dataset.

**Input Image**

**Input Image with Scribbles**

**Fitted Densities from Color Scribbles**

**A Tiny Sub-graph with Min-Cut**

**Input Image**

**Input Image with Scribbles**

**Fitted Densities from Color Scribbles**

**A Tiny Sub-graph with Min-Cut**

**Input Image (liver) **

**Input Image with Scribbles**

**Input Image**

**Input Image with Scribbles**

**Input Image**https://sandipanweb.files.wordpress.com/2018/02/bunny.png?w=150&... 150w, https://sandipanweb.files.wordpress.com/2018/02/bunny.png?w=300&... 300w" sizes="(max-width: 681px) 100vw, 681px" />

**Input Image with Scribbles**

**Fitted Densities from Color Scribbles**

**A Tiny Sub-graph of the flow-graph with Min-Cut**

**Input Image**

**Input Image with Scribbles**

**A Tiny Sub-graph of the flow-graph with Min-Cut**

**Input Image Input Image with Scribbles**

**Input Image**

**Input Image with Scribbles **

**Fitted Densities from Color Scribbles **

**Input Image**

**Input Image with Scribbles**

**Fitted Densities from Color Scribbles**

**A Tiny Sub-graph of the flow-graph with Min-Cut**

**Input Image (UMBC Campus Map)**

**Input Image with Scribbles**

**Input Image**

**Input Image with Scribbles**

**A Tiny Sub-graph of the flow-graph with Min-Cut** **(with blue foreground nodes)**

The following figures / animation show how the background of a given image can be replaced by a new image using cut & paste (by replacing the corresponding pixels in the new image corresponding to foreground), once the foreground in the original image gets identified after segmentation.

**Original Input Image**

**New Background**

© 2020 TechTarget, Inc. Powered by

Badges | Report an Issue | Privacy Policy | Terms of Service

**Most Popular Content on DSC**

To not miss this type of content in the future, subscribe to our newsletter.

- Book: Applied Stochastic Processes
- Long-range Correlations in Time Series: Modeling, Testing, Case Study
- How to Automatically Determine the Number of Clusters in your Data
- New Machine Learning Cheat Sheet | Old one
- Confidence Intervals Without Pain - With Resampling
- Advanced Machine Learning with Basic Excel
- New Perspectives on Statistical Distributions and Deep Learning
- Fascinating New Results in the Theory of Randomness
- Fast Combinatorial Feature Selection

**Other popular resources**

- Comprehensive Repository of Data Science and ML Resources
- Statistical Concepts Explained in Simple English
- Machine Learning Concepts Explained in One Picture
- 100 Data Science Interview Questions and Answers
- Cheat Sheets | Curated Articles | Search | Jobs | Courses
- Post a Blog | Forum Questions | Books | Salaries | News

**Archives:** 2008-2014 |
2015-2016 |
2017-2019 |
Book 1 |
Book 2 |
More

**Most popular articles**

- Free Book and Resources for DSC Members
- New Perspectives on Statistical Distributions and Deep Learning
- Time series, Growth Modeling and Data Science Wizardy
- Statistical Concepts Explained in Simple English
- Machine Learning Concepts Explained in One Picture
- Comprehensive Repository of Data Science and ML Resources
- Advanced Machine Learning with Basic Excel
- Difference between ML, Data Science, AI, Deep Learning, and Statistics
- Selected Business Analytics, Data Science and ML articles
- How to Automatically Determine the Number of Clusters in your Data
- Fascinating New Results in the Theory of Randomness
- Hire a Data Scientist | Search DSC | Find a Job
- Post a Blog | Forum Questions

## You need to be a member of Data Science Central to add comments!

Join Data Science Central