Lab Assignment

• You are allowed to use whatever language you are comfortable with and whatever maxflow (or mincut) implementation available. The framework provided for the lab is in C++.

Lab Assignment

• Setup and solve some maxflow problems. • Try this problem as well (HINT: For terminal

edges that don’t exist, you can set the weight to 0)

FG BG

0 1

2 3

8

5

3

7

7

6

1

3

1

Problem from last week:

• If you wanted to setup the following problem, where A is the source, and C is the sink …

A

B

D

C E

5

3

13 1

4

7

2

• You could convert the problem as follows. Use a 0 weight for non-existing reverse edges.

A

B

D

C E

5

3

13 1

4

7

2

FG BG

1000000 1000000

HW 5: Graph Cuts Segmentation

• The goal of the assignment is to introduce you to graphcuts segmentation.

• You will be required to set up a graphcut problem.

• Use Graph-Cuts segmentation to make a postcard.

HW 5: Graph Cuts Segmentation

• 1. Snap a picture of yourself (or use lena.jpg), draw foreground and background seeds.

HW 5: Graph Cuts Segmentation

• 2. Setup the graph problem for an image and solve.

• 3. With the segmented results, overlay the resulting image on a background of your choosing (or use backdrop.jpg)

Submit a zip file containing yourcode file(s) and your result image.