• Images
• Videos
• Documents
• Books
• Articles

Definition

Let X be an affine space over a field k, and V be its associated vector space. An affine transformation is a bijection f from X onto itself that is an affine map; this means that a linear map g from V to V is well defined by the equation g ( y − x ) = f ( y ) − f ( x ) ; {\displaystyle g(y-x)=f(y)-f(x);} here, as usual, the subtraction of two points denotes the free vector from the second point to the first one, and "well-defined" means that y − x = y ′ − x ′ {\displaystyle y-x=y'-x'} implies that f ( y ) − f ( x ) = f ( y ′ ) − f ( x ′ ) . {\displaystyle f(y)-f(x)=f(y')-f(x').}

If the dimension of X is at least two, a semiaffine transformation f of X is a bijection from X onto itself satisfying:³

1. For every d-dimensional affine subspace S of X, then f (S) is also a d-dimensional affine subspace of X.
2. If S and T are parallel affine subspaces of X, then f (S) and f (T) are parallel.

These two conditions are satisfied by affine transformations, and express what is precisely meant by the expression that "f preserves parallelism".

These conditions are not independent as the second follows from the first.⁴ Furthermore, if the field k has at least three elements, the first condition can be simplified to: f is a collineation, that is, it maps lines to lines.⁵

Structure

By the definition of an affine space, V acts on X, so that, for every pair ( x , v ) {\displaystyle (x,\mathbf {v} )} in X × V there is associated a point y in X. We can denote this action by v → ( x ) = y {\displaystyle {\vec {v}}(x)=y} . Here we use the convention that v → = v {\displaystyle {\vec {v}}={\textbf {v}}} are two interchangeable notations for an element of V. By fixing a point c in X one can define a function mc : X → V by mc(x) = cx→. For any c, this function is one-to-one, and so, has an inverse function mc−1 : V → X given by m c − 1 ( v ) = v → ( c ) {\displaystyle m_{c}^{-1}({\textbf {v}})={\vec {v}}(c)} . These functions can be used to turn X into a vector space (with respect to the point c) by defining:⁶

• x + y = m c − 1 ( m c ( x ) + m c ( y ) ) ,  for all  x , y  in  X , {\displaystyle x+y=m_{c}^{-1}\left(m_{c}(x)+m_{c}(y)\right),{\text{ for all }}x,y{\text{ in }}X,} and
• r x = m c − 1 ( r m c ( x ) ) ,  for all  r  in  k  and  x  in  X . {\displaystyle rx=m_{c}^{-1}\left(rm_{c}(x)\right),{\text{ for all }}r{\text{ in }}k{\text{ and }}x{\text{ in }}X.}

This vector space has origin c and formally needs to be distinguished from the affine space X, but common practice is to denote it by the same symbol and mention that it is a vector space after an origin has been specified. This identification permits points to be viewed as vectors and vice versa.

For any linear transformation λ of V, we can define the function L(c, λ) : X → X by

L ( c , λ ) ( x ) = m c − 1 ( λ ( m c ( x ) ) ) = c + λ ( c x → ) . {\displaystyle L(c,\lambda )(x)=m_{c}^{-1}\left(\lambda (m_{c}(x))\right)=c+\lambda ({\vec {cx}}).}

Then L(c, λ) is an affine transformation of X which leaves the point c fixed.⁷ It is a linear transformation of X, viewed as a vector space with origin c.

Let σ be any affine transformation of X. Pick a point c in X and consider the translation of X by the vector w = c σ ( c ) → {\displaystyle {\mathbf {w}}={\overrightarrow {c\sigma (c)}}} , denoted by Tw. Translations are affine transformations and the composition of affine transformations is an affine transformation. For this choice of c, there exists a unique linear transformation λ of V such that⁸

σ ( x ) = T w ( L ( c , λ ) ( x ) ) . {\displaystyle \sigma (x)=T_{\mathbf {w}}\left(L(c,\lambda )(x)\right).}

That is, an arbitrary affine transformation of X is the composition of a linear transformation of X (viewed as a vector space) and a translation of X.

