Robust FFT-based scale-invariant image registration with image gradients

Georgios Tzimiropoulos1, Vasileios Argyriou, Stefanos Zafeiriou

  • 1Department of Electrical and Electronic Engineering, Imperial College London, London SW7 2AZ, UK. gt204@imperial.ac.uk

Related Concept Videos

Gradient Vectors and Their Applications01:19

Gradient Vectors and Their Applications

Every point on a topographical map corresponds to a particular elevation, so the landscape can be modeled as a surface whose height depends on horizontal position. From any given location, a hiker may face infinitely many directions, but only one direction produces the fastest possible increase in elevation. This unique route is called the direction of steepest ascent, and in multivariable calculus, it is represented by the gradient vector of the elevation function.The gradient vector points...
Significance of the Gradient Vector01:27

Significance of the Gradient Vector

A surface defined by a function of two variables can be understood by examining how it changes along specific directions. When one variable is held constant, the surface reduces to a curve that reflects variation in the other variable. For example, fixing one variable and moving parallel to a coordinate axis produces a cross-sectional curve. The slope of this curve at a given point represents how the function changes in that particular direction, providing a measure of local steepness.By...
Gradient Fields01:27

Gradient Fields

A gradient field is a vector field derived from a scalar field. A scalar field assigns a single numerical value to every point in space, such as temperature, pressure, or electric potential. The gradient field describes how that value changes from point to point. It gives both the direction of the fastest increase and the rate of change in that direction.For a scalar field f(x, y), the gradient is written as\begin{equation*}\nabla f=\left\langle \jfrac{\partial f}{\partial x},\jfrac{\partial...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.