Scribd
Upload
20 views3 pages

Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors

1. A novel probabilistic tensor CPD algorithm is proposed to overcome disadvantages of existing methods such as requiring knowledge of tensor rank and inability to handle outliers. 2. The algorithm alternately estimates factor matrices, recovers tensor rank, and mitigates outliers, without requiring knowledge of noise power or outlier statistics. 3. Simulation results on synthetic and real data demonstrate the algorithm's excellent performance in terms of accuracy and robustness compared to existing methods.

Uploaded by

Anonymous 1aqlkZ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views3 pages

Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors

1. A novel probabilistic tensor CPD algorithm is proposed to overcome disadvantages of existing methods such as requiring knowledge of tensor rank and inability to handle outliers. 2. The algorithm alternately estimates factor matrices, recovers tensor rank, and mitigates outliers, without requiring knowledge of noise power or outlier statistics. 3. Simulation results on synthetic and real data demonstrate the algorithm's excellent performance in terms of accuracy and robustness compared to existing methods.

Uploaded by

Anonymous 1aqlkZ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Probabilistic Tensor Canonical Polyadic Decomposition with

Orthogonal Factors
Abstract

Tensor canonical polyadic decomposition (CPD), which recovers the latent factor matrices from
multidimensional data, is an important tool in signal processing. In many applications, some of
the factor matrices are known to have orthogonality structure, and this information can be
exploited to improve the accuracy of latent factors recovery. However, existing methods for CPD
with orthogonal factors all require the knowledge of tensor rank, which is difficult to acquire,
and have no mechanism to handle outliers in measurements. To overcome these disadvantages,
in this paper, In particular, the problem of tensor CPD with orthogonal factors is interpreted
using a probabilistic model, based on which an inference algorithm is proposed that alternatively
estimates the factor matrices, recovers the tensor rank, and mitigates the outliers. Simulation
results using synthetic data and real-world applications are presented to illustrate the excellent
performance of the proposed algorithm in terms of accuracy and robustness.

Index Terms—Multidimensional signal processing, orthogonal constraints, robust estimation,


tensor canonical polyadic decomposition.

Objective

A novel tensor CPD algorithm based on the probabilistic inference framework is devised.

1. INTRODUCTION:

Many problems in signal processing, such as independent component analysis (ICA) with
matrix-based models blind signal estimation in wireless communications localization in array
signal processing and linear image coding. In order to overcome the disadvantages presented in
existing methods, we devise a novel algorithm for complex-valued tensor CPD with orthogonal
factors based on the probabilistic inference framework.

Proposed method
Fig. 1. Probabilistic model for tensor CPD with orthogonal factors.

4. SOFTWARE AND HARDWARE REQUIREMENTS

 Operating system : Windows XP/7.


 Coding Language : MATLAB
 Tool : MATLAB R 2012

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

 System : Pentium IV 2.4 GHz.


 Hard Disk : 40 GB.
 Floppy Drive : 1.44 Mb.
 Monitor : 15 VGA Colour.
 Mouse : Logitech.
 Ram : 512 Mb.
5. CONCLUSION:

In this paper, a probabilistic CPD algorithm with orthogonal factors has been proposed for
complex-valued tensors, under unknown tensor rank and in the presence of outliers. It has been
shown that, without knowledge of noise power and outlier statistics, the proposed algorithm
alternatively estimates the factor matrices, recovers the tensor rank and mitigates the outliers.
Interestingly, the widely used OALS algorithm in [17] has been shown to be a special case of the
proposed algorithm. Simulation results using synthetic data and tests on real data have
demonstrated the excellent performance of the proposed algorithm in terms of accuracy and
robustness.

6. REFERENCES:

[1] L. D. Lathauwer, “A short introduction to tensor-based methods for factor analysis and blind
source separation,” in Proc. IEEE Int. Symp. Image Signal Process. Anal., Dubrovnik, Croatia,
Sep. 4-6, 2011, pp. 558–563.

[2] J. F. Cardoso, “High-order contrasts for independent component analysis,” Neural Comput.,
vol. 11, no. 1, pp. 157–192, 1999.

[3] C. F. Beckmann and S. M. Smith, “Tensorial extensions of independent component analysis


for multisubject FMRI analysis,” Neuroimage, vol. 25, no. 1, pp. 294–231, 2005.

[4] L. De Lathauwer, “Algebraic methods after prewhitening,” in Handbook of Blind Source


Separation, Independent Component Analysis and Applications. New York, NY, USA:
Academic, 2010, pp. 155–177.

[5] N. D. Sidiropoulos, G. B. Giannakis, and R. Bro, “Blind PARAFAC receivers for DS-CDMA
systems,” IEEE Trans. Signal Process., vol. 48, no. 3, pp. 810–823, 2000.

You might also like