This representation of affine transformations is often taken as the definition of an affine transformation (with the choice of origin being implicit).⁹¹⁰¹¹

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 A {\displaystyle A} and the translation as the addition of a vector b {\displaystyle \mathbf {b} } , an affine map f {\displaystyle f} acting on a vector x {\displaystyle \mathbf {x} } can be represented as

y = f ( x ) = A x + b . {\displaystyle \mathbf {y} =f(\mathbf {x} )=A\mathbf {x} +\mathbf {b} .}

Augmented matrix

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 A {\displaystyle A} is a matrix,

[ y 1 ] = [ A b 0 ⋯ 0 1 ] [ x 1 ] {\displaystyle {\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}}}

is equivalent to the following

y = A x + b . {\displaystyle \mathbf {y} =A\mathbf {x} +\mathbf {b} .}

The above-mentioned augmented matrix is called an affine transformation matrix. In the general case, when the last row vector is not restricted to be [ 0 ⋯ 0 1 ] {\displaystyle \left[{\begin{array}{ccc|c}0&\cdots &0&1\end{array}}\right]} , the matrix becomes a projective transformation matrix (as it can also be used to perform projective transformations).

This representation exhibits the set of all invertible affine transformations as the semidirect product of K n {\displaystyle K^{n}} and GL ⁡ ( n , K ) {\displaystyle \operatorname {GL} (n,K)} . This is a 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 ( 0 , 0 , … , 0 , 1 ) {\displaystyle (0,0,\dotsc ,0,1)} . 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, the higher dimensional space is a real projective space.

The advantage of using homogeneous coordinates is that one can 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 n + 1 points x1, ..., xn+1 that define a non-degenerate simplex in n-dimensional space. Suppose you have corresponding destination points y1, ..., yn+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 M that achieves the affine transformation [ y i 1 ] = M [ x i 1 ] {\displaystyle {\begin{bmatrix}\mathbf {y} _{i}\\1\end{bmatrix}}=M{\begin{bmatrix}\mathbf {x} _{i}\\1\end{bmatrix}}} for every i is M = [ y 1 ⋯ y n + 1 1 ⋯ 1 ] [ x 1 ⋯ x n + 1 1 ⋯ 1 ] − 1 . {\displaystyle 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}.}

Properties

Properties preserved

An affine transformation preserves:

1. collinearity between points: three or more points which lie on the same line (called collinear points) continue to be collinear after the transformation.
2. parallelism: two or more lines which are parallel, continue to be parallel after the transformation.
3. convexity of sets: a convex set continues to be convex after the transformation. Moreover, the extreme points of the original set are mapped to the extreme points of the transformed set.¹²
4. ratios of lengths of parallel line segments: for distinct parallel segments defined by points p 1 {\displaystyle p_{1}} and p 2 {\displaystyle p_{2}} , p 3 {\displaystyle p_{3}} and p 4 {\displaystyle p_{4}} , the ratio of p 1 p 2 → {\displaystyle {\overrightarrow {p_{1}p_{2}}}} and p 3 p 4 → {\displaystyle {\overrightarrow {p_{3}p_{4}}}} is the same as that of f ( p 1 ) f ( p 2 ) → {\displaystyle {\overrightarrow {f(p_{1})f(p_{2})}}} and f ( p 3 ) f ( p 4 ) → {\displaystyle {\overrightarrow {f(p_{3})f(p_{4})}}} .
5. barycenters of weighted collections of points.

Groups

As an affine transformation is invertible, the square matrix A {\displaystyle A} appearing in its matrix representation is invertible. The matrix representation of the inverse transformation is thus

[ A − 1 − A − 1 b →   0 … 0 1 ] . {\displaystyle \left[{\begin{array}{ccc|c}&A^{-1}&&-A^{-1}{\vec {b}}\ \\0&\ldots &0&1\end{array}}\right].}

The invertible affine transformations (of an affine space onto itself) form the affine group, which has the general linear group of degree n {\displaystyle n} as subgroup and is itself a subgroup of the general linear group of degree n + 1 {\displaystyle n+1} .

