Compact Part-Based Image Representations: Extremal Competition and Overgeneralization
Abstract
Learning compact, interpretable image representations is a very natural task which has not been solved satisfactorily even for simple classes of binary images. In this paper, we review various ways of composing parts (or experts) for binary data and argue that competitive forms of interaction are best suited to learn low-dimensional representations. We propose a new composition rule which discourages parts from focusing on similar structures and which penalizes opposing votes strongly so that abstaining from voting becomes more attractive. We also introduce a novel sequential initialization procedure based on a process of oversimplification and correction. Experiments show that with our approach very intuitive models can be learned.
Cite
Text
Goessling and Amit. "Compact Part-Based Image Representations: Extremal Competition and Overgeneralization." International Conference on Learning Representations, 2015.Markdown
[Goessling and Amit. "Compact Part-Based Image Representations: Extremal Competition and Overgeneralization." International Conference on Learning Representations, 2015.](https://mlanthology.org/iclr/2015/goessling2015iclr-compact/)BibTeX
@inproceedings{goessling2015iclr-compact,
title = {{Compact Part-Based Image Representations: Extremal Competition and Overgeneralization}},
author = {Goessling, Marc and Amit, Yali},
booktitle = {International Conference on Learning Representations},
year = {2015},
url = {https://mlanthology.org/iclr/2015/goessling2015iclr-compact/}
}