Part-based approximations for morphological operators using asymmetric auto-encoders
arXiv:1904.00763
Abstract
This paper addresses the issue of building a part-based representation of a dataset of images. More precisely, we look for a non-negative, sparse decomposition of the images on a reduced set of atoms, in order to unveil a morphological and interpretable structure of the data. Additionally, we want this decomposition to be computed online for any new sample that is not part of the initial dataset. Therefore, our solution relies on a sparse, non-negative auto-encoder where the encoder is deep (for accuracy) and the decoder shallow (for interpretability). This method compares favorably to the state-of-the-art online methods on two datasets (MNIST and Fashion MNIST), according to classical metrics and to a new one we introduce, based on the invariance of the representation to morphological dilation.
References in corpus (5)
- Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
- InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets
- Deep Learning of Part-based Representation of Data Using Sparse Autoencoders with Nonnegativity Constraints
- Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of Data
- Non-negative matrix factorization with sparseness constraints