The similarity transformations form the subgroup where A {\displaystyle A} is a scalar times an orthogonal matrix. For example, if the affine transformation acts on the plane and if the determinant of A {\displaystyle A} is 1 or −1 then the transformation is an equiareal mapping. Such transformations form a subgroup called the equi-affine group.¹³ A transformation that is both equi-affine and a similarity is an isometry of the plane taken with Euclidean distance.

Each of these groups has a subgroup of orientation-preserving or positive affine transformations: those where the determinant of A {\displaystyle A} is positive. In the last case this is in 3D the group of rigid transformations (proper rotations and pure translations).

If there is a fixed point, we can take that as the origin, and the affine transformation reduces to a linear transformation. This may make it easier to classify and understand the transformation. For example, describing a transformation as a rotation by a certain angle with respect to a certain axis may give a clearer idea of the overall behavior of the transformation than describing it as a combination of a translation and a rotation. However, this depends on application and context.

Affine maps

An affine map f : A → B {\displaystyle f\colon {\mathcal {A}}\to {\mathcal {B}}} between two affine spaces is a map on the points that acts linearly on the vectors (that is, the vectors between points of the space). In symbols, f {\displaystyle f} determines a linear transformation φ {\displaystyle \varphi } such that, for any pair of points P , Q ∈ A {\displaystyle P,Q\in {\mathcal {A}}} :

f ( P )   f ( Q ) → = φ ( P Q → ) {\displaystyle {\overrightarrow {f(P)~f(Q)}}=\varphi ({\overrightarrow {PQ}})}

or

f ( Q ) − f ( P ) = φ ( Q − P ) {\displaystyle f(Q)-f(P)=\varphi (Q-P)} .

We can interpret this definition in a few other ways, as follows.

If an origin O ∈ A {\displaystyle O\in {\mathcal {A}}} is chosen, and B {\displaystyle B} denotes its image f ( O ) ∈ B {\displaystyle f(O)\in {\mathcal {B}}} , then this means that for any vector x → {\displaystyle {\vec {x}}} :

f : ( O + x → ) ↦ ( B + φ ( x → ) ) {\displaystyle f\colon (O+{\vec {x}})\mapsto (B+\varphi ({\vec {x}}))} .

If an origin O ′ ∈ B {\displaystyle O'\in {\mathcal {B}}} is also chosen, this can be decomposed as an affine transformation g : A → B {\displaystyle g\colon {\mathcal {A}}\to {\mathcal {B}}} that sends O ↦ O ′ {\displaystyle O\mapsto O'} , namely

g : ( O + x → ) ↦ ( O ′ + φ ( x → ) ) {\displaystyle g\colon (O+{\vec {x}})\mapsto (O'+\varphi ({\vec {x}}))} ,

followed by the translation by a vector b → = O ′ B → {\displaystyle {\vec {b}}={\overrightarrow {O'B}}} .

The conclusion is that, intuitively, f {\displaystyle f} consists of a translation and a linear map.

Alternative definition

Given two affine spaces A {\displaystyle {\mathcal {A}}} and B {\displaystyle {\mathcal {B}}} , over the same field, a function f : A → B {\displaystyle f\colon {\mathcal {A}}\to {\mathcal {B}}} is an affine map if and only if for every family { ( a i , λ i ) } i ∈ I {\displaystyle \{(a_{i},\lambda _{i})\}_{i\in I}} of weighted points in A {\displaystyle {\mathcal {A}}} such that

∑ i ∈ I λ i = 1 {\displaystyle \sum _{i\in I}\lambda _{i}=1} ,

we have¹⁴

f ( ∑ i ∈ I λ i a i ) = ∑ i ∈ I λ i f ( a i ) {\displaystyle f\left(\sum _{i\in I}\lambda _{i}a_{i}\right)=\sum _{i\in I}\lambda _{i}f(a_{i})} .

In other words, f {\displaystyle f} preserves barycenters.

History

The word "affine" as a mathematical term is defined in connection with tangents to curves in Euler's 1748 Introductio in analysin infinitorum.¹⁵ Felix Klein attributes the term "affine transformation" to Möbius and Gauss.¹⁶

Image transformation

In their applications to digital image processing, the affine transformations are analogous to printing on a sheet of rubber and stretching the sheet's edges parallel to the plane. This transform relocates pixels requiring intensity interpolation to approximate the value of moved pixels, bicubic interpolation is the standard for image transformations in image processing applications. Affine transformations scale, rotate, translate, mirror and shear images as shown in the following examples:¹⁷

Transformation name	Affine matrix	Example
Identity (transform to original image)	[ 1 0 0 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}}}
Translation	[ 1 0 v x > 0 0 1 v y = 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&0&v_{x}>0\\0&1&v_{y}=0\\0&0&1\end{bmatrix}}}
Reflection	[ − 1 0 0 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}-1&0&0\\0&1&0\\0&0&1\end{bmatrix}}}
Scale	[ c x = 2 0 0 0 c y = 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}c_{x}=2&0&0\\0&c_{y}=1&0\\0&0&1\end{bmatrix}}}
Rotate	[ cos ⁡ ( θ ) − sin ⁡ ( θ ) 0 sin ⁡ ( θ ) cos ⁡ ( θ ) 0 0 0 1 ] {\displaystyle {\begin{bmatrix}\cos(\theta )&-\sin(\theta )&0\\\sin(\theta )&\cos(\theta )&0\\0&0&1\end{bmatrix}}}	where θ = ⁠π/6⁠ =30°
Shear	[ 1 c x = 0.5 0 c y = 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&c_{x}=0.5&0\\c_{y}=0&1&0\\0&0&1\end{bmatrix}}}

