• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.5
• /
• pp.207-216
• /
• 2023

For decoding-compatible parallel Deflate algorithm, this study proposed a new method of the control header being made in such a way that essential information for parallel compression and decompression are stored in the Disposed Bit Area (DBA) of the non-compression block and being inserted into the compressed blocks. Through this, parallel compression and decompression are possible while maintaining perfect compatibility with the existing decoder. After applying this method, the compression time was reduced by up to 71.2% compared to the sequential processing method, and the parallel decompression time was reduced by up to 65.7%. In particular, it is well known that parallel decompression is impossible due to the structural limitations of the Deflate algorithm. However, the decoder equipped with the proposed method enables high-speed parallel decompression at the algorithm level and maintains compatibility, so that parallelly compressed data can be decoded normally by existing decoder programs.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.521-525
• /
• 1998

In this paper, we propose a fast algorithm for fractal image coding to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make an image to be matched. Then, the whole area of the contracted image is searched in order to find contractive transformation point of the original image corresponding to the contacted image. It needs a lot of searching time on encoding and remains limitation in the improvement of compression ratio. However, the proposed algorithm not only considerably reduces encoding tin e by using scaling method and limited search area method but also improves compression ratio by using bit-plane. When comparing the proposed algorithm with Jacquin's method, the proposed algorithm provides much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Journal of the Korean GEO-environmental Society
• /
• v.13 no.11
• /
• pp.43-50
• /
• 2012

In this research, the value of consolidation index was investigated. The range of the investigated standard deviation was analyzed and the deviation based settlement was calculated. Also, the compression index, which is the effect of the uncertainty in the ground was analyzed using the flimsy ground construction method. The settlement behavior in each embankment compaction stage was analyzed by applying the precompression load method, drainage expediting method, and displacement method through numerical analysis. In addition to the above, the settlement behavior was studied by analyzing the Piled Raft method which is stable for long term settlement. As a result, the final settlement amount based on average analysis results was that the settlement based on each of the average interpretation value, mean value of the maximum and minimum value and average compression index was different. The result of the comparison shows the difference in variation coefficient by the difference in time. Amongst them, the Piled Raft method shows the most consistent variation coefficient regardless of time and it also was least affected by the compression index of uncertainty.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.11-22
• /
• 1997

The fractal image compression partitions an original image into blocks of equal size and searches a do-main block having self-similarity. This method of compression achieves high compression ratio because it is unnecessary to transmit the additional codebook to receiver and it provides good quality of reconstructed images. In spite of these advantages, this method has a drawback in which encoding time increase due to a complicated linear transformation for determining a similar-domain block. In this paper, a fast fractal image compression method is proposed by decreasing the number of transformation usings AC(alternating current) coefficients of block. The proposed method also has a good quality as compared with the well-known fractal codings. Furthermore, method also has a good quality as apply the video steganography that can conceal an important secret data.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.61-67
• /
• 2011

In this paper, a new method for effective video coding is studied. Picture set filter is proposed for preserving compression ratio and video quality. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently, video quality can be preserved and bit rate can be controlled adaptively. In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. In the former case, video quality, compression ratio and encoding time is improved. In the latter case, video quality is degraded, but compression ratio and encoding time is improved. Consequently, the proposed method shows a reasonably good performance over existing ones.

• Korean Journal of Applied Biomechanics
• /
• v.31 no.3
• /
• pp.220-225
• /
• 2021

