• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.123-132
• /
• 2011

Recently, DVC (Distributed Video Coding) is receiving a lot of attention as one of the low complexity video encoding techniques suitable for various applications with computation-limited and/or power-limited environment, and is being actively studied for improving the coding efficiency. This paper proposes a rate-distortion based selective block encoding scheme. First, the motion information is obtained in the process of generating side information at decoder and received through the feedback channel, and then, based on this information, the proposed method performs a selective block encoding based on rate-distortion optimization. Experimental results show that the performance of the proposed scheme reaches up to 2.2 dB PSNR gain over the existing scheme. Moreover, it is shown that the complexity can be reduced by encoding parts of region considering rate-distortion cost.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.258-262
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm could improve approximately 37.5% in coding efficiency, compared with an existing memory reduction algorithm, at the same memory reduction rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.949-952
• /
• 2009

In this paper, a watermarking method based on the trellis code with multi-layer is proposed. An image is divided $8{\times}8$ block with no overlapping, and compute the discrete cosine transform(DCT) of each block, and the 12 medium-frequency AC terms from each block are extracted. Next it is compared with gaussian random vectors with zero mean and unit variance. As these processing, the embedding vectors with minimum linear correlation can be obtained by Viterbi algorithm at each layer of trellis coding. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.7
• /
• pp.515-521
• /
• 2022

In this paper, we propose Quad BTC that compresses DSM files to allow random access for TRF (Terrain Referenced Flight). The terrain data used for TRF has a large data capacity to be stored in the UAV (Unmanned Aerial Vehicle), so its size must be reduced through compression. Conventional BTC (Block Truncation Coding) based compression methods are suitable for TRF because it can decode randomly accessing specific coordinates. However, These conventional methods have a problem that the error increases because the deviation of the data increases as the size of the block increases. In this paper, we propose Quad BTC method that adaptively divides a block in to 4 sub blocks and compresses to solve this problem. The proposed method may reduce errors because the size of the sub block can be adjusted within the block. Through simulation using actual terrain data, it is verified that Quad BTC has less error at the same compression ratio than conventional BTC and AM BTC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1066-1072
• /
• 2007

In this paper, we propose a fast multiple reference frame selection method for motion estimation and compensation in video coding. Reference frames selected as an optimal reference frame by variable block sizes motion estimation have the statistical characteristic that was based on block size. Using the statistical characteristic, reference frames for smaller block size motion estimation can be selected from reference frame which was decided as an optimal one for the upper layer block size. Simulation results show that the proposal method decreased the computations about 60%. Nevertheless, PSNR and bit rate were almost same as the performances of original H.264 multiple reference motion estimation.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.317-326
• /
• 2002

The adaptive coding schemes in H.264 standardization provide a significant ceding efficiency and some additional features like error resilience and network friendliness. The variable block size motion compensation using multiple reference frames is one of the key H.264 coding elements to provide main performance gain, but also the main culprit that increases the overall computational complexity. For this reason, this paper proposes a selective motion estimation algorithm based on variable block size for fast motion estimation in H.264. After we find the SAD(Sum of Absolute Difference) at initial points using diamond search, we decide whether to perform additional motion search in each block. Simulation results show that the proposed method is five times faster than the conventional full search in case of search range $\pm$32.

• Proceedings of the KOSOMBE Conference
• /
• v.1993 no.05
• /
• pp.38-41
• /
• 1993

For efficient transmission and storage of digital images, the requirements of image compression is incresing. Because the medical images contain diagnostic information small distortion has been more important factor than the low rate in such images. Generally the distortion in image is the difference of pixel values. However the image is percieved by human visual systems. So it is reasonable that human visual system characteristics be used as criteria of the image compression. In this paper, the Just Noticeable Difference curve is used as criteria of determining the homogeniety of a block and acceptibility of distortions. And Block Truncation Coding using spatial masking effect of eyes is adopted to code the blocks which contain line components. And small blocks which varies slowly can be approximated to polynomial functions successfully. We proposed the hybrid block coding scheme based on the block characteristics and human visual system characteristics. Simulation to several kinds of the medical images using this method showed that medical images can be compressed 5:1 - 10:1 without noticeable distortion.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1480-1490
• /
• 2008

Design of a linear predictor and matching of an entropy coder is the art of lossless audio coding. In this paper, we use the covariance method and the Choleskey decomposition for calculating linear prediction coefficients instead of the autocorreation method and the Levinson-Durbin recursion. These results are compared to the polynomial predictor. Both of them, the predictor which has small prediction error is selected. For the entropy coding, we use the Golomb-Rice coder using the block-based parameter estimation method and the sequential adaptation method with LOCO-land RLGR. The proposed predictor and the block-based parameter estimation have $2.2879%{\sim}0.3413%$ improved compression ratios compared to FLAC lossless audio coder which use the autocorrelation method and the Levinson-Durbin recursion. The proposed predictor and the LOCO-I adaptation method could improved by $2.2879%{\sim}0.3413%$. But the proposed predictor and the RLGR adaptation method got better results with specific signals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.148-155
• /
• 2006

For the improvement of coding efficiency, the H.264 standard uses new coding tools which are not used in previous coding standards. Among new coding tools, motion estimation using smaller block sizes leads to higher correlation between the motion vectors of neighboring blocks. This characteristic of H.264 is useful for the motion vector recovery. In this paper, we propose the motion vector recovery method based on optical flow. Since the proposed method estimates the optical flow velocity vector from more accurate initial value and optical flow region is limited to 16$\times$16 block size, we can alleviate the complexity of computation of optical flow velocity. Simulation results show that our proposed method gives higher objective and subjective video quality than previous methods.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.