In geometry, an affine transformation, affine map^{[1]} or an affinity (from the Latin, affinis, "connected with") is a function between affine spaces which preserves points, straight lines and planes. Also, sets of parallel lines remain parallel after an affine transformation. An affine transformation does not necessarily preserve angles between lines or distances between points, though it does preserve ratios of distances between points lying on a straight line.
Examples of affine transformations include translation, scaling, homothety, similarity transformation, reflection, rotation, shear mapping, and compositions of them in any combination and sequence.
If and are affine spaces, then every affine transformation is of the form , where is a linear transformation on the space , is a vector in , and is a vector in . Unlike a purely linear transformation, an affine map need not preserve the zero point in a linear space. Thus, every linear transformation is affine, but not every affine transformation is linear.
All Euclidean spaces are affine, but there are affine spaces that are nonEuclidean. In affine coordinates, which include Cartesian coordinates in Euclidean spaces, each output coordinate of an affine map is a linear function (in the sense of calculus) of all input coordinates. Another way to deal with affine transformations systematically is to select a point as the origin; then, any affine transformation is equivalent to a linear transformation (of position vectors) followed by a translation.
An affine map^{[1]} 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, determines a linear transformation such that, for any pair of points :
or
We can interpret this definition in a few other ways, as follows.
If an origin is chosen, and denotes its image , then this means that for any vector :
If an origin is also chosen, this can be decomposed as an affine transformation that sends , namely
followed by the translation by a vector .
The conclusion is that, intuitively, consists of a translation and a linear map.
Given two affine spaces and , over the same field, a function is an affine map if and only if for every family of weighted points in such that
we have^{[2]}
In other words, preserves barycenters.
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 finitedimensional case, if the linear map is represented as a multiplication by a matrix and the translation as the addition of a vector , an affine map acting on a vector can be represented as
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 are augmented with a "1" at the end, and all matrices are augmented with an extra row of zeros at the bottom, an extra columnthe translation vectorto the right, and a "1" in the lower right corner. If is a matrix,
is equivalent to the following
The abovementioned augmented matrix is called an affine transformation matrix, or 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 and . This is a group under the operation of composition of functions, called the affine group.
Ordinary matrixvector 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 . A translation within the original space by means of a linear transformation of the higherdimensional space is then possible (specifically, a shear transformation). The coordinates in the higherdimensional 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.
If the vectors are a basis of the domain's projective vector space and if are the corresponding vectors in the codomain vector space then the augmented matrix that achieves this affine transformation
is
This formulation works irrespective of whether any of the domain, codomain and image vector spaces have the same number of dimensions.
For example, the affine transformation of a vector plane is uniquely determined from the knowledge of where the three vertices of a nondegenerate triangle are mapped to.
An affine transformation preserves:
An affine transformation is invertible if and only if is invertible. In the matrix representation, the inverse is:
The invertible affine transformations (of an affine space onto itself) form the affine group, which has the general linear group of degree as subgroup and is itself a subgroup of the general linear group of degree .
The similarity transformations form the subgroup where is a scalar times an orthogonal matrix. For example, if the affine transformation acts on the plane and if the determinant of is 1 or 1 then the transformation is an equiareal mapping. Such transformations form a subgroup called the equiaffine group.^{[4]} A transformation that is both equiaffine and a similarity is an isometry of the plane taken with Euclidean distance.
Each of these groups has a subgroup of orientationpreserving or positive affine transformations: those where the determinant of is positive. In the last case this is in 3D the group of rigid body motions (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.
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:^{[5]}
Transformation name  Affine matrix  Example 

Identity (transform to original image)  
Reflection  
Scale  
Rotate  where ? = =30°  
Shear 
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.
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.
Affine transformations in two real dimensions include:
To visualise the general affine transformation of the Euclidean plane, take labelled parallelograms ABCD and A?B?C?D?. Whatever the choices of points, there is an affine transformation T of the plane taking A to A?, and each vertex similarly. Supposing we exclude the degenerate case where ABCD has zero area, there is a unique such affine transformation T. Drawing out a whole grid of parallelograms based on ABCD, the image T(P) of any point P is determined by noting that T(A) = A?, T applied to the line segment AB is A?B?, T applied to the line segment AC is A?C?, and T respects scalar multiples of vectors based at A. [If A, E, F are collinear then the ratio length(AF)/length(AE) is equal to length(A?F?)/length(A?E?).] Geometrically T transforms the grid based on ABCD to that based in A?B?C?D?.
Affine transformations do not respect lengths or angles; they multiply area by a constant factor
A given T may either be direct (respect orientation), or indirect (reverse orientation), and this may be determined by its effect on signed areas (as defined, for example, by the cross product of vectors).
Functions with and constant, are commonplace affine transformations.
The following equation expresses an affine transformation in GF(2^{8}):
where is the matrix and is the vector

For instance, the affine transformation of the element in bigendian binary notation = in bigendian hexadecimal notation, is calculated as follows:
Thus, .
In R^{2}, the transformation shown at left is accomplished using the map given by:
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.
Manage research, learning and skills at defaultlogic.com. Create an account using LinkedIn to manage and organize your omnichannel knowledge. defaultlogic.com is like a shopping cart for information  helping you to save, discuss and share.