Fast and accurate matrix completion via truncated nuclear norm regularization
Recovering a large matrix from a small subset of its entries is a challenging problem arising in many real applications, such as image inpainting and recommender systems. Many existing approaches formulate this problem as a general low-rank matrix approximation problem. Since the rank operator is no...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 9 vom: 20. Sept., Seite 2117-30
|
|---|
| 1. Verfasser: |
Hu, Yao
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Zhang, Debing,
Ye, Jieping,
Li, Xuelong,
He, Xiaofei |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2013
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article
Research Support, Non-U.S. Gov't
Research Support, U.S. Gov't, Non-P.H.S. |
|---|