Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/73401
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Efficient computation of robust weighted low-rank matrix approximations using the L₁ norm
Other Titles: Efficient computation of robust weighted low-rank matrix approximations using the L(1) norm
Author: Eriksson, A.
Van Den Hengel, A.
Citation: IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012; 34(9):1681-1690
Publisher: IEEE Computer Soc
Issue Date: 2012
ISSN: 0162-8828
1939-3539
Statement of
Responsibility: 
Anders Eriksson and Anton van den Hengel
Abstract: The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in computer vision and other fields. One of the primary tools used for calculating such low-rank approximations is the Singular Value Decomposition, but this method is not applicable in the case where there are outliers or missing elements in the data. Unfortunately, this is often the case in practice. We present a method for low-rank matrix approximation which is a generalization of the Wiberg algorithm. Our method calculates the rank-constrained factorization, which minimizes the L1 norm and does so in the presence of missing data. This is achieved by exploiting the differentiability of linear programs, and results in an algorithm can be efficiently implemented using existing optimization software. We show the results of experiments on synthetic and real data.
Keywords: Low-rank matrix approximation; L1-minimization
Rights: © 2012 IEEE
RMID: 0020121829
DOI: 10.1109/TPAMI.2012.116
Grant ID: http://purl.org/au-research/grants/arc/DP0988439
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_73401.pdfRestricted Access717.25 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.