Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Affine transformation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Representation== As shown above, an affine map is the composition of two functions: a translation and a linear map. Ordinary vector algebra uses [[matrix multiplication]] to represent linear maps, and [[vector addition]] to represent translations. Formally, in the finite-dimensional case, if the linear map is represented as a multiplication by an invertible matrix <math>A</math> and the translation as the addition of a vector <math>\mathbf{b}</math>, an affine map <math>f</math> acting on a vector <math>\mathbf{x}</math> can be represented as :<math> \mathbf{y} = f(\mathbf{x}) = A \mathbf{x} + \mathbf{b}. </math> ===Augmented matrix=== [[File:Affine transformations.ogv|thumb|250px|right|Affine transformations on the 2D plane can be performed by linear transformations in three dimensions. Translation is done by shearing along over the z axis, and rotation is performed around the z axis.]] Using an [[augmented matrix]] and an augmented vector, it is possible to represent both the translation and the linear map using a single [[matrix multiplication]]. The technique requires that all vectors be augmented with a "1" at the end, and all matrices be augmented with an extra row of zeros at the bottom, an extra column—the translation vector—to the right, and a "1" in the lower right corner. If <math>A</math> is a matrix, :<math> \begin{bmatrix} \mathbf{y} \\ 1 \end{bmatrix} = \left[ \begin{array}{ccc|c} & A & & \mathbf{b} \\ 0 & \cdots & 0 & 1 \end{array} \right] \begin{bmatrix} \mathbf{x} \\ 1 \end{bmatrix} </math> is equivalent to the following :<math> \mathbf{y} = A \mathbf{x} + \mathbf{b}. </math> The above-mentioned augmented matrix is called an ''[[Transformation matrix#Affine transformations|affine transformation matrix]]''. In the general case, when the last row vector is not restricted to be <math>\left[ \begin{array}{ccc|c} 0 & \cdots & 0 & 1 \end{array} \right]</math>, the matrix becomes a ''projective transformation matrix'' (as it can also be used to perform [[projective transformation]]s). This representation exhibits the [[Set (mathematics)|set]] of all [[Inverse function|invertible]] affine transformations as the [[semidirect product]] of <math>K^n</math> and <math>\operatorname{GL}(n, K)</math>. This is a [[Group (mathematics)|group]] under the operation of composition of functions, called the [[affine group]]. Ordinary matrix-vector multiplication always maps the origin to the origin, and could therefore never represent a translation, in which the origin must necessarily be mapped to some other point. By appending the additional coordinate "1" to every vector, one essentially considers the space to be mapped as a subset of a space with an additional dimension. In that space, the original space occupies the subset in which the additional coordinate is 1. Thus the origin of the original space can be found at <math>(0,0, \dotsc, 0, 1)</math>. A translation within the original space by means of a linear transformation of the higher-dimensional space is then possible (specifically, a shear transformation). The coordinates in the higher-dimensional space are an example of [[homogeneous coordinates]]. If the original space is [[Euclidean space|Euclidean]], the higher dimensional space is a [[real projective space]]. The advantage of using homogeneous coordinates is that one can [[Function composition|combine]] any number of affine transformations into one by multiplying the respective matrices. This property is used extensively in [[computer graphics]], [[computer vision]] and [[robotics]]. ====Example augmented matrix==== Suppose you have three points that define a non-degenerate triangle in a plane, or four points that define a non-degenerate tetrahedron in 3-dimensional space, or generally {{math|''n'' + 1}} points {{math|'''x'''{{sub|1}}}}, ..., {{math|'''x'''{{sub|''n''+1}}}} that define a non-degenerate [[simplex]] in {{mvar|n}}-dimensional space. Suppose you have corresponding destination points {{math|'''y'''{{sub|1}}}}, ..., {{math|'''y'''{{sub|''n''+1}}}}, where these new points can lie in a space with any number of dimensions. (Furthermore, the new points need not be distinct from each other and need not form a non-degenerate simplex.) The unique augmented matrix {{mvar|M}} that achieves the affine transformation <math display=block>\begin{bmatrix}\mathbf{y}_i\\1\end{bmatrix} = M \begin{bmatrix}\mathbf{x}_i\\1\end{bmatrix}</math> for every {{mvar|i}} is <math display=block>M = \begin{bmatrix}\mathbf{y}_1&\cdots&\mathbf{y}_{n+1}\\1&\cdots&1\end{bmatrix} \begin{bmatrix}\mathbf{x}_1&\cdots&\mathbf{x}_{n+1}\\1&\cdots&1\end{bmatrix}^{-1}.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)