title: DLT vs Homography Estimation
body: <p>I'm a little confused about the difference between the DLT algorithm described <a href="http://vhosts.eecs.umich.edu/vision//teaching/EECS442_2011/lectures/discussion2.pdf" rel="nofollow noreferrer">here</a> and the homography estimation described <a href="https://cseweb.ucsd.edu/classes/wi07/cse252a/homography_estimation/homography_estimation.pdf" rel="nofollow noreferrer">here</a>. In both of these techniques, we are trying to solve for the entries of a 3x3 matrix by using at least 4 point correspondences. In both methods, we set up a system where we have a "measurement" matrix and we use SVD to solve for the vector of elements that make up H. I was wondering why there are two techniques that seem to do the same thing, and why one might be used over the other.</p>