![]() |
![]() |
![]() |
![]() |
||
|
Planar Matchmove Using Invariant Image Features
Planar Matchmove was created as a course project for CPSC 525: Image Understanding II at the University of British Columbia in Term 2 of 2006-2007. I have implemented a planar version of the matchmove problem. The matchmove problem involves inserting computer graphics into real images. The main goal of my implementation is to provide a matchmove pipeline that I can use for my artistic endeavors. Report Here is the final report for my project, detailing the algorithm that I used: [PDF]Examples Here are some of the videos that I have created while testing my matchmove solution:(1) Burger King at Mt. Rushmore Presentation Slides from April 2, 2007 [PDF] [PPT] Code Here is a bundle that includes the binaries to run my matchmove solution as well as a README explaining how to run the code: [ZIP]and here is a listing of the code used in my project: [PDF] |
|||||