Content deleted Content added
Seliseli88 (talk | contribs) No edit summary |
rm dead zenodo link |
||
(28 intermediate revisions by 15 users not shown) | |||
Line 1:
{{FeatureDetectionCompVisNavbox}}
In [[image analysis]], the '''generalized structure tensor (GST)''' is an extension of the Cartesian [[structure tensor]] to [[curvilinear coordinates]].<ref name="bigun04pami3">{{cite
It is a widely known method in
|doi=10.1109/TIP.2007.916155
|pmid=18270124
|title=Local Features for Enhancement and Minutiae Extraction in Fingerprints
|journal=IEEE Transactions on Image Processing
|volume=17
|issue=3
|pages=354–363
|last1=Fronthaler
|first1=H.
|last2=Kollreider
|first2=K.
|last3=Bigun
|first3=J.
|bibcode=2008ITIP...17..354F
|url=http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1358
|citeseerx=10.1.1.160.6312
|s2cid=7119251
}}</ref> and studies of human tissue sections.<ref name=Schmitt>{{cite journal|author1=O. Schmitt |author2=H. Birkholz |
title=Improvement in cytoarchitectonic mapping by combining electrodynamic modeling with local orientation in high-resolution images of the cerebral cortex|
journal=Microsc. Res. Tech.|
volume= 74|issue=3 |
year=2010|
pages= 225–243|
doi=10.1109/TIP.2007.916155
|pmid=18270124 |s2cid=7119251 |url=http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1358
}}</ref><ref name=Schmitt2>{{cite journal |author1=O. Schmitt |author2=M. Pakura |author3=T. Aach |author4=L. Homke |author5=M. Bohme |author6=S. Bock |author7=S. Preusse |title=Analysis of nerve fibers and their distribution in histologic sections of the human brain |journal=Microsc. Res. Tech. |volume=63 |issue=4 |year=2004 |pages=220–243 |doi=10.1002/jemt.20033 |pmid=14988920 |s2cid=28746142}}</ref>
==GST in 2D and locally orthogonal
Let the term image represent a function <math>f(\xi(x,y),\eta(x,y))</math> where <math>x,y</math> are real variables and <math>\xi,\eta</math>, and <math>f</math>, are real valued functions. GST represents the direction along which the image <math>f</math> 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 <math>\xi,\eta</math>
: <math>
which are curves in Cartesian coordinates as depicted by the equation
2. The functions <math>\xi(x,y), \eta(x,y)</math> constitute a harmonic pair, i.e. they fulfill [[Cauchy–Riemann equations]],
Line 58 ⟶ 52:
Accordingly, such curvilinear coordinates <math>\xi,\eta</math> are locally orthogonal.
Then
: <math>GST=(\lambda_{max}-\lambda_{min})
\int w(\xi,\eta)\left[
\begin{array}{c}
\frac{\partial f}{\partial \xi} \\
\frac{\partial f}{\partial \eta} \\
\end{array}
\right]
[\
where <math>
:<math>
\begin{array}{c}
\xi(x,y)=\Re g(z)\\
\eta(x,y)=\Im g(z)\\
\end{array}
</math>
where <math>z=x+iy</math>.<ref>{{cite journal |last1=Bigun |first1=Josef |title=Pattern Recognition in Images by Symmetries and Coordinate Transformations |journal=Computer Vision and Image Understanding |date=December 1997 |volume=68 |issue=3 |pages=290–307 |doi=10.1006/cviu.1997.0556}}</ref> Examples of analytic functions include <math>g(z)=\log z=\log(x+iy)</math>, as well as monomials <math>g(z)=z^n=(x+iy)^n</math>, <math>g(z)=z^{n/2}=(x+iy)^{n/2}</math>, where <math>n</math> is an arbitrary positive or negative integer. The monomials <math>g(z)=z^n</math> are also referred to as [[harmonic functions]] in computer vision, and image processing.
Thereby, Cartesian [[Structure tensor]] is a special case of GST where <math>\xi=x</math>, and <math>\eta=y</math>, i.e. the harmonic function is simply <math>g(z)= z=(x+iy)</math>. Thus by choosing a harmonic function <math>g</math>, one can detect all curves that are linear combinations of its real and imaginary parts by convolutions on (rectangular) image grids only, even if <math>\xi,\eta</math> 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.
==Complex version of GST==
As there is a complex version of the ordinary [[structure tensor]], there is also a complex version of the GST
:<math>
\begin{array}{c}
\kappa_{20} =(\lambda_1-\lambda_2)\exp(i2\theta)&=&w*(h*f)^2\\
\kappa_{11} =\lambda_1+\lambda_2&=&|w|*|h*f|^2\\
\end{array}
</math>
which is identical to its cousin with the difference that <math>w</math> is a complex filter. It should be recalled that, the ordinary structure tensor <math>w</math> 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 <math>\xi,\eta</math> defined by analytic functions <math>g</math>, it can be shown that, <ref name="bigun04pami3" /> the neighborhood defining function is complex valued,
:<math>w=(x \pm iy)^n\exp(-(x^2+y^2)/(2\sigma^2))\propto(D_x \pm iD_y)^n\exp(-(x^2+y^2)/(2\sigma^2))
</math>,
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 <math>\theta</math> in images is possible
Logarithmic spirals, including circles,
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
The curvilinear coordinates of GST can explain physical processes applied to images. A well known pair of
If an image <math>f</math> consists in iso-curves that can be explained by only
Zooming (comprising unzooming) operation is modeled similarly.
In combination,
: <math>f(\xi,\eta)=g( \cos(\theta) \log(\sqrt{x^2+y^2})+\sin(\theta) \tan^{-1}(x,y))</math>
is invariant to a certain amount of rotation combined with scaling, where the amount is precised by the parameter <math>\theta</math>.
Analogously, the Cartesian [[structure tensor]] is a representation of a [[Translation (geometry)|translation]] too. Here the physical process consists in an ordinary translation of a certain amount along <math>x</math> combined with translation along <math>y</math>,
: <math>\cos(\theta) x+\sin(\theta) y= \text{constant}</math>
where the amount is specified by the parameter <math>\theta</math>. Evidently <math>\theta</math> here represents the direction of the line.
Generally, the estimated <math>\theta</math> represents the direction (in <math>\xi,\eta</math> 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.
== See also ==
Line 127 ⟶ 147:
{{reflist}}
[[Category:Tensors]]
[[Category:Feature detection (computer vision)]]
|