I think that different MPEG compression schemes track motion differently - some using a brute force method. This method treats your image like a linear function so that it can search for the region of interest in the next image by using a "newton's method" like scheme - Much more efficient than brute force pixel comparison. I could be wrong though - I wasn't really paying attention in class
Slashdot Mirror
Check this:
http://robotics.stanford.edu/~birch/klt/
I think that different MPEG compression schemes track motion differently - some using a brute force method. This method treats your image like a linear function so that it can search for the region of interest in the next image by using a "newton's method" like scheme - Much more efficient than brute force pixel comparison. I could be wrong though - I wasn't really paying attention in class