Clusterless Decoding of Position from Multiunit Activity Using a Marked Point Process Filter
From MaRDI portal
Publication:5380286
DOI10.1162/NECO_a_00744zbMath1414.92087OpenAlexW1930031410WikidataQ36722855 ScholiaQ36722855MaRDI QIDQ5380286
Loren M. Frank, Daniel F. Liu, Xinyi Deng, K. G. Kay, Uri T. Eden
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00744
Related Items (3)
A common goodness-of-fit framework for neural population models using marked point process time-rescaling ⋮ Efficient Position Decoding Methods Based on Fluorescence Calcium Imaging in the Mouse Hippocampus ⋮ Assessing Goodness-of-Fit in Marked-Point Process Models of Neural Population Coding via Time and Rate Rescaling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bayesian decoding of neural spike trains
- Functional data analysis.
- Sequential Monte Carlo Methods in Practice
- Automatic Spike Sorting Using Tuning Information
- Decoding Movement Trajectories Through a T-Maze Using Point Process Filters Applied to Place Field Data from Rat Hippocampal Region CA1
- A review of methods for spike sorting: the detection and classification of neural action potentials
- An Introduction to the Theory of Point Processes
- Estimating a State-Space Model from Point Process Observations
- Dynamic Analysis of Neural Encoding by Point Process Adaptive Filtering
- Spike Train Decoding Without Spike Sorting
This page was built for publication: Clusterless Decoding of Position from Multiunit Activity Using a Marked Point Process Filter