Direct linear transformation

Direct linear transformation (DLT) is an algorithm which solves a set of variables from a set of similarity relations: x k ∝ A y k {\displaystyle \mathbf {x} _{k}\propto \mathbf {A} \,\mathbf {y} _{k}} for k = 1 , … , N {\displaystyle \,k=1,\ldots ,N} where x k {\displaystyle \mathbf {x} _{k}} and y k {\displaystyle \mathbf {y} _{k}} are known vectors, ∝ {\displaystyle \,\propto } denotes equality up to an unknown scalar multiplication, and A {\displaystyle \mathbf {A} } is a matrix (or linear transformation) which contains the unknowns to be solved. This type of relation appears frequently in projective geometry.

Source: Wikipedia — Direct linear transformation (CC BY-SA 4.0)

Direct linear transformation

Direct linear transformation (DLT) is an algorithm which solves a set of variables from a set of similarity relations: x k ∝ A y k {\displaystyle \mathbf {x} _{k}\propto \mathbf {A} \,\mathbf {y} _{k}} for k = 1 , … , N {\displaystyle \,k=1,\ldots ,N} where x k {\displaystyle \mathbf {x} _{k}} and y k {\displaystyle \mathbf {y} _{k}} are known vectors, ∝ {\displaystyle \,\propto } denotes equality up to an unknown scalar multiplication, and A {\displaystyle \mathbf {A} } is a matrix (or linear transformation) which contains the unknowns to be solved. This type of relation appears frequently in projective geometry.

This neuron ends here.

Source: Wikipedia "Direct linear transformation" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy