Learning Low Rank and Sparse Models via Robust Autoencoders
Lists
Only you see this
Abstract
Robust principal component analysis (RPCA), decomposes a data matrix into a superposition of a low-rank matrix and a sparse matrix under certain incoherent conditions. In this paper, we propose a nonlinear generalization of RPCA that uses two autoencoder networks to achieve such a decomposition, in which one autoencoder accounts for the low-rank component and the other for the sparse component. To this end, we provide a principled way of constructing these autoencoders for low-rank and sparse components. The generality of the proposed model is demonstrated by applying it onto three applications, namely 1) music/voice separation 2) image denoising and 3) video foreground separation. Experimental results indicate the effectiveness of the proposed model on these application domains.
BibTeX
@inproceedings{pu2019learning,
author = {Jie Pu and Yannis Panagakis and Maja Pantic},
title = {{Learning Low Rank and Sparse Models via Robust Autoencoders}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2019},
url = {https://openreview.net/forum?id=kf3GF1WM1hH},
}Loading related content...