Efficient Coding of Time-Relative Structure Using Spikes

DOI10.1162/0899766052530839zbMath1092.94520OpenAlexW2120077739WikidataQ51983588 ScholiaQ51983588MaRDI QIDQ5696480

Miachael S. Lewicki, Evan Smith

Publication date: 18 October 2005

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/0899766052530839

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Convolutional codes (94B10)

Related Items (4)

Encoding and Decoding Spikes for Dynamic Stimuli ⋮ Noise-Robust Speech Recognition Through Auditory Feature Detection and Spike Sequence Decoding ⋮ Faithful Representation of Stimuli with a Population of Integrate-and-Fire Neurons ⋮ Sparse approximations for quaternionic signals

Uses Software

• Auditory Toolbox

Cites Work

• A Mathematical Theory of Communication
• Atomic Decomposition by Basis Pursuit
• Matching pursuits with time-frequency dictionaries

This page was built for publication: Efficient Coding of Time-Relative Structure Using Spikes