CSCI 497P/597P: Project 2: Autostitch

Scott Wehrwein

Overview and Logistics

Dates

Teamwork

You may work on this assignment solo or in groups of two. If you would like to work in a pair, you need to complete the following steps by the beginning of class on Friday, October 23rd:

  1. Find your partner. There is a “Search for Teammates” feature on Piazza that may be helpful for pairing up.
  2. The first member of the pair to accept the Github Classroom invite should create a new team (it doesn’t matter which group member does this). Your team name should be the WWU usernames of the two teammates, ordered lexicographically, and separated by an underscore. For example, if Josh (your grader) and I were working on this project together, our team would be named myersdj_wehrwes.
  3. The second member of the pair to accept the Github Classroom invite should find the team created by the first member and join it.

A couple other relevant policies:

Synopsis

In this project, you will implement a system to combine a series of horizontally overlapping photographs into a single panoramic image. We’ll use built-in ORB feature detector and descriptor from the opencv library. You will use ORB to first detect discriminating features in the images and find the best matching features in the other images. Then, using RANSAC, you will automatically align the photographs (determine their overlap and relative positions) and then blend the resulting images into a single seamless panorama. We have provided you with a graphical interface that lets you view the results of the various intermediate steps of the process. We have also provided you with some test images and unit tests to help you debug.

You are provided with a GUI that lets you test and visualize the functionality and intermediate results of the various statges of the pipeline that ultimately produces the final panorama output.

The high-level steps required to create a panorama are listed below. 497P students will implement panorama stitching using a homography motion model, while 597P students will additionally implement a translational model with spherically-warped input images, which allows for full 360-degree panoramas. The steps in square brackets are only used with the spherical warping/translational approach:

  1. Take a sequence of photos with horizontal overlap

  2. [Warp each image to spherical coordinates]

  3. Extract features from each image

  4. Match features among neighboring pairs of images

  5. Align neighboring pairs using RANSAC

  6. Write out list of transformations that relate each image to a single coordinate system

  7. [Correct for drift, if the panorama is 360 degrees)]

  8. Warp the images into the output panorama and blend them together

  9. Crop the panorama and admire the beautiful result

Getting Started

Skeleton code is provided in the repository created by Github Classroom. The invitation link is found in the Project 2 assignment on Canvas.

Test sets: See the resources subdirectory in your repo. You will find four datasets: yosemite, campus, melbourne, and melbourne_small.

Software environment: The lab machines should have the necessary packages installed to run the project code; the software listed for Project 1 should be all you need for this project as well (please let me know if you find this not to be the case!). The GUI for this project is written using TK, much like the prior project, so remote access should work similarly - please see the Project 1 handout for links to resources, and let me know if you’re having trouble running the project remotely.

