Undercomplete Blind Subspace Deconvolution via Linear Prediction

Details Undercomplete Blind Subspace Deconvolution via Linear Prediction Undercomplete Blind Subspace Deconvolution via Linear Prediction

2007-06-23

arxiv.org/abs/0706.3435v1

European Conference on Machine Learning (ECML), pages 740-747, 2007

Statistics

Methodology

12 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Undercomplete Blind Subspace Deconvolution via Linear Prediction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Undercomplete Blind Subspace Deconvolution via Linear Prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Undercomplete Blind Subspace Deconvolution via Linear Prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178349