Direct linear transformation: Difference between revisions

Revision as of 09:29, 11 January 2016

Revision as of 05:49, 12 January 2016

Line 20:

What makes the direct linear transformation problem distinct from the above standard case is the fact that the left and right sides of the defining equation can differ by an unknown multiplicative factor which is dependent on ''k''. As a consequence, <math> \mathbf{A} </math> cannot be computed as in the standard case. Instead, the similarity relations are rewritten as proper linear homogeneous equations which then can be solved by a standard method. The combination of rewriting the similarity equations as homogeneous linear equations and solving them by standard methods is referred to as a '''direct linear transformation algorithm''' or '''DLT algorithm'''. DLT is attributed to Ivan Sutherland.

<ref name="Sutherland">{{Citation | last=Sutherland| first=Ivan E. | title=Three-dimensional data input by tablet | journal=Proceedings of the IEEE | volume=62 | number=4 |date=April 1974 | pages=453-461453–461 | doi=10.1109/PROC.1974.9449 }}</ref>

== Example ==

Line 103:

== References ==

{{Reflist}}

*{{cite book |

author=Richard Hartley and Andrew Zisserman |