101. Searching for a Binary Factorial Code Using the ICA Framework
- Author
-
Davide Mattera, Alessandra Budillon, Francesco Palmieri, Michele Calabrese, Palmieri, Francesco, Budillon, A., Calabrese, M., Mattera, D., F., Palmieri, A., Budillon, M., Calabrese, and Mattera, Davide
- Subjects
business.industry ,Cognitive Neuroscience ,Binary number ,Real image ,Machine learning ,computer.software_genre ,Independent component analysis ,Computer Science Applications ,Image (mathematics) ,Set (abstract data type) ,Generative model ,Transformation (function) ,independent component analysi ,Artificial Intelligence ,factorial codes ,Artificial intelligence ,generative model ,Factorial code ,business ,Algorithm ,computer ,Mathematics - Abstract
A binary factorial code is a transformation that maps the input space into a binary string with independent bits. We apply independent component analysis, formulated as a density search, to the pursuit of such a code by considering a set of desired output bi-modal density functions. The idea is tested on a real image with the coder used also in a reversed order as a generative model. The results are also compared to a principal component analyzer. Fantasy blocks of the image transforms provide interesting clues on the nature of the learned representations.
- Published
- 1998