The affine transforms are applicable to the registration process where two or more images are aligned (registered). An example of image registration is the generation of panoramic images that are the product of multiple images stitched together.

Affine warping

The affine transform preserves parallel lines. However, the stretching and shearing transformations warp shapes, as the following example shows:

This is an example of image warping. However, the affine transformations do not facilitate projection onto a curved surface or radial distortions.

In the plane

Every affine transformations in a Euclidean plane is the composition of a translation and an affine transformation that fixes a point; the latter may be

• a homothety,
• rotations around the fixed point,
• a scaling, with possibly negative scaling factors, in two directions (not necessarily perpendicular); this includes reflections,
• a shear mapping
• a squeeze mapping.

Given two non-degenerate triangles ABC and A′B′C′ in a Euclidean plane, there is a unique affine transformation T that maps A to A′, B to B′ and C to C′. Each of ABC and A′B′C′ defines an affine coordinate system and a barycentric coordinate system. Given a point P, the point T(P) is the point that has the same coordinates on the second system as the coordinates of P on the first system.

Affine transformations do not respect lengths or angles; they multiply areas by the constant factor

area of A′B′C′ / area of ABC.

A given T may either be direct (respect orientation), or indirect (reverse orientation), and this may be determined by comparing the orientations of the triangles.

Examples

Over the real numbers

The functions f : R → R , f ( x ) = m x + c {\displaystyle f\colon \mathbb {R} \to \mathbb {R} ,\;f(x)=mx+c} with m {\displaystyle m} and c {\displaystyle c} in R {\displaystyle \mathbb {R} } and m ≠ 0 {\displaystyle m\neq 0} , are precisely the affine transformations of the real line.

In plane geometry

In R 2 {\displaystyle \mathbb {R} ^{2}} , the transformation shown at left is accomplished using the map given by:

[ x y ] ↦ [ 0 1 2 1 ] [ x y ] + [ − 100 − 100 ] {\displaystyle {\begin{bmatrix}x\\y\end{bmatrix}}\mapsto {\begin{bmatrix}0&1\\2&1\end{bmatrix}}{\begin{bmatrix}x\\y\end{bmatrix}}+{\begin{bmatrix}-100\\-100\end{bmatrix}}}

Transforming the three corner points of the original triangle (in red) gives three new points which form the new triangle (in blue). This transformation skews and translates the original triangle.

In fact, all triangles are related to one another by affine transformations. This is also true for all parallelograms, but not for all quadrilaterals.

See also

