Evidence map›Paper›PMID 37896669›Full record

ArticleSensors (Basel, Switzerland)2023

Lossless Data Compression for Time-Series Sensor Data Based on Dynamic Bit Packing.

Sang-Ho Hwang, Kyung-Min Kim, Sungho Kim, Jong Wook Kwak

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
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

4 authors.

Sang-Ho HwangGyeongbuk Institute of IT Convergence Industry Technology, Gyeongsan 38463, Republic of Korea.
Kyung-Min KimDepartment of Computer Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.ORCID 0000-0002-0791-1267
Sungho KimGyeongbuk Institute of IT Convergence Industry Technology, Gyeongsan 38463, Republic of Korea.
Jong Wook KwakDepartment of Computer Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.ORCID 0000-0002-6639-3738

Funding

National Research Foundation No. 2020R1F1A1065788
6 · The paper itself

Abstract

In this paper, we propose a bit depth compression (BDC) technique, which performs bit packing by dynamically determining the pack size based on the pattern of the bit depth level of the sensor data, thereby maximally reducing the space wastage that may occur during the bit packing process. The proposed technique can dynamically perform bit packing according to the data's characteristics, which may have many outliers or several multidimensional variations, and therefore has a high compression ratio. Furthermore, the proposed method is a lossless compression technique, which is especially useful as training data in the field of artificial intelligence or in the predictive analysis of data science. The proposed method effectively addresses the spatial inefficiency caused by unpredictable outliers during time-series data compression. Additionally, it offers high compression efficiency, allowing for storage space savings and optimizing network bandwidth utilization while transmitting large volumes of data. In the experiment, the BDC method demonstrated an improvement in the compression ratio of up to 247%, with 30% on average, compared with other compression algorithms. In terms of energy consumption, the proposed BDC also improves data transmission using Bluetooth up to 34%, with 18% on average, compared with other compression algorithms.

Indexed as

bit depth levelbit packinglossless compressionsensor datatime series data

Identifiers

PMID37896669
PMCPMC10610793

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.