• Journal of Korea Multimedia Society
• /
• v.18 no.3
• /
• pp.298-311
• /
• 2015

Vector data represents a map by its coordinate and Raster data represents a map by its pixel. Since these data types have very large data size, data compression procedure is a compulsory process. This paper compare the results from three different methodologies; GIS (Geographic Information System) vector map data compression using DP(Douglas-Peucker) Simplification algorithm, vector data compression based on Bin classification and the combination between two previous methods. The results shows that the combination between the two methods have the best performance among the three tested methods. The proposed method can achieve 4-9% compression ratio while the other methods show a lower performance.

• Journal of Biomedical Engineering Research
• /
• v.15 no.2
• /
• pp.175-182
• /
• 1994

The international standard for digital compression and coding of continuous-tone still image known as JPEG (Joint Photographic Experts Group) standard is investigated for medical image archiving and communication. The JPEG standard has widely been accepted in the areas of electronic image communication, computer graphics, and multimedia applications, however, due to the lossy character of the JPEG compression its application to the field of medical imaging has been limited. In this paper, the JPEG standard is investigated for medical image compression with a series of head sections of magnetic resonance (MR) images (256 and 4096 graylevels, $256 {\times}256$size). Two types of Huffman codes are employed, i. e., one is optimized to the image statistics to be encoded and the other is a predetermined code, and their coding efficiencies are examined. From experiments, compression ratios of higher than 15 were obtained for the MR images without noticeable distortion. Error signal in the reconstructed images by the JPEG standard appears close to random noise. Compared to existing full-frame bit-allocation technique used for radiological image compression, the JPEG standard achieves higher compression with less Gibb's artifact. Feature of the progressive image build-up of the JPEG progressive coding may be useful in remote diognosis when data is transmitted through slow public communication channel.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.263-269
• /
• 2003

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3D) irreversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm〔l-3〕to medical images, using a 3-D wavelet decomposition and a 3-D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. As the compression rate increases, the boundaries between adjacent coding units become increasingly visible. Unlike video, the volume image is examined under static condition, and must not exhibit such boundary artifacts. In order to eliminate them, we utilize overlapping at axial boundaries between adjacent coding units. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well. The improvement is visibly manifested as fewer ringing artifacts and noticeably better reconstruction of low contrast.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.639-646
• /
• 2006

Data compression technologies enable us to store and transfer large amount of data efficiently, and become more and more important due to increasing data size and the network traffic. Moreover, as a result of the increase of computing power, volumetric data produced from various applied science and engineering fields has been getting much larger. In this Paper, we present a volume compression scheme which exploits Daubeches wavelet transform. The proposed scheme basically supports lossy compression for 3D volume data, and provides unit-wise random accessibility. Since our scheme shows far lower error rates than the previous compression methods based on Haar filter, it could be used well for interactive visualization applications as well as large volume data compression requiring image fidelity.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.618-629
• /
• 2009

The MPEG-4 Audio Lossless Coding (ALS) standard belongs to the family MPEG-4 audio coding standards. In contrast to lossy codecs such as AAC, which merely strive to preserve the subjective audio quality, lossless coding preserves every single bit of the original audio data. The ALS core codec is based on forward-adaptive linear prediction, which combines remarkable compression with low complexity. Additional features include long-term prediction, multichannel coding, and compression of floating-point audio material. This paper describes the basic elements of the ALS codec with a focus on prediction, entropy coding, and related tools and points out the most important applications of this standardized lossless audio format.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.165-170
• /
• 1998

This paper presents a new prediction method RBP region-based prediction model where the context used for prediction contains regions instead of individual pixels. There is a meaningful property that RBP can partition a cartoon image into two distinctive types of regions, one containing full-color backgrounds and the other containing boundaries, edges and home-chromatic areas. With the development of computer techniques, synthetic images created with CG (computer graphics) becomes attactive. Like the demand on data compression, it is imperative to efficiently compress synthetic images such as cartoon animation generated with CG for storage of finite capacity and transmission of narrow bandwidth. This paper a lossy compression method to full-color regions and a lossless compression method to homo-chromatic and boundaries regions. Two criteria for partitioning are described, constant criterion and variable criterion. The latter criterion, in form of a linear function, gives the different threshold for classification in terms of contents of the image of interest. We carry out experiments by applying our method to a sequence of cartoon animation. We carry out experiments by applying our method to a sequence of cartoon animation. Compared with the available image compression standard MPEG-1, our method gives the superior results in both compression ratio and complexity.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.40-56
• /
• 2017

Since the progress of digital medical imaging techniques, it has been needed to compress the variety of medical images. In medical imaging, reversible compression of image's region of interest (ROI) which is diagnostically relevant is considered essential. Then, improving the global compression rate of the image can also be obtained by separately coding the ROI part and the remaining image (called background). For this purpose, the present work proposes an efficient reversible discrete cosine transform (RDCT) based embedded image coder designed for lossless ROI coding in very high compression ratio. Motivated by the wavelet structure of DCT, the proposed rearranged structure is well coupled with a lossless embedded zerotree wavelet coder (LEZW), while the background is highly compressed using the set partitioning in hierarchical trees (SPIHT) technique. Results coding shows that the performance of the proposed new coder is much superior to that of various state-of-art still image compression methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1383-1386
• /
• 1997

Discrete cosine transform(DCT) is the most popular block transform coding in lossy mode. DCT is close to statistically optimal transform-the Karhunen Loeve transform. In this paper, a module for DCT encoder is made with TMS320C80 based on JPEG and MPEG, which are intermational standards for image compression. the DCT encoder consists of three parts-a transformer, a vector quantizer and an entropy encoder.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.114-117
• /
• 2000

In this paper, we proposed robust digital image watermarking based on modulation transfer function (MTF) of human visual system (HVS). Using the proposed method, robust watermarking is possible both in common image processing operations such as cropping and lossy compression and in geometrical transforms such as rotation, scaling, and translation, because it can embed watermark and template signal maximally using MTF of HVS. Experimental results show that the proposed watermarking method is more robust to several common image processing operations and geometrical transforms.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.11-14
• /
• 2003

In block-based lossy video compression, severe quantization causes discontinuities along block boundaries so that annoying blocking artifacts are visible in decoded video imases. These blocking artifacts significantly decrease the subjective image quality. In order to reduce the blocking artifacts in decoded images, many algorithms have been proposed However studies on so called, corner outliers, have been very limited. Corner outliers make image edges look disconnected from those of neighboring blocks at cross block boundary. In order to solve this problem, we propose a corner outlier detection and compensation algorithm as post-processing in spatial domain The experiment results show that the proposed method provides much improved subjective image quality.