Sign inGet started
Paper · arXiv

Replay Pruning and Few-Bit Integer Inference for Hardware-Efficient Speed-Sign Recognition

Speed-limit sign recognition on an automotive camera system-on-chip (SoC) must fit a detector and a classifier (the reader) into the memory, arithmetic, and energy budgets of the device. In our two-stage recognizer, the detector, a YOLO-family network with ReLU and hard-sigmoid operators, is compressed by channel replay: an iterative pruning cascade identifies the channels to remove, the recorded deletions are replayed on the original task-trained network, the parent, and one continuous knowledge-distillation recovery follows. On a YOLOv5n, replay removes 60.3% of the parameters at the accuracy of the parent and, in validation mAP50-95 over five matched seeds, outperforms iterative prunin...

AuthorsSe Un Park, Kyungkeon Chung, Huigeol Kim et al.
Primary categorycs.CV
Published16 October 2026
Last updated at source16 October 2026
cs.CVcs.ARcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/7249bf4e-f24e-4828-9458-2bcff0bf8118" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 6 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 24 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.