Fact-checked by Grok 2 weeks ago

Affine transformation

An affine transformation is a mapping between affine spaces that preserves collinearity and affine combinations, effectively combining a linear transformation with a translation to map points from one space to another while maintaining the structure of lines and planes.^[1]^[2] In mathematical terms, for a vector space \mathbb{R}^n, an affine transformation T: \mathbb{R}^n \to \mathbb{R}^n is defined as T(\mathbf{x}) = A\mathbf{x} + \mathbf{b}, where A is an n \times n matrix representing the linear part and \mathbf{b} is a translation vector.^[3]^[4] Affine transformations exhibit key properties that distinguish them from purely linear ones, including the preservation of ratios of distances along parallel lines and the maintenance of parallelism between lines.^[5]^[6] They map straight lines to straight lines, planes to planes, and affine subspaces to affine subspaces of the same dimension, but do not necessarily preserve angles, lengths, or orientations unless the linear component is orthogonal.^[7]^[8] The composition of two affine transformations is again affine. The set of invertible affine transformations forms the affine group under composition, though it is not commutative in general.^[4] In applications, affine transformations are fundamental in fields such as computer graphics, where they enable efficient modeling of object scaling, rotation, shearing, and translation through matrix operations.^[8] They also play a crucial role in image processing for tasks like geometric correction and registration, ensuring that spatial relationships are maintained during manipulation.^[9] In geometry and physics, they provide a framework for describing coordinate changes that preserve the affine structure of space.^[10]

Definition and Foundations

Core Definition

In the context of linear algebra, an affine transformation operates on a vector space V over a field (such as the real numbers), where V is a set equipped with vector addition and scalar multiplication satisfying certain axioms, forming the foundational structure for such mappings.^[3] Linear transformations, as building blocks, are functions between vector spaces that preserve these operations, mapping the origin to itself and satisfying T(\alpha \mathbf{u} + \beta \mathbf{v}) = \alpha T(\mathbf{u}) + \beta T(\mathbf{v}) for scalars \alpha, \beta and vectors \mathbf{u}, \mathbf{v}.^[3] An affine transformation f: V \to V is defined as a function that preserves affine combinations, i.e., f\left( \sum \alpha_i \mathbf{x}_i \right) = \sum \alpha_i f(\mathbf{x}_i) where \sum \alpha_i = 1 and the \alpha_i are scalars in the field; for example, this includes f(\alpha \mathbf{x} + (1 - \alpha) \mathbf{y}) = \alpha f(\mathbf{x}) + (1 - \alpha) f(\mathbf{y}) for \mathbf{x}, \mathbf{y} \in V and scalar \alpha.^[11] Equivalently, it takes the form f(\mathbf{x}) = A\mathbf{x} + \mathbf{b}, where A is a linear transformation represented by a matrix and \mathbf{b} is a fixed translation vector in V.^[3] This formulation highlights how affine transformations extend linear ones by incorporating translations, which shift the entire space without altering relative positions. Unlike linear transformations, which must fix the origin (f(\mathbf{0}) = \mathbf{0}), affine transformations allow f(\mathbf{0}) = \mathbf{b} \neq \mathbf{0}, enabling the modeling of displacements in geometric settings.^[3] Such mappings are naturally defined within affine spaces, which generalize vector spaces by treating points without a distinguished origin.^[12]

Affine Spaces

An affine space is a geometric structure consisting of a nonempty set A of points and an associated vector space V over a field K, where V acts on A through a translation operation that relates points via vectors, without designating any particular point as an origin.^[13] This setup allows points in A to be connected by vectors from V, enabling the description of displacements and directions, but treats all points equivalently, avoiding the privileged zero element inherent in vector spaces.^[13] The structure satisfies specific axioms that ensure the translation operation behaves consistently. For any point p \in A and vector v \in V, the map p \mapsto p + v is well-defined, with p + 0 = p and (p + v) + w = p + (v + w) for v, w \in V. Crucially, for any two points p, q \in A, there exists a unique vector v \in V such that q = p + v, and this vector is denoted v = q - p, establishing a difference operation between points that yields elements of V.^[13] These axioms guarantee that vectors can be uniquely determined from pairs of points and that parallel translations can be composed associatively. In this framework, affine transformations are maps from an affine space to itself that preserve the parallel transport of vectors, meaning they maintain the vector differences between points and thus parallelism in the structure.^[14] Unlike Euclidean spaces, which build upon affine spaces by incorporating a metric (such as an inner product on V) to define distances, angles, and lengths, affine spaces impose no such metric and instead emphasize properties like ratios along lines and the preservation of collinearity under transformations.^[15] This abstraction provides a foundation for studying geometric incidences and affinities without reliance on measurement.^[13]

