Project 3 Writeup

Soumya Ghosh (sghosh)
February 26, 2010

This project involved finding the optimal seam between image patches using Graph Cuts. My implementation here follows the handout pretty closely. It creates a sparse adjacency matrix A, where each element of A contains the edge weight. It also creates a sparse N*2 matrix, where element T(i,j) contains the cost of assigning the ith pixel to the jth label. These are then fed into the provided maxflow implementation. I used the edges4connected() function, which was available in the matlab maxflow package, for the book keeping required for creating the sparse matrices.

Results Images