Generalized structure tensor

It is a widely known method in applications of image and video processing including computer vision, such as biometric identification by fingerprints, and studies of human tissue sections.

GST in 2D and locally orthogonal bases

Let the term image represent a function $f (ξ (x, y), η (x, y))$ where $x, y$ are real variables and $ξ, η$ , and $f$ , are real valued functions. GST represents the direction along which the image $f$ can undergo an infinitesimal translation with minimal (total least squares) error, along the "lines" fulfilling the following conditions:

1. The "lines" are ordinary lines in the curvilinear coordinate basis $ξ, η$

\cos (θ) ξ (x, y) + \sin (θ) η (x, y) = constant

which are curves in Cartesian coordinates as depicted by the equation above. The error is measured in the $L^{2}$ sense and the minimality of the error refers thereby to L2 norm.

2. The functions $ξ (x, y), η (x, y)$ constitute a harmonic pair, i.e. they fulfill Cauchy–Riemann equations,

\begin{matrix} \frac{\partial ξ}{\partial x} = - \frac{\partial η}{\partial y}, \\ \frac{\partial ξ}{\partial y} = \frac{\partial η}{\partial x} . \end{matrix}

Accordingly, such curvilinear coordinates $ξ, η$ are locally orthogonal.

Then GST consists in

G S T = (λ_{m a x} - λ_{m i n}) \int w (ξ, η) [\begin{matrix} \frac{\partial f}{\partial ξ} \\ \frac{\partial f}{\partial η} \end{matrix}] [\frac{\partial f}{\partial ξ}, \frac{\partial f}{\partial η}] d ξ d η + λ_{m i n} I

where $0 \leq λ_{m i n} \leq λ_{m a x}$ are errors of (infinitesimal) translation in the best direction (designated by the angle $θ$ ) and the worst direction (designated by $θ + π / 2$ ). The function $w (ξ, η)$ is the window function defining the "outer scale" wherein the detection of $θ$ will be carried out, which can be omitted if it is already included in $f$ or if $f$ is the full image (rather than local). The matrix $I$ is the identity matrix. Using the chain rule, it can be shown that the integration above can be implemented as convolutions in Cartesian coordinates applied to the ordinary structure tensor when $ξ, η$ pair the real and imaginary parts of an analytic function $g (z)$ ,

\begin{matrix} ξ (x, y) = ℜ g (z) \\ η (x, y) = ℑ g (z) \end{matrix}

where $z = x + i y$ . Examples of analytic functions include $g (z) = \log z = \log (x + i y)$ , as well as monomials $g (z) = z^{n} = (x + i y)^{n}$ , $g (z) = z^{n / 2} = (x + i y)^{n / 2}$ , where $n$ is an arbitrary positive or negative integer. The monomials $g (z) = z^{n}$ are also referred to as harmonic functions in computer vision, and image processing.

Thereby, Cartesian Structure tensor is a special case of GST where $ξ = x$ , and $η = y$ , i.e. the harmonic function is simply $g (z) = z = (x + i y)$ . Thus by choosing a harmonic function $g$ , one can detect all curves that are linear combinations of its real and imaginary parts by convolutions on (rectangular) image grids only, even if $ξ, η$ are non-Cartesian. Furthermore, the convolution computations can be done by using complex filters applied to the complex version of the structure tensor. Thus, GST implementations have frequently been done using complex version of the structure tensor, rather than using the (1,1) tensor.

4 more chapters are free with a Lably account.

Complex version of GST

As there is a complex version of the ordinary structure tensor, there is also a complex version of the GST

\begin{matrix} κ_{20} = (λ_{1} - λ_{2}) \exp (i 2 θ) & = & w * (h * f)^{2} \\ κ_{11} = λ_{1} + λ_{2} & = & | w | * | h * f |^{2} \end{matrix}

