The goal of this paper is to transfer convolution, correlation and Fourier transform to second order tensor fields. Convolution of two tensor fields is defined using matrix multiplication. Convolution of a tensor field with a scalar mask can thus be described by multiplying the scalars with the real unit matrix. The Fourier transform of tensor fields defined in this paper corresponds to Fourier transform of each of
the tensor components in the field. It is shown that for this convolution and Fourier transform, the well known convolution theorem holds and optimization in speed can be achieved by using Fast Fourier transform algorithms. Furthermore, pattern matching on tensor fields based on this convolution is described.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32974 |
Date | 04 February 2019 |
Creators | Hlawitschka, Mario, Ebling, Julia, Scheuermann, Gerik |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | info:eu-repo/semantics/publishedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Relation | 0-88986-454-3 |
Page generated in 0.0014 seconds