• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.950-954
• /
• 2004

According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.358-362
• /
• 2004

According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.38-42
• /
• 2002

A fast iterative solving method of fuzzy relational equation is proposed. It is derived by eliminating a redundant comparison process in the conventional iterative solving method (Pedrycz, 1983). The proposed method is applied to image reconstruction, and confirmed that the computation time is decreased to 1 / 40 with the compression rate of 0.0625. Furthermore, in order to make any initial solution converge on a reconstructed image with a good quality, a new cost function is proposed. Under the condition that the compression rate is 0.0625, it is confirmed that the root mean square error of the proposed method decreases to 27.34% and 86.27% compared with those of the conventional iterative method and a non iterative image reconstruction method, respectively.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.311-321
• /
• 2003

In an emergency telemedicine system such as the High-quality Multimedia based Real-time Emergency Telemedicine(HMRET) service, it is very important to examine the status of the patient continuously using the multimedia data including the biological signals(ECG, BP, Respiration, $SpO_2)$ of the patient. In order to transmit these data real time through the communication means which have the limited transmission capacity, it is also necessary to compress the biological data besides other multimedia data. For this purpose, we investigate and compare the ECG compression techniques in the time domain and in the wavelet transform domain, and present an effective lossless compression method of the biological signals using PEG Huffman table for an emergency telemedicine system. And, for the HMRET service, we developed the lossless compression and reconstruction program or the biological signals in MSVC++ 6.0 using DPCM method and JPEG Huffman table, and tested in an internet environment.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.825-828
• /
• 2022

In this paper, we propose an efficient image size selection method for video-based point cloud compression. The current MPEG video-based point cloud compression reference encoding process configures a threshold on the size of images while converting point cloud data into images. Because the converted image is compressed and restored by the legacy video codec, the size of the image is one of the main components in influencing the compression efficiency. If the image size can be made smaller than the image size determined by the threshold, compression efficiency can be improved. Here, we studied how to improve the compression efficiency by selecting the best-fit image size generated during video-based point cloud compression. Experimental results show that the proposed method can reduce the encoding time by 6 percent without loss of coding performance compared to the test model 15.0 version of video-based point cloud encoder.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.2
• /
• pp.117-126
• /
• 2012

This paper provides a method for compression transmission of on-chip bus data. As the data traffic on on-chip buses is rapidly increasing with enlarged video resolutions, many video processor chips suffer from a lack of bus bandwidth and their IP cores have to wait for a longer time to get a bus grant. In multimedia data such as images and video, the adjacent data signals very often have little or no difference between them. Taking advantage of this point, this paper develops a simple bus data compression method to improve the chip performance and presents its hardware implementation. The method is applied to a Video Codec - 1 (VC-1) decoder chip and reduces the processing time of one macro-block by 13.6% and 10.3% for SD and HD videos, respectively

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.9 s.339
• /
• pp.41-50
• /
• 2005

As the size of circuits becomes larger, the test method needs more test data volume and larger test application time. In order to reduce test data volume and test application time, a new test data compression/decompression method is proposed. The proposed method is based on an XOR network uses don't-care-bits to improve compression ratio during seed vectors generation. After seed vectors are produced seed vectors can be merged using two prefix codes. It only requires 1 clock time for reusing merged seed vectors, so test application time can be reduced tremendously. Experimental results on large ISCAS '89 benchmark circuits prove the efficiency of the proposed method.

• Tribology and Lubricants
• /
• v.18 no.5
• /
• pp.345-350
• /
• 2002

Recently, as the development of manufacturing technique on SMC(sheet molding compound), various numerical and experimental approaches to injection and compression molding have been investigated. Injection and compression molding, however, has so various cases with complicated boundary condition that it is difficult to analyze mold characteristics precisely. In addition, since a slight change in process variables can significantly change the resulting mold thickness, a proper design is important to compression molding process. Therefore, in this study, the effects of various parameters on compression molding process have been investigated using FEM(finite element method) to formulate the melt front advancement during the mold filling process. To verify the results of present analysis, they are compared with those of reference. The results show a strong effect of initial charge volume, injection time and pressure as a result of variations in the rectangular charge shape.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.97-102
• /
• 1998

In this paper, 1 proposed methods of fractal image compression to get better orginal images in a high compression raitos with encoding image effectively. For given signal-to-noise raitos tolerances, show the proposed compression method are higher than Fisher's method for compression raitos at all thresholds. This is due to improve compression time in the local IFS structure that reduce PIFS information storage requirements from 48bits range blocks to the 40bits.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.03a
• /
• pp.993-998
• /
• 2009

This study was conducted to propose the model that is able to predict long-term settlement of sands containing carbonates. We can observe that in addition to the initial elastic compression, a considerable additional compression occurs with long-term period in some sands. The compressibility of sands is significantly dependent on particle characteristics. Some sands have many pores and particularly has an angular shape. To predict of long-term settlement of these sands which contain carbonates, first of all a variety of tests which are to assess chemical, physical and compression characteristics of these sands were conducted. Second, in order to know settlement with time, the time parameter was determined by analyzing the measured data obtained from $\bigcirc\bigcirc$ area. The measured settlement of this area shows that in addition to the initial elastic compression, a considerable additional compression occurring with time. It was caused by the crushing, shattering, and rearrangement of particles, which were real phenomena in sandy soils under loading condition. Based on this case study, we proposed that a simple method is able to predict settlement with time of sandy soil containing carbonates.