ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Neural Networks
Volume 4, Issue 5, 1991, Pages 627-641
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1363 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0893-6080(91)90017-Y    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1991 Published by Elsevier Ltd.

Original contribution

On probabilistic invariancestar, open

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Reiner LenzCorresponding Author Contact Information, a

aLinköping University Sweden


Received 18 June 1990; 
accepted 11 February 1991. 
Available online 19 March 2003.

Abstract

The invariance principle is one important design principle in low-level pattern recognition. In the first part of this paper we investigate some theoretical aspects of this principle. In the second part we show how an adaptive filter system reacts to pattern sets that involve some kind of invariance.

In its most general, group-theoretical form the invariance principle can be formulated as follows:

We assume that we have a class of patterns of interest {pi : iepsilon (Porson)I} and a given pattern q. The problem is to decide if q was a pattern of interest or not, i.e., if q = pi0 for some i0epsilon (Porson)I. If the patterns pi are generated from a common prototype pattern p0 with the help of transformations gi and if these transformations gi form a group G then this problem can be solved by finding maximum correlation filter sets. The relation between these filter sets and the prototype pattern p0 and the transformation group G is completely known.

The construction of the filter functions is, however, based on the assumption that all transformations giepsilon (Porson)G (and therefore also all patterns pi) appear equally often. The purpose of this paper is the generalization of the filter construction process to pattern classes whose elements obey some probability distribution. In the special cases of 2-D rotation invariance and scale invariance, we will show how the maximum correlation filters depend on the prototype pattern, the transformation group, and the probability distribution. We will also sketch the theory for the case of arbitrary compact transformation groups and what type of problems turn up in this case.

In the last part of the paper we describe an adaptive filter system that can find the maximum correlation filter functions automatically from a given set of patterns of interest. This filter system also uses a kind of maximum separation principle so that the resulting feature vectors can be easily used by classifiers. We demonstrate how such a filter system stabilizes in states that correspond to the theoretically derived filter functions and how this filter system reacts to invariance properties in the trainings set.

Keywords: Invariance; Group theory; Filter design

star, openThis work was supported by a grant from the Swedish Board for Technical Development.


Corresponding Author Contact InformationRequests for reprints should be sent to Reiner Lenz, Dept. EE, Linköping University, S-58183 Linköping, Sweden.

Neural Networks
Volume 4, Issue 5, 1991, Pages 627-641
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.