Representation

Matrix Formulation

In finite-dimensional vector spaces over fields such as the real numbers \mathbb{R}, an affine transformation f: \mathbb{R}^n \to \mathbb{R}^n is concretely represented in matrix form as f(\mathbf{x}) = A\mathbf{x} + \mathbf{b}, where \mathbf{x} \in \mathbb{R}^n is a column vector, A is an n \times n matrix representing a linear transformation, and \mathbf{b} \in \mathbb{R}^n is a translation vector.^[14]^[4] This formulation separates the linear component A\mathbf{x}, which fixes the origin, from the translation \mathbf{b}, which shifts the entire space. If A is invertible, then f is bijective, preserving the affine structure of the space in a one-to-one manner.^[14] The set of affine transformations is closed under composition, allowing sequential applications to be combined efficiently. Consider two affine transformations f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} and g(\mathbf{y}) = B\mathbf{y} + \mathbf{c}; their composition f \circ g (\mathbf{x}) = A(g(\mathbf{x})) + \mathbf{b} = A(B\mathbf{x} + \mathbf{c}) + \mathbf{b} = (AB)\mathbf{x} + (A\mathbf{c} + \mathbf{b}), which is again an affine transformation of the same form with linear part AB and translation A\mathbf{c} + \mathbf{b}.^[14]^[4] This matrix multiplication property facilitates the representation of complex transformations as products of simpler ones, such as rotations and scalings.^[16] An affine transformation f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} is invertible if and only if A is invertible, in which case the inverse is given explicitly by f^{-1}(\mathbf{x}) = A^{-1}(\mathbf{x} - \mathbf{b}).^[16] This formula follows directly from solving A\mathbf{y} + \mathbf{b} = \mathbf{x} for \mathbf{y}, yielding \mathbf{y} = A^{-1}(\mathbf{x} - \mathbf{b}), confirming that the inverse is also affine.^[2] To unify affine transformations with linear ones under matrix multiplication, homogeneous coordinates embed \mathbb{R}^n into \mathbb{R}^{n+1} by appending a 1 to each vector, allowing the representation f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} to be expressed as a single (n+1) \times (n+1) matrix acting on the augmented vector [\mathbf{x}; 1].^[4] This approach motivates the use of projective geometry for computational efficiency in applications like graphics, where translations become linear operations.^[4]

Augmented Matrix Approach

The augmented matrix approach embeds an affine transformation f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} in \mathbb{R}^n, where A is an n \times n matrix and \mathbf{b} \in \mathbb{R}^n, into a linear transformation in a higher-dimensional space using homogeneous coordinates.^[16] Specifically, the input vector \mathbf{x} is augmented to the (n+1)-dimensional vector \hat{\mathbf{x}} = \begin{bmatrix} \mathbf{x} \\ 1 \end{bmatrix}, and the transformation is represented by the (n+1) \times (n+1) augmented matrix \hat{A} = \begin{bmatrix} A & \mathbf{b} \\ \mathbf{0}^T & 1 \end{bmatrix}, such that f(\hat{\mathbf{x}}) = \hat{A} \hat{\mathbf{x}} = \begin{bmatrix} A\mathbf{x} + \mathbf{b} \\ 1 \end{bmatrix}.^[16] This construction preserves the affine structure while allowing the use of standard linear algebra tools.^[4] A key advantage of this approach is that it enables the composition and inversion of affine transformations through ordinary matrix multiplication and inversion, respectively, without separately handling the translation component.^[16] For instance, the composition of two affine transformations with augmented matrices \hat{A}_1 and \hat{A}_2 yields \hat{A}_2 \hat{A}_1, which is again an augmented matrix of the same form.^[16] Similarly, if A is invertible, the inverse transformation has augmented matrix \hat{A}^{-1} = \begin{bmatrix} A^{-1} & -A^{-1}\mathbf{b} \\ \mathbf{0}^T & 1 \end{bmatrix}.^[16] Additionally, the determinant of the augmented matrix equals \det(A), reflecting the volume-scaling factor of the linear part alone.^[16] As a simple example in 2D, consider a rotation by angle \theta around the origin followed by a translation by (t_x, t_y). The augmented matrix is \hat{A} = \begin{bmatrix} \cos\theta & -\sin\theta & t_x \\ \sin\theta & \cos\theta & t_y \\ 0 & 0 & 1 \end{bmatrix}, and applying it to an augmented point vector involves standard 3×3 matrix multiplication to obtain the transformed coordinates.^[4] This method assumes the homogeneous coordinate remains 1, which holds for finite affine points but excludes representations where it could be zero, limiting its direct applicability to projective transformations that map to points at infinity.^[16]

