Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast adaptive calculation of invariant features Sabine Kroner and Hanns SchulzMirbach
 

Summary: Fast adaptive calculation of invariant features
Sabine Kr¨oner and Hanns Schulz­Mirbach
Technische Universit¨at Hamburg­Harburg
Institut f¨ur Technische Informatik I
21071 Hamburg, Germany
Abstract. The paper presents algorithms for the fast adaptive calcula­
tion of invariant features. These are pattern characteristics that remain
unchanged under the action of a transformation group. First it is ex­
plained 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 application. The basic tool is a new network struc­
ture 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 and synthetic data. By an experimental comparison with other tech­
niques for calculating invariants we elucidate the abilities of our adaptive
algorithms.
1 Introduction
Invariant features are pattern characteristics that remain unchanged under the

  

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

 

Collections: Computer Technologies and Information Sciences