CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Rank Minimization with Structured Data Patterns

Viktor Larsson ; Carl Olsson ; Erik Bylow ; Fredrik Kahl (Institutionen för signaler och system, Bildanalys och datorseende)
Lecture Notes in Computer Science: 13th European Conference on Computer Vision, ECCV 2014, Zurich, Switzerland, 6-12 September 2014 (0302-9743). Vol. 8691 (2014), p. 250-265.
[Konferensbidrag, refereegranskat]

The problem of finding a low rank approximation of a given measurement matrix is of key interest in computer vision. If all the elements of the measurement matrix are available, the problem can be solved using factorization. However, in the case of missing data no satisfactory solution exists. Recent approaches replace the rank term with the weaker (but convex) nuclear norm. In this paper we show that this heuristic works poorly on problems where the locations of the missing entries are highly correlated and structured which is a common situation in many applications. Our main contribution is the derivation of a much stronger convex relaxation that takes into account not only the rank function but also the data. We propose an algorithm which uses this relaxation to solve the rank approximation problem on matrices where the given measurements can be organized into overlapping blocks without missing data. The algorithm is computationally efficient and we have applied it to several classical problems including structure from motion and linear shape basis estimation. We demonstrate on both real and synthetic data that it outperforms state-of-the-art alternatives.




Denna post skapades 2015-01-08. Senast ändrad 2016-05-24.
CPL Pubid: 210206

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)