• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.253-260
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs an integer wavelet transform and a linear prediction model. The proposed algorithm divides the input signal into flames of a proper length, decorrelates the framed data using the integer wavelet transform and linear prediction and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded, compressed data.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.401-410
• /
• 2008

Multiview Video Coding contains a macroblock-based illumination compensation tool which can compensate the variations of illuminations according to view or temporal directions. Thanks to illumination compensation tool, the coding efficiency of Multiview Video Coding has been enhanced. However illumination compensation tool also generates additional subjective drawbacks of the blocking artifacts due to macroblock-based compensations of mean values. A deblocking filtering method for Multiview Video Coding which is the same as in H.264/AVC does not consider illumination difference between the illumination compensated blocks, thus it can not effectively eliminate the blocking artifacts. Therefore, this paper analyzes the phenomena of blocking artifacts caused by illumination compensation and proposes a method which can effectively eliminate the blocking artifacts with the minimum changes of the H.264 deblockding filtering method. In the simulation results, it can be easily found the blocking artifacts are clearly eliminated in the subjective comparisons, and the average bit-rate reduction is up to 1.44%.

• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.516-527
• /
• 2008

This paper introduces a derivation method of both P-SKIP and B-SKIP modes for illumination compensation in the multi-view video coding scheme. In this proposed method, mismatches between IC flag and IC offset in P-SKIP mode are removed, and also computational complexity is far reduced in B-SKIP mode in comparison to a multi-view video coding scheme. In simulation results, proposed method has the almost same coding efficiency in comparison with the referenced coding scheme. However computational complexity in 11m-time decoding process is tremendously reduced, such that the average number of blocks that should be processed in P-SKIP mode is saved in about 7.47%, and the average number of operations per block in B-SKIP mode is saved in about 50.36% and corresponding average decoding time per block is also saved in 46%.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.15-24
• /
• 1998

In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.122-128
• /
• 2012

Because of the system delay caused by the number of feedback retransmission in Distributed Video Coding (DVC) scheme, it is difficult to realize practical DVC in many cases. In this paper low feedback retransmission Distributed Source Coding (DSC) scheme is proposed for practical DVC scheme based on Low-Density Parity-Check (LDPC) codes because DVC system is an specific application of DSC system. This DSC scheme is achieved by using different LDPC codes optimized in each different compression rate and using source revealing scheme. Optimized LDPC codes provide us much better decoding performance which causes the 57% reduced number of iteration. Consequently, the number of feedback retransmission is decreased by 50%.

• Journal of Broadcast Engineering
• /
• v.24 no.1
• /
• pp.25-31
• /
• 2019

360 video is attracting attention as immersive media, and is also considered in VVC (Versatile Video Coding), which is being developed in JVET (Joint Video Expert Team) as a new video coding standard of post-HEVC. A 2D image projected from 360 video for its compression may has discontinuities between the projected faces and inactive regions, and they may cause the visual artifacts in the reconstructed video as well as decrease of coding efficiency. In this paper, we propose a method of efficient geometric padding to reduce these discontinuities and inactive regions in the projection format of SSP (Segmented Sphere Projection). Experimental results show that the proposed method improves subjective quality compared to the existing padding of SSP that uses copy padding with minor loss of coding gain.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.98-106
• /
• 2011

Since prediction processes such as motion estimation motion compensation are not at the WZ video encoder but at its decoder, WZ video compression cannot have better performance than that of conventional video encoder. In order to implement the prediction process with low complexity at the encoder, WZ residual coding was proposed. Instead of original WZ frames, WZ residual coding encodes the residual signal between key frames and WZ frames. Although the proposed WZ residual coding has good performance in pixel domain, it does not have any improvements in transform domain compared to transform domain WZ coding. The WZ residual coding in transform domain is difficult to have better performance, because pre-defined quantization matrices in WZ coding are not compatible with WZ residual coding. In this paper, we propose a new quantization method modifying quantization matrix and quantization step size adaptively for transform domain WZ residual coding. Experimental result shows 22% gain in BDBR and 1.2dB gain in BDPSNR.

• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.283-294
• /
• 2022

The feature map used in the network for deep learning generally has larger data than the image and a higher compression rate than the image compression rate is required to transmit the feature map. This paper proposes a method for transmitting a pyramid feature map with high compression rate, which is used in a network with an FPN structure that has robustness to object size in deep learning-based image processing. In order to efficiently compress the pyramid feature map, this paper proposes a structure that predicts a pyramid feature map of a level that is not transmitted with pyramid feature map of some levels that transmitted through the proposed prediction network to efficiently compress the pyramid feature map and restores compression damage through the proposed reconstruction network. Suggested mAP, the performance of object detection for the COCO data set 2017 Train images of the proposed method, showed a performance improvement of 31.25% in BD-rate compared to the result of compressing the feature map through VTM12.0 in the rate-precision graph, and compared to the method of performing compression through PCA and DeepCABAC, the BD-rate improved by 57.79%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1325-1341
• /
• 1998

A conventional CBR channel is now capable of delivering several digitally compressed video programs due to recent advances in video compression, such as MPEG-2, and digital transmission technology. This paper presents a joint video coding scheme that is to maintain a constant sum of bit rates for all the programs but to allow the variable bit rate for individual program in the transimission environment mentioned above. Thus advantages of VBR video compression can be obtained. This paper contributes in two aspects. First, a rate-distortion estimation method for MPEG-2 video is proposed, which enavle us predict the amount of bits and the distortion generated from an encoded picture at a given quantization step size and vice versa. The most attractive features of the proposed rate-distortion estimation method are its accuracy and a computational complexity low enough to be applied to real-time video coding applications. Second, this paper presents an efficient and accurate joint rate control scheme using the rate-distortion estimation results and verifies its performance with experiments. The experimental results show that our coding scheme gives a significant gain even though a small number of video programs are coded jointly. For example, a stable picture quality is maintained among the video programs as well as within a program, and additional extra programs can be transmitted over the same channel bandwidth if the proposed joint video coding scheme is used.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.132-140
• /
• 2007

In this paper, we proposed a new technique to encode and decode the digital hologram. Since the digital hologram (or fringe pattern) is generated by interference of light, it has much different property from natural 2D (2 dimensional) images. First, we acquisite optical-sensed or computer-generated hologram by digital type, and then extract a chrominance component. The extracted digital hologram for coding is separated into segments to use multi-view properties. The segmented hologram shows the similar characteristics with picturing an object with 2D cameras in various point of view. Since fringe pattern is visually observed like as noise, we expect that the fringe pattern has poor coding efficiency. To obtain high efficiency, the segment is transformed with DCT (Discrete Cosine Transform) which resembles hologram generation process with high performance. Each transformed segment passes the 3D scanning process according to time and spatial correlation, and is organized into a video stream. Since the segment which correspond to frame of a video stream consists of the transformed coefficients with wide range of value, it is classified and re-normalized. Finally it is compressed with coding tools. The proposed algorithm illustrated that it has better properties for reconstruction of 16 times higher compression rate than the previous researches.