MétaCan
Menu
Back to cohort
Record W2539271180 · doi:10.21767/2171-6625.100019

An Adaptive Recovery Method in Compressed Sensing of Extracellular Neural Recording

2015· article· en· W2539271180 on OpenAlex
Hicham Semmaoui, Saied HK, Martinez Trujillo JC

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Neurology and Neuroscience · 2015
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Reservoir Computing
Canadian institutionsPolytechnique Montréal
FundersConcordia University
KeywordsComputer scienceCompressed sensingSpike (software development)Artificial intelligencePattern recognition (psychology)WaveletSIGNAL (programming language)Data compressionSpeech recognition

Abstract

fetched live from OpenAlex

A novel adaptive recovery method in the emerging compressed sensing theory is described and applied to extracellular neural recordings in order to reduce data rate in wireless neural recording systems. To strike a balance between high compression ratio and high spike reconstruction quality, a novel method that employs a group-sparsity recovery algorithm, prior information about the input neural signal, learning prior supports of spikes, and a matched wavelet technique is introduced. Our simulation results, using four different sets of real extracellular recordings from four distinct neural sources, show that our proposed method is effective, viable, and outperforms the state-of-the-art compressed sensing-based methods, in particular, when the number of the measurement is two times of the sparsity.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.363
Threshold uncertainty score0.415

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.055
GPT teacher head0.300
Teacher spread0.245 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it