ArticleSensors (Basel, Switzerland)2026
A High-Throughput Memory Compression Architecture for Real-Time 3D Visual Tracking and Quantification on Edge Devices.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
8 authors.
Funding
Abstract
The deployment of real-time three-dimensional (3D) visual perception, continuous spatial sensing, and graphics-intensive multimedia applications on embedded edge devices introduces substantial runtime memory pressure. During execution, these workloads continuously generate small-granularity memory pages, including image buffers, depth maps, rendering caches, intermediate feature tensors, and media buffers. To reduce memory footprint while preserving low processing overhead, this paper proposes a sequence-aware cascaded compression framework for runtime memory pages generated by visual and multimedia workloads. Instead of following the traditional restore-then-recompress path, the proposed framework directly reuses the intermediate sequence representation produced by LZ4. It parses LZ4 sequences into literal and structured stream sequences and applies stream-specific entropy coding using Huffman and Finite State Entropy (FSE) coding. By avoiding full-page restoration and repeated redundancy analysis, the framework preserves lossless reconstruction semantics while reducing compression overhead. Experimental results on real-world runtime memory pages show that the proposed framework reduces compression processing time by 42.10% on average and by up to 52.22%. It also reduces Central Processing Unit (CPU) time by 20.28% on average and peak memory usage by 29.92% on average. Additional validation on a RISC-V edge platform shows that the compression processing time is reduced by up to 64.36%. A 16 MB point-cloud memory sample derived from 3D scan data further shows a 33.16% reduction in compression time. Functional tests on more than 200K mixed-entropy memory pages demonstrate 100% lossless reconstruction and successful detection of corrupted compressed streams.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.