• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.94-103
• /
• 2022

As a large amount of data generated by sensors or devices at the manufacturing site is transmitted to the server or client, problems arise in network processing time delay and storage resource cost increase. To solve this problem, considering the manufacturing site, where real-time responsiveness and non-disruptive processes are essential, QRC (Quotient Remainder Compression) and BL_beta compression algorithms that enable real-time and lossless compression were applied to actual manufacturing site sensor data for the first time. As a result of the experiment, BL_beta had a higher compression rate than QRC. As a result of experimenting with the same data by slightly adjusting the data size of QRC, the compression rate of the QRC algorithm with the adjusted data size was 35.48% and 20.3% higher than the existing QRC and BL_beta compression algorithms.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.79-85
• /
• 2000

In the communication technology, there is necessary data compression to transfer data more quickly and bigger amount in the same condition. And that should bring down the cost consequently. This paper shows that how to apply compression software and hardware to attain the issue that mentioned previous in data communication technology as well as, trying to find the solution for the system delay problem and to improve efficiency demanded to them. To achieve these purposes, 1 will study and analyze the efficiency of compression system to realize realtime data compression transfer system using LZS compression algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.11
• /
• pp.87-95
• /
• 2004

This paper proposes a new test data compression/decompression method for SoC(Systems-on-a-Chip). The method is based on analyzing the factors that influence test parameters: compression ratio and hardware overhead. To improve compression ratio, the proposed method is based on Modified Statistical Coding (MSC) and Input Reduction (IR) scheme, as well as a novel mapping and reordering algorithm proposed in a preprocessing step. Unlike previous approaches using the CSR architecture, the proposed method is to compress original test data and decompress the compressed test data without the CSR architecture. Therefore, the proposed method leads to better compression ratio with lower hardware overhead than previous works. An experimental comparison on ISCAS '89 benchmark circuits validates the proposed method.

• Spatial Information Research
• /
• v.13 no.4 s.35
• /
• pp.355-364
• /
• 2005

Vector data sets (e.g. maps) are currently major sources of displaying, querying, and identifying locations of spatial features in a variety of applications. Especially in mobile environment, the needs for using spatial data is increasing, and the relative large size of vector maps need to be smaller. Recently, there have been several studies about vector map compression. There was clustering-based compression method with novel encoding/decoding scheme. However, precedent studies did not consider that spatial data have to be updated periodically. This paper explores the problem of existing clustering-based compression method. We propose an adaptive approximation method that is capable of handling data updates as well as reducing error levels. Experimental evaluation showed that when an updated event occurred the proposed adaptive approximation method showed enhanced positional accuracy compared with simple cluster based compression method.

• Journal of Biomedical Engineering Research
• /
• v.16 no.1
• /
• pp.17-24
• /
• 1995

