Abstract
In tracking of time-varying low-rank models of time-varying matrices, we present a method robust to both uniformlydistributed measurement noise and arbitrarily-distributed "sparse"noise. In theory, we bound the tracking error. In practice, our use of randomised coordinate descent is scalable and allows for encouraging results on changedetection.net, a benchmark.
Cite
CITATION STYLE
Akhriev, A., Marecek, J., & Simonetto, A. (2020). Pursuit of low-rank models of time-varying matrices robust to sparse and measurement noise. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 3171–3178). AAAI press. https://doi.org/10.1609/aaai.v34i04.5714
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.