title: Classification using sparse representations: a biologically plausible approach.
abstract: Representing signals as linear combinations of basis vectors sparsely selected from an overcomplete dictionary has proven to be advantageous for many applications in pattern recognition, machine learning, signal processing, and computer vision. While this approach was originally inspired by insights into cortical information processing, biologically plausible approaches have been limited to exploring the functionality of early sensory processing in the brain, while more practical applications have employed non-biologically plausible sparse coding algorithms. Here, a biologically plausible algorithm is proposed that can be applied to practical problems. This algorithm is evaluated using standard benchmark tasks in the domain of pattern classification, and its performance is compared to a wide range of alternative algorithms that are widely used in signal and image processing. The results show that for the classification tasks performed here, the proposed method is competitive with the best of the alternative algorithms that have been evaluated. This demonstrates that classification using sparse representations can be performed in a neurally plausible manner, and hence, that this mechanism of classification might be exploited by the brain.
authors.affiliation: Department of Informatics, King's College London, Strand, London, WC2R 2LS, UK, michael.spratling@kcl.ac.uk.
authors.forename: M W
authors.initials: MW
authors.lastname: Spratling
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D010363:Pattern Recognition, Automated