Loading…
Toward Optimal Target Placement for Neural Prosthetic Devices
1 Departments of Electrical Engineering, 2 Computer Science, and 3 Neurosurgery, and 4 Neurosciences Program, Stanford University, Stanford, California; and 5 Gatsby Computational Neuroscience Unit University College London, London, United Kingdom Submitted 30 July 2008; accepted in final form 19 Se...
Saved in:
Published in: | Journal of neurophysiology 2008-12, Vol.100 (6), p.3445-3457 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 1 Departments of Electrical Engineering, 2 Computer Science, and 3 Neurosurgery, and 4 Neurosciences Program, Stanford University, Stanford, California; and 5 Gatsby Computational Neuroscience Unit University College London, London, United Kingdom
Submitted 30 July 2008;
accepted in final form 19 September 2008
Neural prosthetic systems have been designed to estimate continuous reach trajectories (motor prostheses) and to predict discrete reach targets (communication prostheses). In the latter case, reach targets are typically decoded from neural spiking activity during an instructed delay period before the reach begins. Such systems use targets placed in radially symmetric geometries independent of the tuning properties of the neurons available. Here we seek to automate the target placement process and increase decode accuracy in communication prostheses by selecting target locations based on the neural population at hand. Motor prostheses that incorporate intended target information could also benefit from this consideration. We present an optimal target placement algorithm that approximately maximizes decode accuracy with respect to target locations. In simulated neural spiking data fit from two monkeys, the optimal target placement algorithm yielded statistically significant improvements up to 8 and 9% for two and sixteen targets, respectively. For four and eight targets, gains were more modest, as the target layouts found by the algorithm closely resembled the canonical layouts. We trained a monkey in this paradigm and tested the algorithm with experimental neural data to confirm some of the results found in simulation. In all, the algorithm can serve not only to create new target layouts that outperform canonical layouts, but it can also confirm or help select among multiple canonical layouts. The optimal target placement algorithm developed here is the first algorithm of its kind, and it should both improve decode accuracy and help automate target placement for neural prostheses.
Address for reprint requests and other correspondence: K. Shenoy, CISX 319, 330 Serra Mall, Stanford University, Stanford, CA 94305-4075 (E-mail: shenoy{at}stanford.edu ) |
---|---|
ISSN: | 0022-3077 1522-1598 |
DOI: | 10.1152/jn.90833.2008 |