Properties

Preserved Geometric Properties

Affine transformations preserve certain geometric structures inherent to the configuration of points in space, focusing on relational properties rather than metric ones. Specifically, they maintain collinearity, meaning that straight lines are mapped to straight lines, as any affine transformation can be decomposed into a linear part that preserves the linearity of vectors and a translation that shifts points without altering their alignment.^[17] This preservation extends to parallelism, where parallel lines remain parallel under the transformation, since the linear component does not introduce convergence or divergence in direction vectors.^[2] Along individual lines, affine transformations preserve ratios of distances and division points, achieved through the invariance of affine combinations, which are weighted sums of points with coefficients summing to one.^[18] For instance, if a point divides a line segment in a given ratio, its image under an affine map will divide the corresponding image segment in the same ratio, reflecting the maintenance of barycentric coordinates.^[19] Additionally, convexity is preserved, such that convex sets—regions where line segments between points lie entirely within the set—are mapped to other convex sets, as affine combinations within the set remain within the image.^[20] In contrast to these preserved properties, affine transformations do not generally maintain distances, angles, or absolute areas, distinguishing them from more restrictive classes like isometries (which preserve distances and angles) or similarities (which preserve angles and scale distances uniformly).^[21] Ratios of areas are preserved, since all areas are scaled by the absolute value of the determinant of the linear component. However, overall areas can be altered by this factor, and angles can be sheared or distorted, as seen in non-uniform scalings or shears.^[21]

Algebraic Properties and Groups

Affine transformations form a group under composition, as the composition of two affine transformations is again affine. Specifically, if f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} and g(\mathbf{x}) = C\mathbf{x} + \mathbf{d}, then f \circ g(\mathbf{x}) = AC\mathbf{x} + (A\mathbf{d} + \mathbf{b}), which is affine with linear part AC and translation A\mathbf{d} + \mathbf{b}.^[22] This closure, along with the associativity inherited from function composition, makes the set of affine transformations a monoid. Moreover, every affine transformation has an inverse: for f(\mathbf{x}) = A\mathbf{x} + \mathbf{b} with A invertible, the inverse is f^{-1}(\mathbf{x}) = A^{-1}(\mathbf{x} - \mathbf{b}) = A^{-1}\mathbf{x} - A^{-1}\mathbf{b}, which is also affine. Thus, the set forms a group.^[22] The group of affine transformations on an n-dimensional vector space over a field F, denoted \mathrm{Aff}(n, F), is isomorphic to the semidirect product \mathrm{GL}(n, F) \ltimes F^n, where \mathrm{GL}(n, F) is the general linear group acting on the translation group F^n by matrix multiplication.^[23] In this structure, elements are pairs (A, \mathbf{b}) with multiplication (A, \mathbf{b})(C, \mathbf{d}) = (AC, A\mathbf{d} + \mathbf{b}). The identity element is the pair (I, \mathbf{0}), corresponding to the identity linear map and zero translation.^[22] Important subgroups include the special affine group \mathrm{SAff}(n, F), consisting of those transformations where the linear part has determinant 1, isomorphic to \mathrm{SL}(n, F) \ltimes F^n.^[24] Another subgroup is the group of similarities, where the linear part is a scalar multiple of an orthogonal matrix, preserving angles up to scaling.^[25] The affine group has dimension n^2 + n as an algebraic variety, accounting for the n^2 parameters of the general linear part and n for the translation.^[26]

Specific Cases and Applications

Transformations in the Plane

