Evidence map›Paper›PMID 33232686›Full record

ArticleJournal of neuroscience methods2021

Real-Time Point Process Filter for Multidimensional Decoding Problems Using Mixture Models.

Mohammad Reza Rezaei, Kensuke Arai, Loren M Frank, Uri T Eden, Ali Yousefi

Open access · greenAbstract read
In one paragraph

Article in Journal of neuroscience methods, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
1.2field-weighted citation impact, top 21% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed, 13 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors at 4 institutions in 2 countries.

Mohammad Reza RezaeiDepartment of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran.
Kensuke AraiDepartment of Mathematics and Statistics, Boston University, Boston, MA, 02215, United States.
Loren M FrankDepartment of Physiology, University of California, San Francisco, San Francisco, CA, 94158, United States.
Uri T EdenDepartment of Mathematics and Statistics, Boston University, Boston, MA, 02215, United States.
Ali YousefiDepartment of Computer Science, Worcester Polytechnic Institute, Worcester, MA, 01609, United States. Electronic address: ayousefi@wpi.edu.
Boston University · USIsfahan University of Technology · IRUniversity of California, San Francisco · USWorcester Polytechnic Institute · US

Funding

Real-time analysis of memories and decisionsR01MH105174 · NIMH · UNIVERSITY OF CALIFORNIA, SAN FRANCISCO · PI EDEN, URI TZVI, FRANK, LOREN M · 2014 to 2018
$2.7M
NIMH NIH HHS R01 MH105174
6 · The paper itself

Abstract

There is an increasing demand for a computationally efficient and accurate point process filter solution for real-time decoding of population spiking activity in multidimensional spaces. Real-time tools for neural data analysis, specifically real-time neural decoding solutions open doors for developing experiments in a closed-loop setting and more versatile brain-machine interfaces. Over the past decade, the point process filter has been successfully applied in the decoding of behavioral and biological signals using spiking activity of an ensemble of cells; however, the filter solution is computationally expensive in multi-dimensional filtering problems. Here, we propose an approximate filter solution for a general point-process filter problem when the conditional intensity of a cell's spiking activity is characterized using a Mixture of Gaussians. We propose the filter solution for a broader class of point process observation called marked point-process, which encompasses both clustered - mainly, called sorted - and clusterless - generally called unsorted or raw- spiking activity. We assume that the posterior distribution on each filtering time-step can be approximated using a Gaussian Mixture Model and propose a computationally efficient algorithm to estimate the optimal number of mixture components and their corresponding weights, mean, and covariance estimates. This algorithm provides a real-time solution for multi-dimensional point-process filter problem and attains accuracy comparable to the exact solution. Our solution takes advantage of mixture dropping and merging algorithms, which collectively control the growth of mixture components on each filtering time-step. We apply this methodology in decoding a rat's position in both 1-D and 2-D spaces using clusterless spiking data of an ensemble of rat hippocampus place cells. The approximate solution in 1-D and 2-D decoding is more than 20 and 4,000 times faster than the exact solution, while their accuracy in decoding a rat position only drops by less than 9% and 4% in RMSE and 95% highest probability coverage area (HPD) performance metrics. Though the marked-point filter solution is better suited for real-time decoding problems, we discuss how the filter solution can be applied to sorted spike data to better reflect the proposed methodology versatility.

Indexed as

Brain-Computer InterfacesModels, NeurologicalAction PotentialsAlgorithmsAnimalsNeuronsRatsGaussian mixture modelMarked point-process filterMixture dropping algorithmMixture merging algorithmMixture modelPoint-process filterReal-time filterState-space modeling

Identifiers

PMID33232686
PMCPMC8828672
OpenAlexW3109675292

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.