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

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.269-274
• /
• 2008

Recently, lots of embedded processors which can run streaming multimedia with high resolution display are introduced. Among the applications running on these embedded processors, real-time audio streaming is one of the applications that suffer from the lack of energy and memory space. In this paper, we propose a novel data compression method on scratch-pad memory, which saves both useful space on the scratch-pad memory and energy. We have implemented the data compression scheme on the GDM1202 real-time audio streaming processor, and the performance results show that we obtained 13.3% energy saving while maintaining comparable application performance to that of the non-compression case.

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

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.863-864
• /
• 2005

In recent years, we use overdriving scheme to improve the response time of the liquid crystal. Since conventional overdriving scheme uses memory to perform ideal processing, it is desired to reduce system cost by decreasing the data stored in these SDRAMs. As a general compression method, quantization, sub-sampling and Block Truncation Coding ( BTC ) are used, which process data in block base and cause block effect. So we proposed new data compression method by color space conversion. Because this method compresses luminance and chrominance signal by different ratio, it can efficiently reduce error of block effect in decompression image.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.298-300
• /
• 2005

Satellite payload on-board date compression unit are use for saving date storage space and reducing time to transmit payload data to the ground station. The KOMPSAT-3 payload will generate higher data rate than KOMPSAT-2 due to its better ground sample distance capacity. High input data rate and limited output transmission data rate might lead excessive compression and degraded image quality. This paper presents a trade-off study about data storage capacity and compression parameters for estimated KOMPSAT-3 system.

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

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.322-331
• /
• 2016

Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

• 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 Information Technology Applications and Management
• /
• v.10 no.4
• /
• pp.159-168
• /
• 2003

This paper is concerned with the compression of EEG signals using wavelet-packet based techniques. EEG data compression is desirable for a number of reasons. Primarily it decreases for transmission time, archival storage space, and in portable systems, it decreases memory requirements or increases channels and bandwidth. Upon wavelet decomposition, inherent redundancies in the signal can be removed through thresholding to achieve data compression. We proposed the energy cumulative function for deciding of the threshold value and it works very innovative of EEG data.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.4
• /
• pp.622-630
• /
• 2016

In the operation of a low earth orbit satellite, a series of antenna commands are transmitted from a ground station to the satellite within a visibility window (i.e., the time period for which an antenna of the satellite is visible from the station) and executed to control the antenna. The window is a limited resource where all data transmission is carried out. Therefore, minimizing the transmission time for the antenna commands by reducing the data size is necessary in order to provide more time for the transmission of other data. In this paper, we propose a geometric compression method based on B-spline curve fitting using dominant points in order to compactly represent the antenna commands. We transform the problem of command size reduction into a geometric problem that is relatively easier to deal with. The command data are interpreted as points in a 2D space. The geometric properties of the data distribution are considered to determine the optimal parameters for a curve approximating the data with sufficient accuracy. Experimental results demonstrate that the proposed method is superior to conventional methods currently used in practice.