• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1127-1136
• /
• 1997

A vector timestamp is used to satisfy message ordering in a group communications. In this paper, we propose a new vector timestamp compression method which is applicable to a single process group environment where one process belongs to only one precess group. An existing compression method compares the fields of the previously sent vector timestamp with thouse of the currently updated vector timestamp, then sends only the modified fields of the vector timestamp. Unlike the previous one, a proposed compression method performs individual compression for each process using the locally maintained vector timestamp information on other processes. Also, we logicallyproved the causal ordering algorithm using the new compression method and compared the performance of the proposed method with one of the previous compression method by computer simulation. Using the proposed compression method, the message overhead required for causal ordering can be reduced.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.135-141
• /
• 2012

To reduce frame memory size usage in LCD overdrive, block truncation coding (BTC) image compression is commonly used. For maximization of compression ratio, BTC image compression is need to compress bitmap or quantization data. In this paper, for high compression ratio, we propose CMBQ-BTC (CMBQ : compression method bitmap data and quantization data) algorithm. Experimental results show that proposed algorithm is efficient as compared with PSNR and compression ratio of the conventional BTC method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.05a
• /
• pp.331-334
• /
• 2003

In the finite element simulation of hot forging processes using hexahedron, remeshing of a flash is very difficult. The mesh compression method is a remeshing technique to construct an effective hexahedral mesh. However, because mesh is distorted during the compression procedure or the mesh compression method, mesh smoothing is necessary to improve the mesh Qualify. in this study, several geometric mesh smoothing techniques and a matrix norm optimization technique are applied and compared which is more adaptive to the mesh compression method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.1
• /
• pp.142-148
• /
• 2003

We compress medical images in order to solve problems both of request of storage mediums and of a low network speed. In this paper, integration compression environment has been developed for unity of various compression methods. Various compression methods that are implemented by integration compression environment, RLC, Lossless JPEG, and JPEG, comply with the DICOM 3.0. A compression method using DWT is implemented at it. And a unit method of Lossless compression method and lossy compression method is designed to improve images quality and to progress compression ratio. Diverse medical images can be compressed by each compression method. And integration compression environment is operated together database so that information of medical images is administered.

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

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.3
• /
• pp.285-290
• /
• 2009

In this paper, we propose a new algorithm that improves the lossless data compression rate. The proposed algorithm lessens the redundancy and improves the compression rate evolutionarily around 40 up to 80 percentile depending on the characteristics of binary images used for compression. In order to demonstrate the superiority of the proposed method, the comparison between the proposed method and the LZ78 (LZ77) is demonstrated through experimental results theoretical analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4624-4642
• /
• 2014

Image compression is a popular research issue that focuses on the problems of reducing the size of multimedia files. Vector Quantization (VQ) is a well-known lossy compression method which can significantly reduce the size of a digital image while maintaining acceptable visual quality. A locally adaptive scheme (LAS) was proposed to improve the compression rate of VQ in 1997. However, a LAS needs extra indicators to indicate the sources, consequently the compression rate of LAS will be affected. In this paper, we propose a novel method to eliminate the LAS indicators and so improve the compression rate. The proposed method uses the concept of data hiding to conceal the indicators, thus further improving the compression rate of LAS. From experimental results, it is clearly demonstrated that the proposed method can actually eliminate the extra indicators while successfully improving the compression rate of the LAS.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.11
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• The Korean Journal of Emergency Medical Services
• /
• v.14 no.3
• /
• pp.71-81
• /
• 2010

Purpose: To minimize an interruption in chest compression, reduce the hands-off time, the American Heart Association has recommended the ratio of chest compression to ventilation ratio to 30:2 from 2005 CPR guideline to 2010 CPR guideline. However, current studies have shown that the hands-off time was > 10 seconds with that method. For this reason, we devised new CPR method that a ventilation to chest compression ratio of 2:30 to reduce pt assessment time and skipped the assessment step of carotid artery pulse would be a more effective way to reduce the hands-off time & the time to set the CPR. According to the more detailed purpose are listed below. 1) We would like to confirm efficiency of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 to reduce the hands-off time & the time to set the CPR. 2) We would like to evaluate possibility of increasing for chest compression accuracy of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 3) We would like to evaluate possibility of increasing for ventilation accuracy of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 Methods: According to 2005 American Heart Association Guidelines, 60 paramedic students(20 students X freshmen, sophomore, junior) performed 5 cycles of 3~ chest compressions : 2 ventilations after A, B, C evaluation with Laerdal Resusci R Anne SkillReporters. After 5 minutes rest, the 60 students performed 5 cycles of 2 ventilations : 30 chest compressions after A, B evaluation with the manikins between 13 and 17 September 2010. The short reports including speed & accuracy of chest compression, respiratory, CPR cycle were gained from the manikins. Hands-off times were measured by assistants. Results: Recently, the importance of high quality CPR was emphasized in order to perform the CPR faster and more accurate. To find out improving the conventional CPR method, we switch the procedure of the compression and the ventilation. By switching the procedure back and forth, we are able to compare the effectiveness of CPR between two type of CPR method which are 2:30 and 30:2 methods. 2:30 is that the breaths is delivered twice, first and perform 30 compressions while 30:2 perform 30 compressions first and give 2 breaths followed by the ABC method. Also, we verify the effectiveness of the hands off time, compression accuracy of the compression through the comparison of the two procedure as mentioned earlier. Consequently research verified that 2:30 is the efficient by providing faster set up delivering more accurate chest compression. Conclusion: 2:30 can minimize a time delay from cardiac standstill until starting the chest compression. In addition, hands-off time which is an interruption in chest compression can be shortened by 2:30 method, which result to effective oxygenation of coronary artery & maintenance of the bloodstream. Once again, performing the 2:30 method provide lessen hands off time and increase the accuracy of the chest compression.