Nacionalni portal odprte znanosti

This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of image domain transformations such that the matrix of transformed images can be decomposed as the sum of a sparse matrix of ...

We consider the problem of recovering a complete (i.e., square and invertible) dictionary mbA0, from mbY=mbA0mbX0 with mbY∈Rn×p. This recovery setting is central to the theoretical understanding of dictionary learning. We give the first efficient algorithm that provably recovers mbA0 when mbX0 has O ...