Abstract
Most natural odors have sparse molecular composition. This makes the principles of compressed sensing potentially relevant to the structure of the olfactory code. Yet, the largely feedforward organization of the olfactory system precludes reconstruction using standard compressed sensing algorithms. To resolve this problem, recent theoretical work has shown that signal reconstruction could take place as a result of a low dimensional dynamical system converging to one of its attractor states. However, the dynamical aspects of optimization slowed down odor recognition and were also found to be susceptible to noise. Here we describe a feedforward model of the olfactory system that achieves both strong compression and fast reconstruction that is also robust to noise. A key feature of the proposed model is a specific relationship between how odors are represented at the glomeruli stage, which corresponds to a compression, and the connections from glomeruli to third-order neurons (neurons in the olfactory cortex of vertebrates or Kenyon cells in the mushroom body of insects), which in the model corresponds to reconstruction. We show that should this specific relationship hold true, the reconstruction will be both fast and robust to noise, and in particular to the false activation of glomeruli. The predicted connectivity rate from glomeruli to third-order neurons can be tested experimentally.
Highlights
It is still debated how many different odorants humans can perceive, the most commonly cited number is on the order of 104 [1,2,3], much greater than the 500 olfactory receptor neuron (ORNs) types
This compression raises the possibility that the mathematical properties of compressed sensing might be relevant to olfaction, similar to how these properties were found relevant to other sensory systems
Previous applications of compressed sensing algorithms relied on the dynamics of neural circuits to reconstruct high dimensional signals
Summary
Many olfactory systems are capable of accurately sensing a minimum of thousands of different odorants using as few as hundreds of different receptors. Previous applications of compressed sensing algorithms relied on the dynamics of neural circuits to reconstruct high dimensional signals. Such approaches are relatively temporally inefficient and sensitive to noise. To overcome these problems, we propose a purely feedforward compressed sensing model of the olfactory system where high dimensional signals can be recovered with a single feedforward layer of neural processing. Our results indicate that feedforward neural architectures can provide an efficient way to implement compressed sensing in neural systems
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
