Robust iterative fitting of multilinear models

Authors:
S.A. Vorobyov;Yue Rong;N.D. Sidiropoulos;A.B. Gershman
Affiliations:
Dept. of Commun. Syst., Darmstadt Univ. of Technol., Germany;-;-;-
Venue:
IEEE Transactions on Signal Processing - Part I
Year:
2005

Citing 0
Cited 8

Blind PARAFAC signal detection for polarization sensitive array

EURASIP Journal on Applied Signal Processing
4D near-field source localization using cumulant

EURASIP Journal on Applied Signal Processing
Canonical decomposition of ictal scalp EEG and accurate source localisation: principles and simulation study

Computational Intelligence and Neuroscience - EEG/MEG Signal Processing
Blind Joint Symbol Detection and DOA Estimation for OFDM System with Antenna Array

Wireless Personal Communications: An International Journal
A novel semiblind signal extraction approach for the removal of eye-blink artifact from EEGs

EURASIP Journal on Advances in Signal Processing
Blind multiuser detection for MC-CDMA with antenna array

Computers and Electrical Engineering
Novel blind carrier frequency offset estimation for OFDM system with multiple antennas

IEEE Transactions on Wireless Communications
A semi-algebraic framework for approximate CP decompositions via simultaneous matrix diagonalizations (SECSI)

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel factor (PARAFAC) analysis is an extension of low-rank matrix decomposition to higher way arrays, also referred to as tensors. It decomposes a given array in a sum of multilinear terms, analogous to the familiar bilinear vector outer products that appear in matrix decomposition. PARAFAC analysis generalizes and unifies common array processing models, like joint diagonalization and ESPRIT; it has found numerous applications from blind multiuser detection and multidimensional harmonic retrieval, to clustering and nuclear magnetic resonance. The prevailing fitting algorithm in all these applications is based on (alternating) least squares, which is optimal for Gaussian noise. In many cases, however, measurement errors are far from being Gaussian. In this paper, we develop two iterative algorithms for the least absolute error fitting of general multilinear models. The first is based on efficient interior point methods for linear programming, employed in an alternating fashion. The second is based on a weighted median filtering iteration, which is particularly appealing from a simplicity viewpoint. Both are guaranteed to converge in terms of absolute error. Performance is illustrated by means of simulations, and compared to the pertinent Crame´r-Rao bounds (CRBs).