15-864 Project 4 Results

Method

The program I ended up with will produce a set of panoramas from a set of images file names. The outline of the algorithm is as follows

1. Extract feature points for each image
2. For each pair of images
   1. Using ransac find the largest set of inliers that produce the same (or similar) homographies.
   2. If that set has more than 15 elements, mark the two images as connected
3. Find the connected components of each graph
4. For each connected component
   1. Build a panorama using breadth-first search, starting with the node with largest degree
5. Observe pretty pictures

Images

Toxic Waste Dump (I Think)

Courtesy of Intel

The Great Indoors (Revisited)

Wean and Newell-Simon Hall (Revisited)