Your Tasks

  1. Warp each image to spherical coordinates.

    [TODO 1 - 597P only] Compute the inverse map to warp the image by filling in the skeleton code in the computeSphericalWarpMappings routine to:

    1. Convert the given spherical image coordinates into the corresponding planar image coordinates

    2. Apply radial distortion using the radial distortion model described in lecture

  2. Align neighboring pairs.

    The computeHomography function takes two feature sets from image 1 and image 2 (f1 and f2) and a list of feature matches (containing pairs of indices into f1 and f2) and estimates a homography from image 1 to image 2.

    [TODO 2] Set up the \(A\) matrix that defines to the system \(Ax\) that computes the residuals for a given homography unrolled into a vector \(h\).

    [TODO 3] After minimizeAx (implemented for you) finds the unit vector \(x\) that minimizes \(||Ax||\), use its values to fill in the 3x3 homography matrix \(H\). Don’t forget to return the homography in its normalized form, with a 1 as the bottom right entry.

    [TODO 4] alignPair is where you will implement RANSAC. It takes two feature sets, f1 and f2, the list of feature matches, and a motion model, m (described below) as parameters. For this project, we support two motion models, represented by the two possible values of the enum MotionModel: eTranslate and eHomography. alignPair estimates and returns the inter-image transform matrix \(M\) as follows:

    1. Randomly choose a minimal set of feature matches (one match for the case of translations, four for homographies)
    2. Estimate the corresponding motion model (alignment)
    3. Invoke getInliers to get the indices of inlier feature matches (i.e., indices into matches) that agree with the current motion estimate.

    After repeated trials, the entire inlier set from the \(M\) with the largest number of inliers is used to compute a final least squares estimate for the motion, which is returned as the matrix M.

    [TODO 5] getInliers computes the indices of the matches that have a Euclidean distance below RANSACthresh given features f1 andf2 from image 1 and image 2 and an inter-image transformation matrix from image 1 to image 2.

    [TODO 6, 7] leastSquaresFit computes a least squares estimate for the translation or homography using all of the matches previously estimated as inliers. It returns the resulting translation or homography output transform M. For translation estimation, I recommend simply averaging the translations rather than taking the heavy-handed linear algebra approach. For homographies, you’ve already implemented computeHomography to do the heavy lifting.

  3. Warp and blend the aligned image pairs into a single output image to create the final panorama.

    [TODO 8] imageBoundingBox: Given an image and a homography, figure out the box bounding the image after applying the homography.

    [TODO 9] getAccSize: Given the warped images and their relative displacements, figure out how large the final stitched image needs to be in order to fit all the warped image. This method also augments each per-image transformation with a translation that moves the output image coordinate system into a numpy-array-friendly world where (0, 0) is at the top left.

    [TODO 10] blendImages: Warp each image into the output image’s coordinate system and add its pixel content into the accumulator. You will need to use inverse warping to calculate values at integer output pixel coordinates. To allow the images to blend smoothly, use the fourth channel to represent the weight of the contribution of a pixel. Using the linear blending scheme described in lecture, the weight varies linearly from 0 to 1 from the left side of the image over a distance of blendWidth pixels, then ramps down correspondingly on the right side of the image. Other, fancier blending schemes are possible - you may experiment with some for extra credit.

    TODO 10 implementation notes:

    1. When working with homogeneous coordinates, don’t forget to normalize when converting them back to Cartesian coordinates.

    2. Watch out for black pixels in the source image when inverse warping, especially when dealing with spherically warped images. You don’t want to include these in the accumulation.
    3. When doing inverse warping, use bilinear interpolation for the source image pixels. First try to work out the code by looping over each pixel. Later you can optimize your code using array instructions and numpy tricks. My approach does vectorized bilinear interpolation using array operations; another approach uses cv2.remap to warp the image. In either case, you may find numpy.meshgrid useful. Optimizing this function is worth only a couple points, so prioritize this lowest.

    [TODO 11] normalizeBlend: Having accumulated weighted pixels from all the source images, this function normalizes the image so each pixel has unit weight by dividing by the weight at each pixel. Be careful not to divide by zero. Remember to make sure the alpha (fourth) channel of the resulting panorama is opaque (1)!

    [TODO 12 - 597P only] blendImages: To make a 360 panorama, you need to do a couple extra things. First, you’ll want to include the first image again at the end so you can put the seam in the middle of that image. Second, you’ll need to correct for vertical drift to make the left and right edges line up perfectly. The getDriftParams function computes the position of the top left and top right corners of the un-corrected panorama, accounting for cutting out the left half of the left image and the right half of the right image. Given these two points, build a shearing transformation that maps these top two corners to the same \(y\) value.

Using the GUI