In the Euclidean plane, an affine transformation is represented by a linear combination of a 2×2 matrix A and a translation vector \mathbf{b} \in \mathbb{R}^2, mapping a point \mathbf{x} = (x, y) to \mathbf{x}' = A\mathbf{x} + \mathbf{b}. This formulation involves six independent parameters: two for the translation components in \mathbf{b}, and four from the entries of A, which can encode scaling, shearing, and rotation effects.^[4] Common types of affine transformations in the plane include translations, rotations, scalings, shears, and reflections. A translation shifts every point by a fixed vector \mathbf{b}, with A as the 2×2 identity matrix, preserving distances and orientations without altering shapes. Rotations are achieved with an orthogonal matrix A (satisfying A^T A = I and \det A = 1), rotating points around the origin by an angle \theta, thus preserving lengths and angles while changing directions. Scalings use a diagonal matrix A = \operatorname{diag}(s_x, s_y), stretching or compressing along the axes by factors s_x and s_y, which may distort angles unless s_x = s_y. Shears employ an upper or lower triangular matrix for A, such as \begin{pmatrix} 1 & h \\ 0 & 1 \end{pmatrix} for horizontal shear, slanting shapes parallel to one axis while preserving area and volume ratios. Reflections, represented by matrices with \det A = -1 (e.g., across the y-axis: A = \begin{pmatrix} -1 & 0 \\ 0 & 1 \end{pmatrix}), flip the plane over a line and reverse orientation, mapping clockwise orders to counterclockwise.^[4]^[27] Affine transformations in the plane exhibit powerful general effects, such as the ability to map any non-degenerate triangle to any other, leveraging the six degrees of freedom to match vertices while preserving collinearity and ratios along lines. This makes them foundational for coordinate changes, allowing the reorientation of geometric figures relative to new bases without altering intrinsic affine structure. Visually, these transformations maintain the planarity of figures; for instance, parallelograms are mapped to parallelograms, as parallel lines remain parallel under the linear part A, with translation simply displacing the entire shape uniformly. Such preservation provides intuitive insight into how affine maps distort while upholding the affine geometry of the plane.^[28]^[4]

Applications in Computer Graphics and Image Processing

In computer graphics, affine transformations form the backbone of the rendering pipeline, enabling efficient object positioning and manipulation. Within systems like OpenGL, the model-view matrix encapsulates affine operations such as translation, rotation, and scaling to transform object coordinates into world space and subsequently into eye coordinates, allowing developers to place and orient 3D models relative to the camera without altering their intrinsic geometry. This separation of model and view transformations ensures consistent handling of scene hierarchies, as detailed in the OpenGL specification where the model-view matrix is applied uniformly to vertices before projection.^[29]^[30] In image processing, affine transformations are essential for warping operations that correct geometric distortions while preserving parallelism of lines, making them suitable for tasks like skew or rotation correction on planar surfaces assuming no perspective distortion. For instance, in document imaging, affine warps rectify skewed or rotated scans by estimating a transformation matrix from detected corners, followed by resampling to avoid aliasing. During resizing or scaling, affine transformations maintain proportional dimensions without introducing perspective artifacts, often paired with bilinear interpolation to compute smooth pixel values as weighted averages of the four nearest source pixels, which reduces jagged edges compared to nearest-neighbor methods. Bilinear interpolation differs from the affine transform itself by focusing on value estimation rather than coordinate mapping, ensuring high-quality output in applications like texture mapping.^[31]^[32] Affine transformations play a key role in machine learning for computer vision, particularly in data augmentation techniques that generate varied training samples to enhance model generalization. By applying rotations, flips, scaling, and shearing— all affine operations— to input images, datasets can simulate real-world variations, such as object orientations in classification tasks, leading to improved accuracy on benchmarks like ImageNet. A comprehensive survey highlights that these geometric augmentations, parameterized by simple linear equations, require minimal computational overhead while effectively simulating variations.^[33]^[34] Despite their versatility, affine transformations have limitations in handling non-parallel distortions, as they cannot replicate the convergence of lines under true perspective, necessitating projective (homography) transformations for accurate modeling in scenarios like wide-angle lens correction. For example, in image stitching, affines suffice for small viewpoint changes but fail for significant depth variations, where projectives preserve collinearity but alter parallelism. In computations, the augmented matrix approach streamlines these operations by representing translations alongside linear components in a single matrix multiplication.^[35]^[36] Recent advancements post-2020 integrate affine transformations into neural rendering pipelines to enable view-dependent synthesis and editing. Methods like HoloGAN employ explicit affine layers to manipulate learned 3D features under camera poses, facilitating dynamic scene reconstruction from sparse inputs. Additionally, affine-invariant features, such as extensions of the Scale-Invariant Feature Transform (SIFT), detect robust keypoints in AI applications like object recognition, where descriptors remain stable under affine deformations like shearing, as originally proposed in Lowe's seminal work and refined in affine-adapted variants. These contribute to high-impact tasks in neural networks, with SIFT-based matching enabling robust viewpoint-invariant retrieval on standard datasets.^[37]^[38]^[39]

Examples

Over Real Numbers

Affine transformations over the real numbers \mathbb{R} are mappings from \mathbb{R}^n to \mathbb{R}^n that can be represented using matrices, allowing concrete computation with numerical examples in low dimensions such as \mathbb{R}^2.^[4] A simple example is translation in \mathbb{R}^2, defined by f(x, y) = (x + 1, y + 2). This can be expressed in matrix form as

