Learning invariances with stationary subspace analysis

Frank C. Meinecke, Paul Von Bünau, Motoaki Kawanabe, Klaus R. Müller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Recently, a novel subspace decomposition method, termed 'Stationary Subspace Analysis' (SSA), has been proposed by Bünau et al. [10]. SSA aims to find a linear projection to a lower dimensional subspace such that the distribution of the projected data does not change over successive epochs or sub-datasets. We show that by modifying the loss function and the optimization procedure we can obtain an algorithm that is both faster and more accurate. We discuss the problem of indeterminacies and provide a lower bound on the number of epochs that is needed. Finally, we show in an experiment with simulated image patches, that SSA can be used favourably in invariance learning.

Original languageEnglish
Title of host publication2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
Pages87-92
Number of pages6
DOIs
Publication statusPublished - 2009
Event2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009 - Kyoto, Japan
Duration: 2009 Sept 272009 Oct 4

Publication series

Name2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009

Other

Other2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
Country/TerritoryJapan
CityKyoto
Period09/9/2709/10/4

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Learning invariances with stationary subspace analysis'. Together they form a unique fingerprint.

Cite this