Objective: The purpose of this study was to investigate the effect of levels of education on ground reaction force and center of pressure parameters during chest compression resuscitation. Method: Twenty male university students were divided into two groups; certified group (CG, n=10) and non-certified group (NCG, n=10). Two force plates were used to measure ground reaction force and center of pressure parameters during 30 times (three trials) chest compression resuscitation. Independent t-tests were used to compare ground reaction force and center of pressure parameters between two groups. An alpha level of 0.05 was used in all tests. Results: All chest-compression time parameters (total time, 1 systolic time, and diastolic time) in CG were significantly shorter than those in NCG (p<.05). Fy of the diastolic and Fz of the systolic in CG revealed significantly the larger GRF values and Fy of the systolic in CG showed significantly the smaller GRF value (p<.05). The standard deviation of Fz of the systolic and diastolic within the subject during 30 times chest-compression resuscitation revealed significantly the smaller values in CG (p<.05). Conclusion: First, CG performed chest compressions efficiently at an appropriate rate compared to NCG. Second, CG showed lower Fx and Fy values in both the mediolateral and anteroposterior axes compared to NCG, which reduced unnecessary chest-compression force consumption and minimized the movement in patients with cardiac arrest. Third, CG showed high Fz value of the systolic and low Fz value of the diastolic. Based on this, chest compression resuscitation was performed to increase the survival rate of cardiac arrest patients.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.333-334
• /
• 2002

Injection-compression molding parts are many cases with complicated boundary condition which is difficult to analysis of mold characteristics precisely. In this study, the effects of various process parameters such as multi-point gate location, initial charge volume, injection time and pressure have been investigated using finite element method to fomulate the melt front advancement during the mold filling process. A general governing equation for tracking the filling process during injection-compression molding is applied to volume of fluid method. To verify the results of present analysis, they are compared with those of the other paper. The results show a strong effect of processing conditions as a result of variations in the three-dimensional complex geometry model.

• The Korean Journal of Emergency Medical Services
• /
• v.19 no.3
• /
• pp.139-148
• /
• 2015

Purpose: This study aimed to compare the chest compression quality between compression-only cardiopulmonary resuscitation (CPR) and conventional CPR. Methods: This study involved 123 participants randomly assigned to either the chest compression-only CPR training and conventional CPR training. After training for 120 min, the participants performed CPR for 4 min and the CPR quality was evaluated. The primary outcome was evaluated as the mean compression depth, and the secondary outcome was calculated as the proportion of chest compressions with an appropriate depth among the total chest compressions. Results: The mean compression depth was more deeper in conventional CPR than in compression-only CPR (57mm vs. 53mm, p <.001). The proportion of appropriate chest compression depth was also more higher in conventional CPR (98.8% vs. 68.6%, p <.001). As compared with every minute over time for a total of 4 min, the mean compression depth and the proportion of appropriate chest compression depth were deeper and higher after 1 min in conventional CPR than in compression-only CPR. Conclusion: The results suggested that conventional CPR is a better method than compression-only CPR in terms of chest compression quality.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.355-358
• /
• 2002

In this paper, we propose RTP(Real-Time Transport Protocol) based image transport system to transport still images in real-time after JPEG2000 compression, which is still image compression standard for next generation. To add RTP packet on UDP packet, the image transport system inserts packetizer and depacketizer process into transmitter and receiver of RTP data, respectively. We apply the proposed system to several image and compare the transport time to TCP-based method.

• Korean Journal of Construction Engineering and Management
• /
• v.1 no.3 s.3
• /
• pp.75-80
• /
• 2000

In scheduling multi-unit projects, several alternatives can exist in network construction due to repetitiveness of their activities. Project duration is affected not only by the duration of each activity but also by the arrangement of repeating activities in such projects. This paper provides a network compression method that assigns predecessors to each activity to minimize its float time. Different to the previous efforts that utilized line of balance as the base scheduling-model, this research adopts precedence diagram arranged in two coordinates, the space axis and the resource one. This method seeks the most appropriate predecessors for each activity in each direction of the two coordinates for the purpose of minimizing the idle resource and space. This activity arrangement method was applied to a multi-unit apartment-construction project, to prove its capability of network compression. The result shows that the method successfully sought room for saving construction duration by changing the activity arrangement. The network compression method presented in this research can be utilized in multi-unit construction projects such as apartment complex projects.