which is identical to its cousin with the difference that $w$ is a complex filter. It should be recalled that, the ordinary structure tensor $w$ is a real filter, usually defined by a sampled and scaled Gaussian to delineate the neighborhood, also known as the outer scale. This simplicity is a reason for why GST implementations have predominantly used the complex version above. For curve families $ξ, η$ defined by analytic functions $g$ , it can be shown that, the neighborhood defining function is complex valued,

w = (x \pm i y)^{n} \exp (- (x^{2} + y^{2}) / (2 σ^{2})) \propto (D_{x} \pm i D_{y})^{n} \exp (- (x^{2} + y^{2}) / (2 σ^{2}))

a so called symmetry derivative of a Gaussian. Thus, the orientation wise variation of the pattern to be looked for is directly incorporated into the neighborhood defining function, and the detection occurs in the space of the (ordinary) structure tensor.

Basic concept for its use in image processing and computer vision

Efficient detection of $θ$ in images is possible by image processing for a pair $ξ$ , $η$ . Complex convolutions (or the corresponding matrix operations) and point-wise non-linear mappings are the basic computational elements of GST implementations. A total least square error estimation of $2 θ$ is then obtained along with the two errors, $λ_{m a x}$ and $λ_{m i n}$ . In analogy with the Cartesian structure tensor, the estimated angle is in double angle representation, i.e. $2 θ$ is delivered by computations, and can be used as a shape feature whereas $λ_{m a x} - λ_{m i n}$ alone or in combination with $λ_{m a x} + λ_{m i n}$ can be used as a quality (confidence, certainty) measure for the angle estimation.

Logarithmic spirals, including circles, can for instance be detected by (complex) convolutions and non-linear mappings. The spirals can be in gray (valued) images or in a binary image, i.e. locations of edge elements of the concerned patterns, such as contours of circles or spirals, must not be known or marked otherwise.

Generalized structure tensor can be used as an alternative to Hough transform in image processing and computer vision to detect patterns whose local orientations can be modelled, for example junction points. The main differences comprise:

Negative, as well as complex voting are allowed;
With one template multiple patterns belonging to the same family can be detected;
Image binarization is not required.

Physical and mathematical interpretation

The curvilinear coordinates of GST can explain physical processes applied to images. A well known pair of processes consist in rotation, and zooming. These are related to the coordinate transformation $ξ = \log (\sqrt{x^{2} + y^{2}})$ and $η = \tan^{- 1} (x, y)$ .

If an image $f$ consists in iso-curves that can be explained by only $ξ$ i.e. its iso-curves consist in circles $f (ξ, η) = g (ξ)$ , where $g$ is any real valued differentiable function defined on 1D, the image is invariant to rotations (around the origin).

Zooming (comprising unzooming) operation is modeled similarly. If the image has iso-curves that look like a "star" or bicycle spokes, i.e. $f (ξ, η) = g (η)$ for some differentiable 1D function $g$ then, the image $f$ is invariant to scaling (w.r.t. the origin).

In combination,

f (ξ, η) = g (\cos (θ) \log (\sqrt{x^{2} + y^{2}}) + \sin (θ) \tan^{- 1} (x, y))

is invariant to a certain amount of rotation combined with scaling, where the amount is precised by the parameter $θ$ .

Analogously, the Cartesian structure tensor is a representation of a translation too. Here the physical process consists in an ordinary translation of a certain amount along $x$ combined with translation along $y$ ,

\cos (θ) x + \sin (θ) y = constant

where the amount is specified by the parameter $θ$ . Evidently $θ$ here represents the direction of the line.

Generally, the estimated $θ$ represents the direction (in $ξ, η$ coordinates) along which infinitesimal translations leave the image invariant, in practice least variant. With every curvilinear coordinate basis pair, there is thus a pair of infinitesimal translators, a linear combination of which is a Differential operator. The latter are related to Lie algebra.

Miscellaneous

"Image" in the context of the GST can mean both an ordinary image and an image neighborhood thereof (local image), depending on context. For example, a photograph is an image as is any neighborhood of it.