• The Korean Journal of Food And Nutrition
• /
• v.9 no.4
• /
• pp.466-471
• /
• 1996

In order to investigate the compression characteristics on the some vegetables-cucumber, garlic, ginger, potato, and radish-compression force, distance, and time were measured with a Struct-O-Graph and correlations between them were investigated. Force-distance and distance-time curves were showed simply and reflection points were showed rarely. The time to rupture point was long of 11.7sec at the compression speed of 60mm/min and of 6.16sec at the compression speed of 120mm/min in potato, and short of 9.65, 4.55sec at the different compression speed in garlic, respectively. The rupture force was large of 16.64~20.00N at the different compression speed in potato and radish, and the sample at rupture point was showed crushing behavior under probe. These phenomena were suggested because compression strength of sample was different. In the result of regression analysis for force-time and distance-time to the rupture point, the correlation coefficients were above 0.96, and difference of among samples was small. The slopes of force-time were large of 1.772~3.385 in cucumber and small of 1.743~3.338 in potato, and the slopes of distance-time were obtained with reverse results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.147-161
• /
• 2003

Video object segmentation is one of the core technologies for content-based real-time MPEG-4 encoding system. For real-time requirement, the segmentation algorithm should be fast and accurate but almost all existing algorithms are computationally intensive and not suitable for real-time applications. The MPEG-4 VM(Verification Model) has provided basic algorithms for MPEG-4 encoding but it has many limitations in practical software development, real-time camera input system and compression efficiency. In this paper, we implemented the preprocessing system for real-time camera input and VOP extraction for content-based video coding and also implemented motion detection to achieve the 180 : 1 compression rate for real-time and high compression MPEG-4 encoding.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.85-93
• /
• 2007

This paper describes a compression scheme for volumetric video data(3D space X 1D time) there each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, runtime decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and only update significantly changing blocks. The results show that our compression scheme compromises decompression speed and image quality well enough for interactive time-varying visualization.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

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

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.851-858
• /
• 2010

Most mobile devices use a NAND flash memory as their secondary memory. A compressed code of the firmware is stored in the NAND flash memory of mobile devices in order to reduce the size and the loading time of the firmware from the NAND flash memory to a main memory. In order to use a demand paging properly, a compressed code should be decompressed very quickly. The thesis introduces a new dictionary based compression algorithm for the fast decompression. The introduced compression algorithm uses a different method with the current LZ method by storing the "exclusive or" value of the two instructions when the instruction for compression is not equal to the referenced instruction. Therefore, the thesis introduces a new compression format that minimizes the bit operation in order to improve the speed of decompression. The experimental results show that the decoding time is reduced up to 5 times and the compression ratio is improved up to 4% compared to the zlib. Moreover, the proposed compression method with the fast decoding time leads to 10-20% speed up of booting time compared to the booting time of the uncompressed method.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.65 no.6
• /
• pp.51-63
• /
• 2023

To improve the problem that the settlement curve of the consolidation theory of Terzaghi does not match well with the actual settlement curve, we included a secondary compression settlement and analyzed it by varying the beginning point and then obtained the following results. The current methods of calculating the compression index from the  log𝜎 curve and the coefficient of consolidation from the time-dependent settlement curve for each consolidation pressure proved that the final settlement amount will be consistent after a long time, but the actual settlement amount will always be smaller than the predicted settlement amount during the settlement progress stage. The consolidation factors estimated by the curve fitting with the condition that the secondary compression begins in the second half of the primary compression showed similar values to the consolidation factors estimated by the curve fitting for the primary compression only, and the settlement curves were in better agreement throughout the compression. It showed different values, showing low validity. It can be inferred that secondary compression acts from the point when a significant portion of the excess pore water pressure is dissipated, and the loading stress begins to have more influence on the skeletal structure of the soil. Analysis results show that secondary compression begins at the range of 91 % to 98 % on the average degree of primary consolidation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.6
• /
• pp.515-520
• /
• 2004

Core-based system-on-a-chip (SoC) designs present a number of test challenges. Two major problems that are becoming increasingly important are long application time during manufacturing test and high volume of test data. Highly efficient compression techniques have been proposed to reduce storage and application time for high volume data by exploiting the repetitive nature of test vectors. This paper proposes a new test data compression technique for SoC testing. In the proposed technique, compression is achieved by partitioning the test vector set and removing repeating segment. This process has $O(n^{-2})$ time complexity for compression with a simple hardware decoding circuitry. It is shown that the efficiency of the proposed compression technique is comparable with sophisticated software compression techniques with the advantage of easy and fast decoding.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2133-2142
• /
• 1997

Compared with previous compression methods, fractal image compression drastically increases compression rate by using block-based encoding. Although decompression can be done in real time even with softwares, the most serious problem in utilizing the fractal method is the time required for the encoding. In this paper, we propose and verify i) an algorithm that reduces the encoding time by reducing the number of similarity searching on the basis of dimensional informations, and ii) an algorithm that enhances the quality of the restored image on the basis of brightness and contrast information. Finally, a method that enables fast compression with little quality degradation is proposed.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1102-1104
• /
• 2003

KOMPSAT-2 provides two different imaging methods, direct imaging and playback imaging. For playback imaging operation KOMPSAT-2 has a storage device called DCSU (Data Compression & Storage Unit) to hold images taken before. Compression function is necessary to save memory space and data transmission time to ground station. There are several parameters for compression like compression ratio. Due to DCSU architectural characteristics and KOMPSAT-2 operational limitations, there are some restrictions on selecting compression parameters. This paper will provide selecting guides on compression parameters.