Undercomplete Blind Subspace Deconvolution Via Linear Prediction

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

DOI: 10.1007/978-3-540-74958-5_75

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4701)
Cite this paper as:
Szabó Z., Póczos B., Lőrincz A. (2007) Undercomplete Blind Subspace Deconvolution Via Linear Prediction. In: Kok J.N., Koronacki J., Mantaras R.L.., Matwin S., Mladenič D., Skowron A. (eds) Machine Learning: ECML 2007. ECML 2007. Lecture Notes in Computer Science, vol 4701. Springer, Berlin, Heidelberg

Abstract

We present a novel solution technique for the blind subspace deconvolution (BSSD) problem, where temporal convolution of multidimensional hidden independent components is observed and the task is to uncover the hidden components using the observation only. We carry out this task for the undercomplete case (uBSSD): we reduce the original uBSSD task via linear prediction to independent subspace analysis (ISA), which we can solve. As it has been shown recently, applying temporal concatenation can also reduce uBSSD to ISA, but the associated ISA problem can easily become ‘high dimensional’ [1]. The new reduction method circumvents this dimensionality problem. We perform detailed studies on the efficiency of the proposed technique by means of numerical simulations. We have found several advantages: our method can achieve high quality estimations for smaller number of samples and it can cope with deeper temporal convolutions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Zoltán Szabó
    • 1
  • Barnabás Póczos
    • 1
  • András Lőrincz
    • 1
  1. 1.Department of Information Systems, Eötvös Loránd University, Pázmány P. sétány 1/C, Budapest H-1117Hungary

Personalised recommendations