Using my phone camera, I have taken some pictures on campus and at my appartnment to be used in this project.
The goal here is to find the homography matrix H. Since there are 8 unkown entries in the matrix, we need at least 4 corresponding pairs of points to find the matrix. Note that the scale factor "i" here can be set to 1 so in reality there is only 8 unkonwns shown in the follwing matrix. Also note that we are using OSL if we provide more than 4 points.
1. Take picture of image that contains a rectangle somewhere.
2. Define the coordinates on the 4 corner of the rectangle.
3. Self define a set of corresponding coordinates to those 4 corners.
4. Use part 2 to find the homography matrix H.
5. Apply the homography matrix to the original image we took.
For image 1 I target the green looking rectangle above the light switch.
For image 2 I target the poster itself.
1. Define corresponding points to two images.
2. Warp one of the images onto the other like part 3.
3. Using the given offsets (if not already shown in the output) to align image.
4. Blend them together using concepts from project 2.
I went on a trip to Lake Tahoe in Califonia and found a pretty picture spot. Although the images all look similar, they are all unique if you look closely.
I applied the harris corners algorithm to extract a bunch of harris corner points.
I applied the Adaptive Non-Maximal Suppression algorithm to reduce the amount of Harris points.
For each harris points, create a 40 by 40 grid around.
Sub-sample each 40 by 40 box down to 8 by 8. Normalize the descriptor. Each of these image here contains many small 8 by 8 normalized image. Note that some of these values are "negative" so it may not make much visual sense.
Implement Feature Matching using Lowe thresholding. If you look closely the corresponding images have corresponding numbers to each of the matching points.
I applied the ransac algorithm to find the best homography function between two sets of
corresponding points. I blended the image using the homography and the results are as shown.
1. Select four feature pairs (at random)
2. Compute homography H (exact)
3. Compute inliers where dist(pi’, H pi ) < ε
4. Keep largest set of inliers
5. Re-compute least-squares H estimate on all of the inliers
The coolest thing I have learned is how powerful harris corners can get. In project 3 we have to manually pick all the corresponding points and that was really annoying. What we have implmented here is essentailly a pipeline that requires minimal human interference to stich two images together into a mosaic.