• Anamorphosis – artistic applications of affine transformations
• Affine geometry
• 3D projection
• Homography
• Flat (geometry)
• Bent function
• Multilinear polynomial

Notes

• Berger, Marcel (1987), Geometry I, Berlin: Springer, ISBN 3-540-11658-3
• Brannan, David A.; Esplen, Matthew F.; Gray, Jeremy J. (1999), Geometry, Cambridge University Press, ISBN 978-0-521-59787-6
• Nomizu, Katsumi; Sasaki, S. (1994), Affine Differential Geometry (New ed.), Cambridge University Press, ISBN 978-0-521-44177-3
• Klein, Felix (1948) [1939], Elementary Mathematics from an Advanced Standpoint: Geometry, Dover
• Samuel, Pierre (1988), Projective Geometry, Springer-Verlag, ISBN 0-387-96752-4
• Sharpe, R. W. (1997). Differential Geometry: Cartan's Generalization of Klein's Erlangen Program. New York: Springer. ISBN 0-387-94732-9.
• Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7
• Wan, Zhe-xian (1993), Geometry of Classical Groups over Finite Fields, Chartwell-Bratt, ISBN 0-86238-326-9

External links

• Media related to Affine transformation at Wikimedia Commons
• "Affine transformation", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Geometric Operations: Affine Transform, R. Fisher, S. Perkins, A. Walker and E. Wolfart.
• Weisstein, Eric W. "Affine Transformation". MathWorld.
• Affine Transform by Bernard Vuilleumier, Wolfram Demonstrations Project.
• Affine Transformation with MATLAB

References

1. Berger 1987, p. 38. - Berger, Marcel (1987), Geometry I, Berlin: Springer, ISBN 3-540-11658-3 ↩

2. Samuel 1988, p. 11. - Samuel, Pierre (1988), Projective Geometry, Springer-Verlag, ISBN 0-387-96752-4 https://archive.org/details/projectivegeomet0000samu ↩

3. Snapper & Troyer 1989, p. 65. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

4. Snapper & Troyer 1989, p. 66. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

5. Snapper & Troyer 1989, p. 69. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

6. Snapper & Troyer 1989, p. 59. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

7. Snapper & Troyer 1989, p. 76,87. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

8. Snapper & Troyer 1989, p. 86. - Snapper, Ernst; Troyer, Robert J. (1989) [1971], Metric Affine Geometry, Dover, ISBN 978-0-486-66108-7 ↩

9. Wan 1993, pp. 19–20. - Wan, Zhe-xian (1993), Geometry of Classical Groups over Finite Fields, Chartwell-Bratt, ISBN 0-86238-326-9 ↩

10. Klein 1948, p. 70. - Klein, Felix (1948) [1939], Elementary Mathematics from an Advanced Standpoint: Geometry, Dover ↩

11. Brannan, Esplen & Gray 1999, p. 53. - Brannan, David A.; Esplen, Matthew F.; Gray, Jeremy J. (1999), Geometry, Cambridge University Press, ISBN 978-0-521-59787-6 ↩

12. Reinhard Schultz. "Affine transformations and convexity" (PDF). Retrieved 27 February 2017. http://math.ucr.edu/~res/math145A-2014/affine+convex.pdf ↩

13. Oswald Veblen (1918) Projective Geometry, volume 2, pp. 105–7. /wiki/Oswald_Veblen ↩

14. Schneider, Philip K.; Eberly, David H. (2003). Geometric Tools for Computer Graphics. Morgan Kaufmann. p. 98. ISBN 978-1-55860-594-7. 978-1-55860-594-7 ↩

15. Euler, Leonhard (1748). Introductio in analysin infinitorum (in Latin). Vol. II. Book II, sect. XVIII, art. 442 https://gallica.bnf.fr/ark:/12148/bpt6k33529/f240.image ↩

16. Klein 1948, p. 70. - Klein, Felix (1948) [1939], Elementary Mathematics from an Advanced Standpoint: Geometry, Dover ↩

17. Gonzalez, Rafael (2008). 'Digital Image Processing, 3rd'. Pearson Hall. ISBN 9780131687288. 9780131687288 ↩