Part-based approximations for morphological operators using asymmetric auto-encoders
From MaRDI portal
Publication:2189384
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.
Recommendations
- Approximating morphological operators with part-based representations learned by asymmetric auto-encoders
- Sparse mathematical morphology using non-negative matrix factorization
- Generative model of autoencoders self-learning on images represented by count samples
- Nonredundant sparse feature extraction using autoencoders with receptive fields clustering
- A learning framework for morphological operators using counter-harmonic mean
Cited in
(3)
This page was built for publication: Part-based approximations for morphological operators using asymmetric auto-encoders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189384)
