Summary: Technische Universit¨at Hamburg­Harburg
Technische Informatik I
Fast adaptive calculation of invariant features
Interner Bericht 1/95
Sabine Kr¨oner Hanns Schulz­Mirbach
TU Hamburg­Harburg TU Hamburg­Harburg
Technische Informatik I Technische Informatik I
21071 Hamburg, Germany 21071 Hamburg, Germany
kroener@tu­harburg.d400.de schulz­mirbach@tu­harburg.d400.de
March 1995

Abstract
The paper presents algorithms for the fast adaptive calculation of invariant features.
These are pattern characteristics that remain unchanged under the action of a transfor­
mation group. First it is explained how to construct such features by integrating complex
valued functions over the transformation group. Motivated by this technique we devise
algorithms for adaptively calculating invariant features especially suited for a given appli­
cation. The basic tool is a new network structure with adaptable nodes allowing the fast
calculation of an invariant feature with the computational complexity of O(N) (N the
size of the input data). The algorithms have been implemented and tested both on real

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

Collections: Computer Technologies and Information Sciences