On the Optimal Calculation of the Rice Coding Parameter
Open accessAbstract
In this article, we design and evaluate several algorithms for the computation of the optimal Rice coding parameter. We conjecture that the optimal Rice coding parameter can be bounded and verify this conjecture through numerical experiments using real data. We also describe algorithms that partition the input sequence of data into sub-sequences, such that if each sub-sequence is coded with a different Rice parameter, the overall code length is minimised. An algorithm for finding the optimal partitioning solution for Rice codes is proposed, as well as fast heuristics, based on the understanding of the problem trade-offs.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Rice coding is a suitable entropy encoder for the residuals.
“The likelihoods of both distributions are similar; thus, we consider the rice coding [24] a suitable entropy encoder for the residuals.”
From Aerosense: A Self-Sustainable and Long-Range Bluetooth Wireless Sensor Node for Aerodynamic and Aeroacoustic Monitoring on Wind Turbines (2023) · cites this paper as [24]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 30
- Robinson, T. SHORTEN: Simple Lossless and Near-Lossless Waveform Compression; Technical Report; Cambridge University Engineering Department: Cambrdige, UK, December 1994.
- Howard, P.G.; Vitter, J.S. Fast and efficient lossless image compression. In Proceedings of the DCC '93: Data Compression Conference, Snowbird, UT, USA, 30 March-2 April 1993; pp. 351-360.
- Memon, N. Adaptive coding of DCT coefficients by Golomb-Rice codes. In Proceedings of the 1998 International Conference on Image Processing, Chicago, IL, USA, 7 October 1998; Volume 1, pp. 516-520.
- Malvar, H. Fast progressive wavelet coding. In Proceedings of the DCC'99 Data Compression Conference, Snowbird, UT, USA, 29-31 March 1999; pp. 336-343.
- Malvar, H.S. Adaptive run-length/Golomb-Rice encoding of quantized generalized Gaussian sources with unknown statistics. In Proceedings of the Data Compression Conference (DCC'06), Snowbird, UT, USA, 28-30 March 2006; pp. 23-32.
- Weinberger, M.J.; Seroussi, G.; Sapiro, G. The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS. IEEE Trans. Image Process. 2000, 9, 1309-1324. [CrossRef] [PubMed] · DOI
- Kim, H.; Lee, J.; Kim, H.; Kang, S.; Park, W.C. A Lossless Color Image Compression Architecture Using a Parallel Golomb-Rice Hardware CODEC. IEEE Trans. Circ. Syst. Video Technol. 2011, 21, 1581-1587.
- Wen, J.; Villasenor, J.D. A class of reversible variable length codes for robust image and video coding. In Proceedings of the International Conference on Image Processing, Santa Barbara, CA, USA, 26-29 October 1997; Volume 2, pp. 65-68.
- Nguyen, T.; Marpe, D.; Schwarz, H.; Wiegand, T. Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression. In Proceedings of the 18th IEEE International Conference on Image Processing, Brussels, Belgium, 11-14 September 2011; pp. 753-756.
- Chen, J.; Ma, J.; Zhang, Y.; Shi, X. ECG compression based on wavelet transform and Golomb coding. Electron. Lett. 2006, 42, 322-324. [CrossRef] · DOI
- Merhav, N.; Seroussi, G.; Weinberger, M.J. Optimal prefix codes for sources with two-sided geometric distributions. IEEE Trans. Inform. Theor. 2000, 46, 121-135. [CrossRef] · DOI
- O'Neal, J.B., Jr. Predictive Quantizing Systems (Differential Pulse Code Modulation) for the Transmission of Television Signals. Bell Syst. Tech. J. 1966, 45, 689-721,
- Augustin, A.; Yi, J.; Clausen, T.; Townsley, W.M. A Study of LoRa: Long Range Low Power Networks for the Internet of Things. Sensors 2016, 16, 1466. [CrossRef] · DOI
- Casals, L.; Mir, B.; Vidal, R.; Gomez, C. Modeling the Energy Performance of LoRaWAN. Sensors 2017, 17, 2364. [CrossRef] · DOI
- Bouguera, T.; Diouris, J.F.; Chaillout, J.J.; Jaouadi, R.; Andrieux, G. Energy Consumption Model for Sensor Nodes Based on LoRa and LoRaWAN. Sensors 2018, 18, 2104. [CrossRef] · DOI
- Ikpehai, A.; Adebisi, B.; Rabie, K.M.; Anoh, K.; Ande, R.E.; Hammoudeh, M.; Gacanin, H.; Mbanaso, U.M. Low-Power Wide Area Network Technologies for Internet-of-Things: A Comparative Review. IEEE Internet Things J. 2019, 6, 2225-2240. [CrossRef] · DOI
- Qutqut, M.H.; Al-Sakran, A.; Almasalha, F.; Hassanein, H.S. Comprehensive survey of the IoT open-source OSs. IET Wirel. Sens. Syst. 2018, 8, 323-339. [CrossRef] · DOI
- Musaddiq, A.; Zikria, Y.B.; Hahm, O.; Yu, H.; Bashir, A.K.; Kim, S.W. A Survey on Resource Management in IoT Operating Systems. IEEE Access 2018, 6, 8459-8482. [CrossRef] · DOI
- Javed, F.; Afzal, M.K.; Sharif, M.; Kim, B. Internet of Things (IoT) Operating Systems Support, Networking Technologies, Applications, and Challenges: A Comparative Review. IEEE Commun. Surv. Tutor. 2018, 20, 2062-2100. [CrossRef] · DOI
- Liu, J.; Chen, F.; Yan, J.; Wang, D. CBN-VAE: A Data Compression Model with Efficient Convolutional Structure for Wireless Sensor Networks. Sensors 2019, 19, 3445. [CrossRef] [PubMed] · DOI
- Danieletto, M.; Bui, N.; Zorzi, M. RAZOR: A Compression and Classification Solution for the Internet of Things. Sensors 2014, 14, 68-94. [CrossRef] [PubMed] · DOI
- Liu, J.; Chen, F.; Wang, D. Data Compression Based on Stacked RBM-AE Model for Wireless Sensor Networks. Sensors 2018, 18, 4273. [CrossRef] [PubMed] · DOI
- Yin, Y.; Liu, F.; Zhou, X.; Li, Q. An Efficient Data Compression Model Based on Spatial Clustering and Principal Component Analysis in Wireless Sensor Networks. Sensors 2015, 15, 19443-19465. [CrossRef] [PubMed] · DOI
- Jiang, P.; Li, S. A Sensor Network Data Compression Algorithm Based on Suboptimal Clustering and Virtual Landmark Routing Within Clusters. Sensors 2010, 10, 9084-9101. [CrossRef] · DOI
- Lee, J.H.; Jung, I.B. Adaptive-Compression Based Congestion Control Technique for Wireless Sensor Networks. Sensors 2010, 10, 2919-2945. [CrossRef] · DOI
- Ying, B.; Liu, Y.; Yang, H.; Wang, H. Evaluation of Tunable Data Compression in Energy-Aware Wireless Sensor Networks. Sensors 2010, 10, 3195-3217. [CrossRef] · DOI
- Salomon, D.; Motta, G. Handbook of Data Compression, 5th ed.; Springer: New York, NY, USA, 2010.
- Golomb, S. Run-Lenght Encodings. IEEE Trans. Inf. Theory 1966, 12, 399-401. [CrossRef] · DOI
- Kiely, A. Selecting the Golomb parameter in Rice codings. Interplanet. Netw. Prog. Rep. 2004, 42, 159.
- Blalock, D.; Madden, S.; Guttag, J. Sprintz: Time Series Compression for the Internet of Things. ACM Interact. Mob. Wearable Ubiquitous Technol. 2018, 2, 1-23. [CrossRef · DOI
Cited by
Sorted by citations
Polonelli, T., Muller, H., Kong, W., Fischer, R., Benini, L., & Magno, M. (2023) · IEEE Sensors Journal · doi:10.1109/jsen.2022.3224307 · Cited by 35 · see citing works
- Authors
- Solano Donado, F.
- Affiliations
- Faculty of Electronics and Information Technology, Warsaw University of Technology, 00-665 Warsaw, Poland
- Venue
- Algorithms
- Publisher
- MDPI AG
- Published
- 2020-07-27
- Volume
- 13
- Issue
- 8
- Pages
- 181
- ISSN
- 1999-4893 (ISSN-L)
- OpenAlex
- W3044277759
- Cited by
- 4
- References
- 0
- Citations by year
- 2022: 3 · 2021: 1
- FWCI
- 0.39
- Type
- journal article
- Language
- en
- Open access
- gold
- dx.doi.org
- Licence
- Locations
- Algorithms (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- Horizon 2020 Framework Programme (787128, 653626)
- FP7 Information and Communication Technologies (269985)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Video Coding and Compression Technologies
- Keywords
- data partitioning, heuristic algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
