• Journal of Broadcast Engineering
• /
• v.24 no.7
• /
• pp.1246-1258
• /
• 2019

Since light field (LF) image has huge data volume, it requires high-performance compression technique for efficient transmission and storage of its data. Camera users may like to represent parts of image at different levels of focus at their choice anytime. To address this refocusing functionality, in this paper, we first render a focal stack consisting of multi-focus images, then compress it instead of original LF data. The proposed method has advantage of minimizing the amount of LF data to realize the targeted refocusing applications. Our experiment results show that the proposed method outperforms the state-of-the-art for LF image compression method.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.360-363
• /
• 1999

Video data compression is a major key technology in the field of multimedia applications. Variable-length coding is the most popular data compression technique which has been used in many data compression standards, such as JPEG, MPEG and image data compression standards, etc. In this paper, we present memory efficient VLC decoder architecture for MPEG-2 application which can achieve small memory space and higher throughput. To reduce the memory size, we propose a new grouping, remainder generation method and merged lookup table (LUT) for variable length decoders (VLD's). In the MPEG-2, the discrete cosine transform (DCT) coefficient table zero and one are mapped onto one memory whose space requirement has been minimized by using efficient memory mapping strategy The proposed memory size is only 256 words in spite of mapping two DCT coefficient tables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.901-913
• /
• 1991

Data compression has important application in the areas of file storage and distributed computer systems. The universal data compression achieves asymptotically optimum cimpression ratio for strings generated by any stationary ergodic source without a priori source probabilities.The paper describes the principle and the recent research trends on universal data compression. And its applications.

• Geomechanics and Engineering
• /
• v.19 no.4
• /
• pp.353-360
• /
• 2019

The elastic modulus is an important parameter to characterize the property of rock. It is common knowledge that the strengths of rocks are significantly different under tension and compression. However, little attention has been paid to the bi-modularity of rock. To validate whether the rock elastic moduli in tension and compression are the same, Brazilian disc, direct tension and compression tests were conducted. A horizontal laser displacement meter and a pair of vertical and transverse strain gauges were applied. Four types of materials were tested, including three types of rock materials and one type of steel material. A comprehensive comparison of the elastic moduli based on different experimental results was presented, and a tension-compression anisotropy model was proposed to explain the experimental results. The results from this study indicate that the rock elastic modulus is different under tension and compression. The ratio of the rock elastic moduli under compression and tension ranges from 2 to 4. The rock tensile moduli from the strain data and displacement data are approximate. The elastic moduli from the Brazilian disc test are consistent with those from the uniaxial tension and compression tests. The Brazilian disc test is a convenient method for estimating the tensile and compressive moduli of rock materials.

• 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 Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.142-146
• /
• 2012

Today, the demand for high-speed data communication and mobile communication has exploded. Thus, there is a growing need for optical communication systems that convert large volumes of data to optical signals and that accommodate and transmit the signals across long distances. Digital optical communication with these characteristics consists of a master unit (MU) and a slave unit (SU). However, the digital optical units that are currently commercialized or being developed transmit data without compression. Thus, digital optical communication using these units is restricted by the quantity of optical frames when adding diversity or operating with various combinations of CDMA, WCDMA, WiBro, GSM, LTE, and other mobile communication technologies. This paper suggests the application of a data compression algorithm to a digital signal processor (DSP) chip as a field programmable gate array (FPGA) and a complex programmable logic device (CPLD) of a digital optical unit to add separate optical waves or to transmit complex data without specific changes in design of the optical frame.

• KIISE Transactions on Computing Practices
• /
• v.22 no.5
• /
• pp.201-208
• /
• 2016

Collection and storing of multiple time series data in real time requires large memory space. To solve this problem, the usage of varying sample size is proposed in the compression scheme using discrete cosine transform technique. Time series data set has characteristics such that a higher compression ratio can be achieved with smaller amount of value changes and lower frequency of the value changes. The coefficient of variation and the variability of the differences between adjacent data elements (VDAD) are presumed to be very good measures to represent the characteristics of the time series data and used as key parameters to determine the varying sample size. Test results showed that both VDAD-based and the coefficient of variation-based scheme generate excellent compression ratios. However, the former scheme uses much simpler sample size decision mechanism and results in better compression performance than the latter scheme.

• 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.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.117-120
• /
• 2001

Synthetic aperture radar (SAR) is a promising active remote sensing technique to obtain large terrain information of the earth in all-weather conditions. SAR is useful in many applications, including terrain mapping and geographic information system (GIS), which use SAR display images. Usually, these applications need the enormous data storage because they deal with wide terrain images with high resolution. So, compression technique is a useful approach to deal with SAR display images with limited storage. Because there is some indispensable data loss through the conversion of a complex SAR image to a display image, some applications, which need high-resolution images, cannot tolerate more data loss during compression. Therefore, lossless compression is appropriate to these applications. In this paper, we propose a novel lossless compression technique for a SAR display image using one-step predictor and block arithmetic coding.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.9
• /
• pp.57-64
• /
• 2008

This paper proposes a new test data compression scheme which has good performance. The proposed scheme is composed of adding transition stage and shifting transition stage using don't care remapping technique. The experimental results show that the new scheme provides higher compression ratio than RL-huffman encoding which is the one of the highest performance schemes, and requires smaller hardware overhead. Therefore it can be widely used as a practical solution for test data compression.