This paper presents a new compression method (or ECG data using iterated contractive transformations. The method represents any range of ECG signal by piecewise self-afrine fractal Interpolation (PSAFI). The piecewise self-afrine rractal model is used where a discrete data set is viewed as being composed of contractive arfine transformation of pieces of itself. This algorithm was evaluated using MIT/BIH arrhythmia database. PSAFI is found to yield a relatively low reconstruction error for a given compression ratio than conventional direct compression methods. The compression ratio achieved was 883.9 bits per second (bps) - an average percent rms difference (AFRD) of 5.39 percent -with the original 12b ECG samples digitized at 400 Hz.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.6 no.1
• /
• pp.223-231
• /
• 2002

The pilot tests for the development of biaxial failure envelope of high strength concrete of reactor containments were performed. To apply biaxial loads to concrete, the plate specimens were used. The technical difficulties encountered on the development of a suitable biaxial test setup were discussed. To decide the optimum thickness of plate specimen, the nonlinear finite element analyses using ABAQUS were performed for a 1/8 model of cylindrical specimen(${\Phi}150{\times}300$) and four 1/4 models of plate Specimens ($200{\times}200{\times}T$(=30, 50, 60, 70)mm) under uniaxial compression. Analytical values and test data of relative strength ratio between those specimens with different geometric shapes were also compared. The various test data were obtained under uniaxial compression, uniaxial tension, and biaxial compression and then the stress-strain responses were plotted. The test data indicated that the strength of concrete under biaxial compression, $f_1/f_2=-1/-1$, is 15 percent larger than that under uniaxial compression and the poisson's ratio of concrete is 0.16. Teflon pads employed to eliminate friction between test specimen and loading platens showed an excellent effect under biaxial compression.

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.271-278
• /
• 1995

An ECG data compression algorithM using max-min slope update is proposed and a real time 3 channel ECG transmission system is implemented using the proposed algorithm. In order to effectively compress ECG data, we compare a threshold value with the max-min slope difference (MMSD) which is updated at each sample values. If this MMSD value is smaller than the threshold value, then the data is compressed. Conversely, when the MMSD value is larger than threshold value, the data is transmitted after storing the value and the length between the data which is beyond previous threshold level. As a result, it can accurately compress both the region of QRS, P, and T wave that has fast-changing and the region of the base line that slope is changing slow. Therefore, it Is possible to enhance the compression rate and the percent roms difference. In addition, because of the simplicity, this algorithm is more suitable for real-time implementation.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.441-451
• /
• 2005

HTML is mostly stored in native file systems instead of specialized repositories such as a database. Like HTML, XML, the standard for the exchange and the representation of data in the Internet, is mostly resident on native file systems. However. since XML data is irregular and verbose, the disk space and the network bandwidth are wasted compared to those of regularly structured data. To overcome this inefficiency of XML data, the research on the compression of XML data has been conducted. Among recently proposed XML compression techniques, some techniques do not support querying compressed data, while other techniques which support querying compressed data blindly encode data values using predefined encoding methods without considering the types of data values which necessitates partial decompression for processing range queries. As a result, the query performance on compressed XML data is degraded. Thus, this research proposes an XML compression technique which supports direct and efficient evaluations of queries on compressed XML data. This XML compression technique adopts an encoding method, called dictionary encoding, to encode each tag of XML data and applies proper encoding methods for encoding data values according to the inferred types of data values. Also, through the implementation and the performance evaluation of the XML compression technique proposed in this research, it is shown that the implemented XML compressor efficiently compresses real-life XML data lets and achieves significant improvements on query performance for compressed XML data.

• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.37-45
• /
• 2013

In recent years, the demands of multimedia data in wireless sensor networks have been significantly increased for the high-quality environment monitoring applications that utilize sensor nodes. However, since the amount of multimedia data is very large, the network lifetime is significantly reduced due to excessive energy consumption on particular nodes. To overcome this problem, in this paper, we propose a high efficiency data compression scheme in wireless multimedia sensor networks. The proposed scheme reduces the packet size by a multiple compression technique that consists of primary compression that deletes the lower priority bits considering characteristics of multimedia data and secondary compression based on Chinese Remainder Theorem. To show the superiority of our scheme, we compare it with the existing compression scheme. Our experimental results show that our proposed scheme reduces the amount of transmitted data by about 55% and increases network lifetime by about 16% over the existing scheme on average.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.81-88
• /
• 2017

Solar-powered wireless sensor nodes can use extra energy to obtain additional data to increase the precision. However, if the amount of data sensed is increased indiscriminately, the overhead of relay nodes may increase, and their energy may be exhausted. In this paper, we introduce a sensing and compression rate selection scheme to increase the amount of data obtained while preventing energy exhaustion. In this scheme, the neighbor nodes of the sink node determine the limit of data to be transmitted according to the allocated energy and their descendant nodes, and the other nodes select a compression algorithm appropriate to the allocated energy and the limitation of data to be transmitted. A simulation result verifies that the proposed scheme gathers more data with a lower number of blackout nodes than other schemes. We also found that it adapts better to changes in node density and the amount of energy harvested.