• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2341-2348
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on mean-residual metod. Sub-blocks of an image are encoded using mean-residual method where mean value is predicted according to that of neighboring blocks. Projection scheme with 8 directions is applied to the compression of residual signals of blocks. Projection vectors are finite-state vector quantized according to the projection angle of nighboring blocks in order to exploit the correlation among them. Side information to represent the repetition of projection is run-length coded while the information for projection direction is compressed using entropy encoding. The proposed scheme apears to be better in PSNR performance when compared with conventional projection scheme as well as in subjective quality preserving the edges of images better than most tranform methods which usually require heavy computation load.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1078-1089
• /
• 2015

In this paper, we propose the Min-hash Assisted Delta-compression Engine(MADE) to improve the lifetime of NAND flash-based storages at the device level. MADE effectively reduces the write traffic to NAND flash through the use of a novel delta compression scheme. The delta compression performance was optimized by introducing min-hash based LSH(Locality Sensitive Hash) and efficiently combining it with our delta compression method. We also developed a delta encoding technique that has functionality equivalent to deduplication and lossless compression. The results of our experiment show that MADE reduces the amount of data written on NAND flash by up to 90%, which is better than a simple combination of deduplication and lossless compression schemes by 12% on average.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.40 no.5
• /
• pp.775-787
• /
• 2016

This study examined the wearing conditions of compression wear for weight training. Compression wear has recently received significant attention from the public and athletes as high-level functional sportswear. The survey was conducted on 373 men in their 20s for general information on purchase behavior, preferred brand, function, and preferred design. The majority of participants (n=181) were aware of the function of compression wear. The most selected reason for wearing compression wear was for its convenience during sports activities. Respondents had the greatest preference for designs with a round neckline, regular leggings type, upper arm-length sleeve, and thigh-length bottom. Respondents also wanted a stronger compression in the core muscle part (abdomen, back, and waist).

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.282-285
• /
• 2006

This paper analyzed the characteristics of the Lossy JPEG of the meteorological satellite image, and analyzed the quality of the Lossy JPEG compression, which is proper for the LRIT(Low Rate Information Transmission) to be serviced to the SDUS(Small-scale Data Utilization Station) system of the COMS(Communication, Oceans, Meteorological Satellite). Since COMS is to start running after 2008, we collected the data of the MTSAT-1R(Multi-functional Transport Satellite -1R) for analysis, and after forming the original image to be used to LRIT by each channel and time zone of the satellite image data, we set the different quality with the Lossy JPEG compression, and compressed the original data. For the characteristic analysis of the Lossy JPEG, we measured PSNR(Peak Signal to Noise Rate), compression rate and the time spent in compression following each quality of Lossy JPEG compression. As a result of the analysis of the satellite image data of the MTSAT-1R, the ideal quality of the Lossy JPEG compression was found to be 90% in the VIS Channel, 85% in the IR1 Channel, 80% in the IR2 Channel, 90% in the IR3 Channel and 90% in the IR4 Channel.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.06a
• /
• pp.174-182
• /
• 1997

The technology of Semi-Solid Forging (SSF) has been actively developed to fabricate near-net-shape products using light and hardly formable materials. Generally, the SSF process is composed of slug heating, forming, compression -holding and ejecting step. After forming step in SSF, the slug is compressed during a certain holding time in order to be completely filled in the die cavity and be accelerated in solidification rate. The compression holding time that can affect microstructural characteristics and shape of products is important to make decision, where it is necessary to find overall heat transfer coefficient properly which has large effect on heat transfer between slug and die. This paper presents the procedure to predict compression holding time of obtaining the final shaped part with information of temperature and solid fraction for a cylindrical slug at compression holding step in closed-die compression process using heat transfer analysis considering latent heat by means of finite element method. The influence of the predicted compression holding time on microstructural characteristics of products is finally investigated by experiment.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.281-287
• /
• 2021

Bioinformatics is formed with a blend of biology and informatics technologies and it employs the statistical methods and approaches for attending the concerning issues in the domains of nutrition, medical research and towards reviewing the living environment. The ceaseless growth of DNA sequencing technologies has resulted in the production of voluminous genomic data especially the DNA sequences thus calling out for increased storage and bandwidth. As of now, the bioinformatics confronts the major hurdle of management, interpretation and accurately preserving of this hefty information. Compression tends to be a beacon of hope towards resolving the aforementioned issues. Keeping the storage efficiently, a methodology has been recommended which for attending the same. In addition, there is introduction of a competent algorithm that aids in exact matching of small pattern. The DNA representation sequence is then implemented subsequently for determining 2 bases to 6 bases matching with the remaining input sequence. This process involves transforming of DNA sequence into an ASCII symbols in the first level and compress by using LZ77 compression method in the second level and after that form the grid variables with size 3 to hold the 100 characters. In the third level of compression, the compressed output is in the grid variables. Hence, the proposed algorithm S_Pattern DNA gives an average better compression ratio of 93% when compared to the existing compression algorithms for the datasets from the UCI repository.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1076-1085
• /
• 2004

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. And there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for the payload of small size. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of IP/UDP protocols to reduce the overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented in Linux environment. Using the Header compression system designed between a server and clients provides have the advantage of effective data throughput in network. Since the minimum packet size in Ethernet is 64 bytes, the amount of reduction by header compression in practical chatting environment was 6.6 bytes.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.133-142
• /
• 2014

According to the development of medical information systems, shortened examination time per patient could increase the number of treatments, resulting in the rapid growth of the amount of medical data. Studies on how to efficiently compress and store medical text data of increasing patients are in progress. However, previous methods have the shortcoming of compressing medical text data as it is, resulting in low compression rate. This research tries to overcome the problem by using the gamma coding method which enables compression in bit unit. We propose a new compression scheme which encodes the deviations between measured values and normal range values. Furthermore, we suggest to use the previous value with the least deviation from the measurement as the standard value to encode that deviation. Even though the suggested methods are simple, they have high compression rates. Through performance evaluation, we show that the suggested methods are more efficient than the previous methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.625-629
• /
• 2005

According to the rapid development of the information and communication technology, the demand on the efficient compression technology for the multimedia data is increased magnificently. In this Paper, we designed new compression algorithm structure using wavelet base for the compression of ECG signal and audible signal data. We examined the efficiency of the compression between 2-band structure and wavelet packet structure, and investigated the efficiency and reconstruction error by wavelet base function using Daubechies wavelet coefficient and Coiflet coefficient for each structure. Finally, data were compressed further more using Huffman code, and resultant Compression Rate(CR) and Percent Root Mean Square difference(PRD) were compared with those of existent DCT.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2009

A face database has contained a large amount of facial information data since face recognition was widely used. With the increase of facial information data, the face recognition based on distributed processing method has been noticed as a major topic. In existing studies, there were lack of discussion about the transferring method for large data. So, we proposed a fuzzy logic-based bit compression rate selection method for distributed face recognition. The proposed method selects an effective bit compression rate by fuzzy inference based on face recognition rate, processing time for recognition, and transferred bit length. And, we compared the facial recognition rate and the recognition time of the proposed method to those of facial information data with no compression and fixed bit compression rates. Experimental results demonstrates that the proposed method can reduce processing time for face recognition with a reasonable recognition rate.