Evidence map›Paper›PMID 42222372›Full record

ArticleFrontiers in neuroscience2026

Energy-efficient traffic sign recognition using directly trained spiking neural networks and population decoding.

Jonas V Schulte, Steven Peters

Abstract read
In one paragraph

Article in Frontiers in neuroscience, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

2 authors.

Jonas V SchulteInstitute of Automotive Engineering, Technical University (TU) of Darmstadt, Darmstadt, Germany.
Steven PetersInstitute of Automotive Engineering, Technical University (TU) of Darmstadt, Darmstadt, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Recognizing traffic signs is a fundamental perception task for automated driving systems and requires high accuracy under strict latency and energy constraints. Convolutional neural networks (CNNs) achieve strong performance but can be computationally demanding for embedded platforms. Spiking convolutional neural networks (SCNNs) offer an event-driven alternative that can reduce computation through sparse activity, yet their accuracy often degrades under very low-latency settings with few time steps. To improve spike-based inference under strict runtime constraints, we integrate a neural population decoding layer at the output stage and evaluate directly trained SCNNs with and without population decoding against a CNN baseline on the German Traffic Sign Recognition Benchmark (GTSRB). The best SCNN without population decoding achieved 98.85% test accuracy at 30 time steps, exceeding the CNN baseline of 98.38%. Population decoding improved performance in the low-latency regime, reaching 98.31% accuracy at a single time step, corresponding to an improvement of 0.56% over the SCNN without population decoding at the same temporal setting. Using an operation-based energy estimation, the SCNNs achieved over 14 times higher energy efficiency than the CNN at one time step. Overall, the results demonstrate that directly trained SCNNs can surpass a comparable CNN while enabling flexible trade-offs between accuracy, inference time, and energy efficiency. In particular, population decoding proves beneficial when operating under strict latency constraints.

Indexed as

automated drivingenergy-efficient perceptionneuromorphic computingpopulation decodingspiking neural networkstraffic sign recognition

Identifiers

PMID42222372
PMCPMC13219004

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.