The skeleton code that we provide comes with a graphical interface, with the module gui.py, which makes it easy for you to do the following:

  1. Visualize a Homography: The first tab in the UI provides you a way to load an image and apply an arbitrary homography to the image. This can be useful while debugging when, for example, you want to visualize the results of both manually and programmatically generated transformation matrices.
  2. Visualize Spherical Warping: The second tab on the UI lets you spherically warp an image with a given focal length. This will only work if you’ve implemented TODO 1 (597P only).
  3. Align Images: The third tab lets you select two images with overlap and uses RANSAC to compute a homography or translation that maps the right image onto the left image.
  4. Generating a Panorama: The last tab in the UI lets you generate a panorama. You will need to specify a folder with images labelled in such an order that sorting them alphabetically gives you the order the images appear on the panorama from left to right (or from right to left). This ensures that the mappings between all neighboring pairs are computed. Our current code assumes that all images in the panorama have the same width.

Debugging Guidelines

You can use the GUI visualizations to check whether your program is running correctly.

  1. Testing the warping routines:

  2. Testing the alignment routines:

    Note that the campus images are only suitable for the translational motion model! The yosemite images are suitable for both motion models. To test alignPair, load two images in the alignment tab of the GUI. Clicking ‘Align Images’, displays a pair, the left and right images, with the right image transformed according to the inter-image transformation matrix and overlaid over the left image. This enables visually analyzing the accuracy of the transformation matrix. Note that blending is not performed at this stage.

  3. Testing the blending routines:

    When debugging your blending routines, you may find it helpful for the sake of efficiency to use the melbourne_small dataset, which is simply a downsampled version of the Melbourne dataset. Example panoramas are included in the yosemite and the campus directories. Compare the resulting panorama with these images. Note that it’s important to use the specified f, k1, k2 parameters to get the same image. 597P students should use the 360 degree checkbox to ensure you get the same result for campus dataset.

  4. Additional notes: If you use very high resolution images when creating yoru own panorama on a laptop, you might run into memory problems. Try running on a machine with more memory; the lab machines have 16GB RAM which should be enough for panos captured by most consumer-oriented cameras.

Artifact

Each partner must submit their own artifact via Canvas: Take a series of images with a digital camera mounted on a tripod or a handheld camera, and stitch a panorama using your code. This panorama can be either translation-aligned (360 or not, if you implemented 360 features), or aligned with homographies (your choice). For best results, overlap each image by 50% with the previous one, and keep the camera level. In order to use your camera for a spherically warped translation-aligned panorama, you have to estimate the focal length. The simplest way to do this is through the EXIF tags of the images, as described here. You may also be able to find the focal length (in mm) and sensor width by searching for your camera or phone model. Alternatively, you can use a camera calibration toolkit to get more precise focal length and radial distortion coefficients.

For inspiration, check out some of the following links:

Submission

Code Submit your code by committing and pushing your changes to Github before the deadline. If you did any extra credit, describe what you did in readme.txt.

Artifact Every student must submit their own artifact. If you are working in a pair, each group member must submit an artifact. Submit your panorama artifact to Canvas in JPG format.

Survey Each student (again, both members of a pair if applicable) must fill out the P2 Survey assignment on Canvas, where you will provide an estimate of the number of hours you spent on this assignment, as well as any other comments you have about the assignment.

Extra Credit

Here is a list of suggestions for extending the program for extra credit. You are encouraged to come up with your own extensions. We’re always interested in seeing new, unanticipated ways to use this program! Please use the –extra-credit flag in gui.py. You will need to use the args parsed in the “main method” portion of gui.py and modify the rest of the code as necessary. If we run your program without the flag, it must implement the base project.

Rubric

Your project will be graded based on the quality of the panoramas generated. An approximate point breakdown is given below. Keep in mind that later code depends on earlier code, so partial credit may be hard to assign if something early on is broken. If you’re short on time, optimize for having working code for image alignment with homographies.

Correctness:

597P only:

Efficiency:

Survey:

Artifact:

Clarity: Deductions for poor coding style may be made. Please see the syllabus for general coding guidelines. Up to two points may be deducted for each of the following:

Acknowledgments

Many thanks are due to those who developed and refined prior versions of this assignment, including Steve Seitz, Kavita Bala, Noah Snavely, and many underappreciated TAs.