• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.614-622
• /
• 2015

Binary MQ arithmetic coding is widely used recently as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000. The importance of arithmetic coding is increasing after it is adopted as an unique entropy coder in HEVC standard. In the binary MQ coder, arithmetic approximation without multiplication is used in the process of recursive subdivision of range interval. Because of the MPS/LPS exchange activity happened in MQ coder, output byte tends to increase. This paper proposes an enhanced binary MQ arithmetic coder to make use of a lookup table for AQe using quantization skill in order to reduce the deficiency. Experimental results show that about 4% improvement of compression in case of JBIG2 for bi-level image compression standard. And also, about 1% improvement of compression ratio is obtained in case of lossless JPEG2000 coding. For the lossy JPEG2000 coding, about 1% improvement of PSNR at the same compression ratio. Additionally, computational complexity is not increasing.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.83-92
• /
• 2012

Multimedia contents can be copied and manipulated without quality degradation. Therefore, they are vulnerable to digital forgery and illegal distribution. In these days, with increasing the importance of multimedia security, various multimedia security techniques are studied. In this paper, we propose a content authentication algorithm based on reversible watermarking which supports JPEG compression commonly used for multimedia contents. After splitting image blocks, a specific authentication code for each block is extracted and embedded into the quantized coefficients on JPEG compression which are preserved against lossy processing. At a decoding process, the watermarked JPEG image is authenticated by extracting the embedded code and restored to have the original image quality. To evaluate the performance of the proposed algorithm, we analyzed image quality and compression ratio on various test images. The average PSNR value and compression ratio of the watermarked JPEG image were 33.13dB and 90.65%, respectively, whose difference with the standard JPEG compression were 2.44dB and 1.63%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5476-5496
• /
• 2016

Energy efficiency of resource-constrained wireless sensor networks is critical in applications such as real-time monitoring/surveillance. To improve the energy efficiency and reduce the energy consumption, the time series data can be compressed before transmission. However, most of the compression algorithms for time series data were developed only for single variate scenarios, while in practice there are often multiple sensor nodes in one application and the collected data is actually multivariate time series. In this paper, we propose to compress the time series data by the Lasso (least absolute shrinkage and selection operator) approximation. We show that, our approach can be naturally extended for compressing the multivariate time series data. Our extension is novel since it constructs an optimal projection of the original multivariates where the best energy efficiency can be realized. The two algorithms are named by ULasso (Univariate Lasso) and MLasso (Multivariate Lasso), for which we also provide practical guidance for parameter selection. Finally, empirically evaluation is implemented with several publicly available real-world data sets from different application domains. We quantify the algorithm performance by measuring the approximation error, compression ratio, and computation complexity. The results show that ULasso and MLasso are superior to or at least equivalent to compression performance of LTC and PLAMlis. Particularly, MLasso can significantly reduce the smooth multivariate time series data, without breaking the major trends and important changes of the sensor network system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.1-8
• /
• 2009

Image compression schemes, such as JPEG and JPEG2000, degrade the Quality of a reconstructed image due to their lossy characteristics. Accordingly, this paper investigates the relationship between the compression ratio and the gamut variation for a reconstructed image using JPEG and JPEG2000. To analyze the relationship between compression ratio and gamut variation, i.e. the hue and chroma shift in the uniform color space, eighteen color samples from the Macbeth ColorChecker are initially used. Based on the color shift phenomenon for the color samples, twelve natural color images, classified into two groups depending on four color attributes, are also used to investigate the relationship between the level of compression and the variation in the gamut area. As a results, through the experiments, least square method is applied to obtain the fitting curves as an equation minimizing the error between the real data and its corresponding approximated values.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.11
• /
• pp.97-104
• /
• 2004

This paper proposes an efficient VLSI architecture of 9-7/5-3 Lifting DWT filters that is used by lossy or lossless compression of JPEG2000. The proposed architecture uses only internal line memories to compute Lifting-DWT operations and its PE(Processing Element) has critical path with 1 multiplier and 1 adder. To reduce the number of PE, we make the vertical filter that is responsible for the column operations of the first level perform both the row and column operations of the second and following levels. As a result, the architecture has smaller hardware cost compared to that of other architectures. It was modeled in RTL level using VHDL and implemented on Altera APEX 20K FPGA.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.75-82
• /
• 2004