\begin{pmatrix} x' \\ y' \end{pmatrix} = \begin{pmatrix} 1 & 0 & 1 \\ 0 & 1 & 2 \end{pmatrix} \begin{pmatrix} x \\ y \\ 1 \end{pmatrix},

where the augmented matrix incorporates the translation vector (1, 2). Applying this to the point (3, 4) yields f(3, 4) = (4, 6).^[4] Another example is nonuniform scaling in \mathbb{R}^2, given by f(x, y) = (2x, 3y). The linear part is represented by the matrix

A = \begin{pmatrix} 2 & 0 \\ 0 & 3 \end{pmatrix},

with the full affine form using an augmented matrix

\begin{pmatrix} 2 & 0 & 0 \\ 0 & 3 & 0 \end{pmatrix}.

The determinant \det(A) = 6 indicates that areas are scaled by a factor of 6 under this transformation. For instance, the unit square with vertices (0,0), (1,0), (1,1), and (0,1) maps to vertices (0,0), (2,0), (2,3), and (0,3), which has area 6.^[4]^[40] Composition of affine transformations is achieved by matrix multiplication. Consider a 90° counterclockwise rotation followed by the translation f(x, y) = (x + 1, y + 2). The rotation matrix is

R = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix},

and in augmented form,

\begin{pmatrix} 0 & -1 & 0 \\ 1 & 0 & 0 \end{pmatrix}.

The translation augmented matrix is as above. The composed transformation applies rotation first, then translation, yielding the combined augmented matrix

\begin{pmatrix} 0 & -1 & 1 \\ 1 & 0 & 2 \end{pmatrix}.

For the point (1, 0), rotation gives (0, 1), and translation gives (1, 3).^[4] To verify preservation of collinearity, apply the composed transformation to points (0,0), (1,0), and (2,0), which lie on the x-axis. The images are (1,2), (1,3), and (1,4), respectively, which remain collinear on the line x=1. Affine transformations preserve collinearity in general.^[14]

In Plane Geometry

In plane geometry, affine transformations provide a powerful way to distort geometric figures while maintaining key structural features like collinearity and parallelism. Consider the mapping of a unit square to a parallelogram: through a shear that slants one pair of sides and a subsequent scaling that adjusts the lengths, the square's right angles become oblique, yet the opposite sides remain parallel, preserving the parallelogram's essential form.^[41] This example highlights how affine maps can alter orientations and proportions without disrupting the affine hull of the figure.^[2] A striking illustration of affine flexibility is the mapping of any non-collinear triangle to an equilateral triangle, a feat impossible under isometries that rigidly preserve distances and angles. For instance, a scalene triangle such as a 3-4-5 right triangle can be affinely transformed to an equilateral one by stretching and shearing to equalize side lengths and angles, demonstrating the broader class of distortions afforded by affine geometry.^[6] This capability underscores affine transformations' role in reshaping polygonal figures beyond Euclidean constraints.^[42] Affine transformations also preserve barycentric coordinates, ensuring that relative positions within a figure are maintained. In a specific case, a point dividing a line segment in the ratio 1:2—meaning it lies one-third of the way from one endpoint to the other—will map to a point dividing the transformed segment in the identical 1:2 ratio, as these coordinates are invariant under affine maps.^[21] This preservation extends to ratios along lines more generally, allowing consistent interpolation across the plane.^[1] For curved figures, affine transformations distort circles into ellipses, elongating or compressing the shape along principal axes while keeping the curve smooth and closed. Visually, a unit circle centered at the origin might stretch into an elongated ellipse tilted at an angle, with the transformation shearing the circular symmetry into elliptical asymmetry, yet the boundary remains a conic section.^[6] This effect reveals how affine maps generalize Euclidean geometry to handle non-uniform distortions in planar shapes.^[43]

Historical Development

Early Origins

