Enhanced image approximation using shifted rank-1 reconstruction

10/03/2018
by   Florian Boßmann, et al.
0

Low rank approximation has been extensively studied in the past. It is most suitable to reproduce rectangular like structures in the data. In this work we introduce a generalization using shifted rank-1 matrices to approximate A∈C^M× N. These matrices are of the form S_λ(uv^*) where u∈C^M, v∈C^N and λ∈Z^N.The operator S_λ circularly shifts the k-th column of uv^* by λ_k. These kind of shifts naturally appear in applications, where an object u is observed in N measurements at different positions indicated by the shift λ. The vector v gives the observation intensity. Exemplary, a seismic wave can be recorded at N sensors with different time of arrival λ; Or a car moves through a video changing its position in every frame. We present theoretical results as well as an efficient algorithm to calculate a shifted rank-1 approximation in O(NM M). The benefit of the proposed method is demonstrated in numerical experiments. A comparison to other sparse approximation methods is given. Finally, we illustrate the utility of the extracted parameters for direct information extraction in several applications including video processing or non-destructive testing.

READ FULL TEXT

page 6

page 8

page 9

page 10

research
09/17/2022

Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation

Learning sketching matrices for fast and accurate low-rank approximation...
research
02/16/2020

A gradient system approach for Hankel structured low-rank approximation

Rank deficient Hankel matrices are at the core of several applications. ...
research
01/23/2020

A geometry based algorithm for dynamical low-rank approximation

In this paper, we propose a geometry based algorithm for dynamical low-r...
research
06/12/2020

Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices

In this paper we extend the Residual Arnoldi method for calculating an e...
research
12/15/2022

Learning Sparsity and Randomness for Data-driven Low Rank Approximation

Learning-based low rank approximation algorithms can significantly impro...

Please sign up or login with your details

Forgot password? Click here to reset