15 citations · 26 across the 13 of their papers we have counts for
3 papers · 1 filter
A Non-Convex Relaxation for Fixed-Rank Approximation
Carl Olsson, Marcus Carlsson, Erik Bylow
This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted i…
Rotation Averaging and Strong Duality
Anders Eriksson, Carl Olsson, Fredrik Kahl +1
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its convent…
Non-Convex Rank/Sparsity Regularization and Local Minima
Carl Olsson, Marcus Carlsson, Fredrik Andersson +1
This paper considers the problem of recovering either a low rank matrix or a sparse vector from observations of linear combinations of the vector or matrix elements. Recent methods…