The foundations of affine transformations emerged from classical Greek geometry, where properties of parallels and ratios were central to understanding spatial relations without reliance on distances or angles. In Euclid's Elements (circa 300 BCE), the parallel postulate (Book I, Postulate 5) established that parallel lines maintain consistent separation, while propositions on similar triangles (Book VI) preserved ratios of corresponding sides, anticipating affine invariants like collinearity and parallelism. These elements highlighted geometric configurations invariant under mappings that do not distort ratios along lines or the alignment of points. A seminal precursor is Thales' theorem, attributed to the Greek mathematician Thales of Miletus (circa 624–546 BCE), which states that if a line parallel to one side of a triangle intersects the other two sides, it divides those sides in the same ratio. This intercept theorem exemplifies the preservation of division ratios on transversals by parallels, a property fundamental to affine geometry as it remains unchanged under affine mappings. The theorem, later formalized in Euclid's Elements (Book VI, Proposition 2), underscored early intuitions about proportional structures in plane figures.^[18] In the 17th century, René Descartes advanced these ideas through analytic geometry in his La Géométrie (1637), where he introduced Cartesian coordinates to translate geometric problems into algebraic equations. This framework allowed lines and figures to be represented via linear equations, enabling the description of transformations as combinations of linear operations and translations—key components of affine mappings. Descartes' approach bridged classical geometry with algebra, facilitating the analysis of ratio-preserving changes in coordinate systems. # Scriba & Schreiber book mentioning Descartes Leonhard Euler built on this in the 18th century with his Introductio in analysin infinitorum (1748), introducing homogeneous coordinates to handle projective relations and coining the term "affine" from the Latin affinis ("related by") for spaces or curves connected through linear transformations that preserve parallelism but not necessarily distances. Euler's work on projective views emphasized incidence over metrics, influencing affine geometry by showing how such transformations relate figures without Euclidean structure.^[44] The term "affine" was further refined in the 19th century by geometers seeking to distinguish non-metric geometries, as seen in August Ferdinand Möbius's Der barycentrische Calcul (1827), where it described combinations preserving affine structure in barycentric coordinates. This usage solidified affine transformations as distinct from those involving lengths or angles, building directly on Euler's foundations.

Modern Developments

In the late 19th century, Felix Klein's Erlangen program, introduced in his 1872 inaugural lecture, revolutionized geometry by classifying geometric structures according to their underlying groups of transformations, with the affine group defining the symmetries of affine geometry and emphasizing preservation of parallelism and ratios along lines. This framework bridged algebra and geometry, influencing subsequent developments in understanding affine transformations as group actions that maintain collinearity without preserving angles or lengths.^[45] Early 20th-century advancements in Lie theory positioned the affine group as a Lie group, with its structure analyzed through infinitesimal generators corresponding to translations, linear transformations, and their combinations, enabling continuous parameterizations essential for differential geometry applications. Pioneering works by Élie Cartan and Hermann Weyl formalized these aspects, treating the affine Lie algebra as a semidirect product of the general linear group and translations, which facilitated studies of symmetries in curved spaces and physics.^[46] By the mid-20th century, affine transformations found practical applications in crystallography for describing symmetry operations and coordinate mappings in crystal lattices, as detailed in the International Tables for Crystallography, with editions starting from the 1930s standardizing affine mappings to preserve ratios in lattice distortions.^[47] Concurrently, in the 1960s, computer-aided design (CAD) systems incorporated affine transformations for geometric modeling and manipulation of curves and surfaces, allowing efficient handling of scaling, shearing, and translations in early tools like Sketchpad, which laid the groundwork for modern parametric design.^[48] In the late 20th century, affine transformations became central to computer vision, particularly through affine registration algorithms developed in the 1990s for aligning images under geometric distortions, as surveyed in foundational works that highlighted robust estimation methods for point correspondences and intensity-based matching in medical and remote sensing applications.^[49] Entering the 21st century, deep learning integrated affine layers into convolutional neural networks (CNNs), notably via spatial transformer networks in 2015, which learn affine warps to achieve invariance to spatial deformations, and batch normalization's affine parameters introduced in 2015, enhancing training stability by allowing learnable scaling and shifting after feature normalization.^[50]^[51] These integrations have since enabled end-to-end learning of affine alignments in tasks like object detection and medical image analysis, with high-impact models demonstrating improvements in accuracy on benchmarks such as COCO through explicit transformation modeling. Post-2015, affine operations have further evolved in vision transformers (e.g., 2020) for positional encodings and in diffusion models for spatial warps, continuing to advance generative and recognition tasks as of 2025.^[52]

References

