GPU facilitated unsupervised visual feature acquisition
© Lemoine and Maida; licensee BioMed Central Ltd. 2012
Published: 16 July 2012
This paper examines the effects of parallelizing an unsupervised feature acquisition algorithm using General-Purpose computing on Graphics Processing Units (GPGPU). Previous work in feature learning has established the effectiveness of hierarchical learning methods that refine large quantities of elementary features into small numbers of intermediate-level features. Some of the most effective of these methods alternate between template matching layers that combine features and sub-sampling layers that perform feature scale and/or position invariance. This approach is inspired by the mammalian ventral visual pathway. One such approach that produces highly informative features is a spiking convolutional network trained with STDP-based learning . When using a serial implementation, however, this approach is costly in time and consequently is difficult to scale to a large library of internally complex features. The present paper demonstrates that GPGPU parallelism can be leveraged to overcome the scaling limitations of the serial version. Highly informative features can then be generated in large quantities. By scaling the number of features learned the maximum complexity of learnable classes is significantly increased.
- Masquelier T, Thorpe S: Unsupervised learning of visual features through spike timing dependent plasticity. PLoS Computational Biology. 2007, 3:Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.