Sciweavers

Share
TSP
2008

Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm

8 years 11 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D 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 non-convergent 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. Key Words: Low-rank matrix approximatio...
Pei Chen
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2008
Where TSP
Authors Pei Chen
Comments (0)
books