Auto-regressive independent process analysis without combinatorial efforts

  • Authors:

  • Zoltán Szabó;Barnabás Póczos;András Lőrincz

  • Affiliations:

  • Eötvös Loránd University, Department of Information Systems, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary;Eötvös Loránd Univ., Dept. of Info. Sys., Pázmány Péter sétány 1/C, 1117, Budapest, Hungary and Univ. of Alberta, Dept. of Comp. Sci., Athab ...;Eötvös Loránd University, Department of Information Systems, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

  • Venue:
  • Pattern Analysis & Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We treat the problem of searching for hidden multi-dimensional independent auto-regressive processes (auto-regressive independent process analysis, AR-IPA). Independent subspace analysis (ISA) can be used to solve the AR-IPA task. The so-called separation theorem simplifies the ISA task considerably: the theorem enables one to reduce the task to one-dimensional blind source separation task followed by the grouping of the coordinates. However, the grouping of the coordinates still involves two types of combinatorial problems: (a) the number of the independent subspaces and their dimensions, and then (b) the permutation of the estimated coordinates are to be determined. Here, we generalize the separation theorem. We also show a non-combinatorial procedure, which—under certain conditions—can treat these two combinatorial problems. Numerical simulations have been conducted. We investigate problems that fulfill sufficient conditions of the theory and also others that do not. The success of the numerical simulations indicates that further generalizations of the separation theorem may be feasible.