By Topic

Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pei Chen ; Chinese Acad. of Sci., Shenzhen

Low-rank matrix approximation has applications in many fields, such as 2-D filter design and 3-D reconstruction from an image sequence. In this paper, one issue with low-rank matrix approximation is investigated: heteroscedastic noise. In most of previous research, the covariance matrix of the heteroscedastic noise is assumed to be positive definite. This requirement restricts the usefulness of results derived from such research. In this paper, we extend the Wiberg algorithm, which originally deals with the missing data problem with low-rank approximation, to the cases, where the heteroscedastic noise has a singular covariance matrix. Experiments show that the proposed Wiberg algorithm converges much faster than the bilinear approach, and consequently avoids many nonconvergent cases in the bilinear approach. Experiments also show that, to some extent, the Wiberg algorithm can tolerate outliers and is not sensitive to parameter variation.

Published in:

IEEE Transactions on Signal Processing  (Volume:56 ,  Issue: 4 )