[1]
Affine Transformations: Basic Definitions and Concepts
An Affine Transformation is a mapping, X, from a point, Q in a d-dimensional affine space to another point Q′ in the same affine space that preserves ...Missing: mathematics | Show results with:mathematics
[2]
Linear Algebra, Part 1: Affine transformations (Mathematica)
Formally, an aﬃne transformation is a mapping from one aﬃne space to another (which may be, and in fact usually is, the same space) that preserves aﬃne ...
[3]
[PDF] Math 149 W02 H. Affine transformations, Part I
Definition. T : Rn → Rn is an affine transformation if T is a homogeneous linear transformation followed by a translation. In other words, there are a.
[4]
[PDF] Affine Transformations
The set of operations providing for all such transformations, are known as the affine transforms. The affines include translations and all linear ...
[5]
Affine Transforms - dirsig
Mar 22, 2024 · The primary mechanism employed to perform this task is the affine transform, which is a combination of rotations, translations, scales (dilations) and shears.
[6]
[PDF] A Fine Use of Transformations
The most important property of affine transformations is that they preserve ratios of lengths and areas. This often allows us to make very magical assumptions ...
[7]
16 Affine Transformations
Note that this material is not from the textbook. Definition: An affine transformation from to is a linear transformation (that is, a homomorphism) followed by ...Missing: mathematics | Show results with:mathematics
[8]
[PDF] Affine Transformations - UT Computer Science
Geometric transformations will map points in one space to points in another: (x',y',z') = f(x,y,z). These transformations can be very simple, such as.
[9]
[PDF] Image Processing Project 3 Affine Transformation, Landmarks ...
The objective of this third project is to implement and study geometric image transformation using affine matrices, registration or image warping.
[10]
[PDF] Affine transformations - Washington
Geometric transformations will map points in one space to points in another: (x', y', z') = f (x, y, z). These transformations can be very simple, such as.
[11]
[PDF] Affine transformations - Washington
A transformation F is an affine transformation if it preserves affine combinations: where the Ai are points, and: Clearly, the matrix form of F has this ...
[12]
[PDF] Vector and Affine Algebra - UT Computer Science
∗ T preserves affine combinations: T(α0P0 + ··· + αnPn) = α0T(P0) + ... – An affine transformation is characterized by the image of a frame in the domain.
[13]
Affine Space -- from Wolfram MathWorld
In an affine space, it is possible to fix a point and coordinate axis such that every point in the space can be represented as an n-tuple of its coordinates.
[14]
Affine Transformation -- from Wolfram MathWorld
An affine transformation is any transformation that preserves collinearity (ie, all points lying on a line initially still lie on a line after transformation)
[15]
[PDF] lecture 2: euclidean spaces, affine spaces
Affine space has less structure than Euclidean space; there is no inner product, and thus no way of measuring distances or angles between vectors. Question: ...Missing: metric | Show results with:metric
[16]
[PDF] 3 Transformations
Transformations. • The inverse of an affine transformation is also affine, assuming it exists. Proof: Let ¯q = A¯p+t and assume A−1 exists, i.e. det(A) 6= 0 ...
[17]
[PDF] CHAPTER 3 - UNM CS
Affine transformations of points have the full 12 degrees of freedom. We can also show that affine transformations preserve lines. Suppose that we write a ...
[18]
[PDF] Basics of Affine Geometry - UPenn CIS
In linear algebra, a (linear) subspace can be characterized as a nonempty subset of a vector space closed under linear combinations. In affine spaces, the ...<|control11|><|separator|>
[19]
[PDF] Representing Shapes as Graphs: A Feasible Approach for the ...
In the special case of an affine transformation, collinearity and ratios of distances are preserved as well. ... properties such as angles, proportions, convexity ...
[20]
[PDF] II.3 : Measurement axioms - UCR Math Department
Another key property of affine transformations is that they preserve convex sets. Further information on this topic is summarized in the file http://math.ucr.
[21]
[PDF] Lecture 4: Affine Transformations for Satan himself is transformed ...
Figure 4: Affine transformations map straight lines to straight lines and preserve ratios of distances along straight lines. Thus ′ a ′ a + ′ b = a a+ b . ...
[22]
[PDF] a graphical introduction to transformations in the real plane
They do not preserve angles or distances, just as linear transformations do not preserve angles or distances. We might say that affine transformations ...
[23]
[PDF] Affine Structure from Motion
It is thus clear that affine transformations do not preserve angles or distances a fact confirmed by Figure 12.1. In fact, it can also be shown that affine ...
[24]
affine transformation - PlanetMath.org
Mar 22, 2013 · ... definition of an affine transformation as a mapping α α from one vector space V V to another, W W , such that there is a linear transformation ...
[25]
Affine Group -- from Wolfram MathWorld
The set of all nonsingular affine transformations of a translation in space constitutes a group known as the affine group. The affine group contains the full ...
[26]
None
### Summary of Affine Group Information from the Document
[27]
[PDF] The Maximality of the Group of Euclidean Similarities within ... - CORE
As a geometric application one may easily conclude from this that the group of Euclidean similarities is maximal within the affine group so that in the sense ...
[28]
[PDF] arXiv:2211.11606v3 [math.GR] 8 Oct 2023
Oct 8, 2023 · The group of affine transformations of Dn may be identified with the semi-direct product GL(n, D) ⋉ Dn, where D := R, C or H.
[29]
[PDF] CMSC 425: Lecture 6 Affine Transformations
Matrix Representations of Affine Transformations: The ... Reflection: In its most general form, a reflection in the plane is given a line and maps points.
[30]
[PDF] Math 149 W02 I. Affine transformations, Part II
Math 149. W02 I. Affine transformations, Part II. 1. Mapping one triangle to another with an affine trans- formation. First, consider the standard triangle ...
[31]
OpenGL FAQ / 9 Transformations
Eye Coordinates result from transforming Object Coordinates by the ModelView matrix. The ModelView matrix contains both modelling and viewing transformations ...
[32]
Coordinate Systems - LearnOpenGL
The model matrix is a transformation matrix that translates, scales and/or rotates your object to place it in the world at a location/orientation they belong to ...
[33]
[PDF] DEWARPING AND DESKEWING OF A DOCUMENT USING AFFINE ...
Abstract: An approach based on affine transformations is applied to solve the problem of dewarping of scanned text images.
[34]
[PDF] Lecture 20: Rotating, Scaling, Shifting and Shearing an Image
Nov 15, 2020 · Bilinear interpolation ... Modifying an Image by Moving Its Points. Affine Transformations. Image Interpolation. Conclusions. Sinc Interpolation.
[35]
Data augmentation: A comprehensive survey of modern approaches
Affine transformations can be represented by a simple generalized first-order linear equation that requires only few parameter changes to accomplish various ...
[36]
A survey on Image Data Augmentation for Deep Learning
Jul 6, 2019 · The image augmentation algorithms discussed in this survey include geometric transformations, color space augmentations, kernel filters, mixing ...
[37]
(PDF) Projective Transformations for Image Transition Animations
However, the affine transformation does not model the perspective transformation frequently found in images. Hence, such techniques can only produce approximate ...<|separator|>
[38]
https://www.cs.ubc.ca/~lowe/papers/ijcv04.pdf
[39]
[PDF] State of the Art on Neural Rendering - Ohad Fried
Apr 8, 2020 · It implements an explicit affine transformation layer that directly applies view manipulations to learnt 3D features. As in DeepVoxels, the ...
[40]
[PDF] Distinctive Image Features from Scale-Invariant Keypoints
Jan 5, 2004 · This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between ...
[41]
[PDF] ASIFT: An Algorithm for Fully Affine Invariant Comparison
ASIFT simulates image views by varying camera orientation, then applies SIFT, covering all six parameters of the affine transform.
[42]
[PDF] Linear and affine transformations - FD intranet
Nov 10, 2020 · With homogeneous coordinates, we can represent all 2D affine transformations as 3D linear transformations. We can then use matrix multiplication ...
[43]
[PDF] Notes on 2-Dimensional Spaces R versus Euclidean 2-space Linear ...
Oct 4, 1998 · richer set of transformations that can map any parallelogram, even a square, onto any other parallelogram. Therefore, Euclidean notions of ...
[44]
[PDF] Berkeley math circle. October 11, 2005. AFFINE AND PROJECTIVE ...
Oct 11, 2005 · These problems are quite simple in case when a triangle is equilateral. An affine transformation of the plane is a map A 7→ A′ such that (1) If ...
[45]
[PDF] Affine Transformations - UCLA Math Circle
May 5, 2024 · Show that every ellipse is affine-equivalent to the unit circle. Hint: use a movement of the plane to put the focal points at (a, 0) and (−a, 0) ...
[46]
https://www.math.stonybrook.edu/~kirillov/liegroups/liegroups.pdf
[47]
Transfer Principles, Klein's Erlangen Program, and Methodological ...
Klein's Erlangen program of 1872 presents a landmark contribution to algebraic reasoning in geometry ... Thus, for instance, congruence in affine geometry ...2. Duality And Transfer... · 3. Klein's Erlangen Program · 4. Structuralist Themes
[48]
[PDF] Introduction to Lie Groups and Lie Algebras Alexander Kirillov, Jr.
This book is an introduction to the theory of Lie groups and Lie algebras, with emphasis on the theory of semisimple Lie algebras.
[49]
[PDF] A History of Curves and Surfaces in CAGD - FarinHansford.com
This article provides a historical account of the major developments in the area of curves and surfaces as they entered the area of CAGD – Computer Aided ...
[50]
A survey of image registration techniques - ACM Digital Library
Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors, ...Missing: seminal | Show results with:seminal