The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A Convex Approach to Low Rank Matrix Approximation with Missing Data

På svenska

Author

Summary, in English

Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problem is that they can be efficiently solved using singular value decomposition. However this approach fails if the measurement matrix contains missing data. In this paper we propose a new method for estimating missing data. Our approach is similar to that of L-1 approximation schemes that have been successfully used for recovering sparse solutions of under-determined linear systems. We use the nuclear norm to formulate a convex approximation of the missing data problem. The method has been tested on real and synthetic images with promising results.

Publishing year

2009

Language

English

Pages

301-309

Publication/Series

Image Analysis, Proceedings

Volume

5575

Document type

Conference paper

Publisher

Springer

Topic

  • Mathematics

Conference name

16th Scandinavian Conference on Image Analysis

Conference date

2009-06-15 - 2009-06-18

Conference place

Oslo, Norway

Status

Published

ISBN/ISSN/Other

  • ISSN: 1611-3349
  • ISSN: 0302-9743