The channel transmission ratio is speeded up by the combination of the Huffman algorithm, the model scheme of the lossy transform having minimum average code lengths for the image information and good instantaneous decoding capability, with the Lempel-Ziv algorithm showing the fast processing performance during the compression process. In order to increase the processing speed during the compression process, ICMEP algorithm is proposed and the entropy encoder of HDTV is designed and inspected. The ICMEP entropy encoder have been designed by choosing the top-down method and consisted of the source codes and the test benches by the behavior expression with VHDL. As a simulation results, implemented ICMEP entropy encoder confirmed that whole system efficiency by memory saturation prevention and compressibility increase improves.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.355-360
• /
• 2011

In this paper, we propose a new context-based adaptive binary arithmetic coding (CABAC) method for lossless image compression. Since the conventional CABAC in H.264/AVC was originally designed for lossy coding, it does not yield adequate performance during lossless coding. Therefore, we proposed an improved CABAC method for lossless intra coding by considering the statistical characteristics of residual data in lossless intra coding. Experimental results showed that the proposed method reduced the bit rate by 18.2%, compared to the conventional CABAC for lossless intra coding.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.61-65
• /
• 2003

In this paper, a novel watermarking technique that based on wavelet packet transform using PIM is proposed for the copyright of the digital images. We divide wavelet packet coefficients into detailed blocks and calculate the complexity of each block using PIM. Because human is impervious to the change in the complex area, the embedding watermark to the selected coefficients using PIM enhances invisibility. From the experimental results, the proposed algorithm shows better invisibility and robustness performance in a general signal processing such as JPEG and SPIHT lossy compression, median filtering. Especially, it demonstrates better performance for the low bit-rate compression in the images that include many high frequency components.

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

국제표준 3차원 포인트 클라우드 압축 기술인 MPEG(Moving Picture Experts Group)-I(Immersive) V-PCC(Video-based Point Cloud Compression)에는 점유 맵(Occupancy Map) 손실/무손실 압축 기술이 포함되어 있다. V-PCC는 기존에 보급되어 있는 2차원 비디오 코덱(H.264/AVC, HEVC, AV1 등)을 그대로 활용할 수 있는 장점이 있는데, 대부분의 소비자 영상 기기에 포함되어 있는 2차원 비디오 복호화기 HW는 무손실을 지원하지 않는다. 따라서 V-PCC 복호화기의 폭넓은 상용화를 위해서는 부호화기에서 점유 맵의 손실 압축이 필수적이다. 본 논문은 V-PCC 부호화기의 점유 맵을 최소한의 압축 효율 저하로 손실 압축하기 위해 다양한 파라미터 실험을 통한 최적의 파라미터 값을 제시한다.

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.31-38
• /
• 2022

An electrocardiogram(ECG) is a recoding of electrical signals of the heart's cyclic activity and an important body information for diagnosing myocardial rhythm. Large amount of information are generated continuously and a significant period of cumulative signal is required for the purpose of diagnosing a specific disease. Therefore, research on compression including clinically acceptable lossy technique has been developed to reduce the amount of information significantly. Recently, wearable smart heart monitoring devices that can transmit electrocardiogram(ECG) are being developed. The use of electrocardiogram, an important personal information for healthcare service, is rapidly increasing. However, devices generally have limited capability and power consumption for user convenience, and it is often difficult to apply the existing compression method directly. It is essential to develop techniques that can process and transmit a large volume of signals in limited resources. A method for compressing and transmitting the ECG signals efficiently by using the cumulative average (template) of the unit waveform is proposed in the paper. The ECG is coded lovelessly using template matching. It is analyzed that the proposed method is superior to the existing compression methods at high compression ratio, and its complexity is not relatively high. And it is also possible to apply compression methods to template matching values.