Direct Linear Transformation

Estimate a projective mapping by turning homogeneous point correspondences into a linear null-space problem, solved up to overall scale.

Version

v2 · 2026-09-06 · History

Domain-specific #

1680

Origin domain

photogrammetry

Subdomain

camera calibration

Aliases

DLT, DLT algorithm

Core Idea

The Direct Linear Transformation (DLT) is an estimation algorithm that recovers the coefficients of a projective mapping from corresponding points. It expresses each homogeneous correspondence as equations linear in the unknown matrix entries, stacks those equations into a homogeneous system \(A\mathbf h=0\), and selects a nonzero null-space vector, usually the right singular vector of \(A\) associated with its smallest singular value. The coefficients are defined only up to an overall nonzero scale because projective points themselves are homogeneous.

Scope of Application

DLT originated in close-range photogrammetry as a way to relate comparator image coordinates to object-space coordinates without requiring initial approximations for camera orientation parameters. In modern multiple-view geometry, variants estimate planar homographies, camera projection matrices, fundamental matrices through the eight-point construction, and triangulated points. The exact design matrix and post-solution constraints depend on the model.

The method applies when correspondences are known and a projective or multilinear relation can be rearranged into coefficients linear in the unknown vector. Calibration restrictions, known intrinsics, radial distortion, and nonlinear lens models require additional parameterization or refinement.

Clarity

There are two different scales. Each homogeneous image equation has an observation-specific proportionality, eliminated by the cross product. The recovered matrix also has one global projective scale: \(H\) and \(\lambda H\) represent the same mapping for any \(\lambda\ne0\). A normalization such as \(\lVert\mathbf h\rVert=1\) chooses a representative but does not create metric scale.

Manages Complexity

DLT replaces coupled projective equations and nuisance scales with one design matrix. Vectorization makes standard linear algebra—rank, singular values, null spaces, and condition numbers—available. It delivers a closed algebraic initialization where direct nonlinear geometric optimization would need a starting point.

Normalization manages floating-point scale imbalance. Without it, coordinates with large offsets or unequal units can make some columns of \(A\) dominate and produce a poor singular vector.

Abstract Reasoning

Let \(\mathbf x=(x,y,1)^{\mathsf T}\), \(\mathbf x'=(u,v,1)^{\mathsf T}\), and let the rows of \(H\) be \(\mathbf h_1^{\mathsf T},\mathbf h_2^{\mathsf T},\mathbf h_3^{\mathsf T}\). From \(\mathbf x'\sim H\mathbf x\), dehomogenization gives

\[ u=\frac{\mathbf h_1^{\mathsf T}\mathbf x}{\mathbf h_3^{\mathsf T}\mathbf x}, \qquad v=\frac{\mathbf h_2^{\mathsf T}\mathbf x}{\mathbf h_3^{\mathsf T}\mathbf x}. \]

Knowledge Transfer

The algorithm transfers literally among projective-estimation tasks: identify a homogeneous incidence relation, vectorize unknown coefficients, construct a design matrix, solve a null space, restore model-specific constraints, and evaluate geometric error. Homography, camera, fundamental-matrix, and triangulation formulations differ in their row construction and degeneracies but share the role package.

The broader reasoning pattern transfers to tensor estimation and algebraic initialization: remove nuisance scale, solve the relaxed linear problem, then project onto the valid model set.

Relationships to Other Abstractions

Current abstraction Direct Linear Transformation Domain-specific

Parents (1) — more general patterns this builds on

• Direct Linear Transformation is a kind of Algorithm Prime

  prime:algorithm is the minimal parent by strict specialization.

Hierarchy paths (2) — routes to 2 parentless roots

• Direct Linear Transformation → Algorithm → Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space

Direct Linear Transformation sits in a sparse region of the domain-specific corpus (92^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Bundle metric — 0.78
• Point-set registration — 0.77
• Aleksandrov–Rassias Problem — 0.77
• Dot Product — 0.77
• Correlation Dimension — 0.77

Computed from structural-signature embeddings · 2026-09-08