• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.56-62
• /
• 2009

In H.264/AVC, rate distortion optimization algorithm is used to decide the best block mode from various block modes. It improves a bit rate but greatly increases an amount of computation. This paper proposes a fast rate distortion optimization algorithm that omits a rate distortion optimization adaptively by predicting its cost from the cost calculated for motion estimation. The simulation results show that the proposed algorithm, on average, keeps nearly the image quality and the bit rate made by the rate distortion optimization while reduces 69.86% and 69.63% of computation added by it in CIF and QCIF respectively.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.596-610
• /
• 2007

In order to reduce the complexity of SVC encoding, we introduce a fast mode decision method in the enhancement layers of spatial scalability by selectively performing the inter-layer residual prediction of SVC. The Inter-layer residual prediction coding in Scalable Video Coding has a large advantage of enhancing the coding efficiency since it utilizes the correlation between two residuals from a lower spatial layer and its next higher spatial layer. However, this entails the dramatical increase in the complexity of SVC encoders. The proposed method is to analyze the characteristics of integer transform coefficients for the subtracted signal for two residuals from lower and upper spatial layers. Then it selectively performs the inter-layer residual prediction coding and rate-distortion optimizations in the upper spatial enhancement layer if the SAD values of residuals exceed adaptive threshold values. Therefore, by classifying the residuals according to the properties of integer-transform coefficients only with SAD of residuals between two layers, the SVC encoder can perform the inter-layer residual coding selectively, thus significantly reducing the total required encoding time. The proposed method results in reduction of the total encoding time with 51.5% in average while maintaining the RD performance with negligible amounts of quality degradation.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.345-354
• /
• 2005

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.4
• /
• pp.167-176
• /
• 2009

In this paper, we propose an improved SHACAL-1 of the same encryption and decryption with a simple symmetric layer. SHACAL-1 has 4 rounds, and each round has 20 steps. Decryption is becoming inverse function of encryption, In this paper, we proposed SHACAL-1 are composed of the first half, symmetry layer and the last half. The first half with SHACAL-1 encryption algorithm 1 round does with 10 steps and composes of 4 round. The last half identically with SHACAL-1 decryption algorithm, has a structure. On the center inserts a symmetry layer, encryption and decryption algorithm identically, composes. In the experiments, the proposed SHACAL-1 algorithm showed similar execution time to that of the SHACAL-1. Thanks to the symmetric layer, the proposed algorithm makes it difficult for the attacks which take advantages of high probability path such as the linear cryptanalysis, differential cryptanalysis. The proposed algorithm can be applicable to the other block cipher algorithms which have different encryption and decryption and useful for designing a new block cipher algorithm.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.58-65
• /
• 2007

This dissertation proposes digital video protection algorithm lot moving image based on MPEG. Shuffling-based encryption algorithms using a fixed random shuffling table are quite simple and effective but vulnerable to the chosen plaintext attack. To overcome this problem, it is necessary to change the key used for generation of the shuffling table. However, this may pose a significant burden on the security key management system. A better approach is to generate the shuffling table based on the local feature of an image. In order to withstand the chosen plaintext attack, at first, we propose a interleaving algorithm that is adaptive to the local feature of an image. Secondly, using the multiple shuffling method which is combined interleaving with existing random shuffling method, we encrypted the DPCM processed 8*8 blocks. Experimental results showed that the proposed algorithm needs only 10% time of SEED encryption algorithm and moreover there is no overhead bit. In video sequence encryption, multiple random shuffling algorithms are used to encrypt the DC and AC coefficients of intra frame, and motion vector encryption and macroblock shuffling are used to encrypt the intra-coded macroblock in predicted frame.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.391-396
• /
• 2013

In this paper, for HEVC decoding, an SAO hardware design with less processing time and reduced area is proposed. The proposed SAO hardware architecture introduces the design processing $8{\times}8$ CU to reduce the hardware area and uses internal registers to support $64{\times}64$ CU processing. Instead of previous top-down block partitioning, it uses bottom-up block partitioning to minimize the amount of calculation and processing time. As a result of synthesizing the proposed architecture with TSMC $0.18{\mu}m$ library, the gate area is 30.7k and the maximum frequency is 250MHz. The proposed SAO hardware architecture can process the decode of a macroblock in 64 cycles.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.2
• /
• pp.27-34
• /
• 2017

For The Purpose of Pursuing the Simplest Sampling, a Motion Compensated Block Compressed Sensing with Smoothed Projected Landweber (MC-BCS-SPL) has been Studied for an Effective Scheme of Distributed Compressive Video Sensing with all Compressed Sensing (CS) Frames. However, Conventional MC-BCS-SPL Scheme is Very Simple and so it Does not Provide Good Visual Qualities in Reconstructed Wyner-Ziv (WZ) Frames. In this Paper, the Conventional Scheme of MC-BCS-SPL is Modified to Provide Better Visual Qualities in WZ Frames. That is, the Proposed Agorithm is Designed in such a way that the Reference Frame may be Adaptively Selected Based on the Temporal Correlation Between Successive Frames. Several Experimental Results show that the Proposed Algorithm Provides Better Visual Qualities than Conventional Algorithm.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.133-143
• /
• 2011

In this paper, a complexity-balancing algorithm is proposed for distributed video coding based on entropy coding. In order to reduce complexity of DVC-based decoders, the proposed method employs an entropy coder instead of channel coders and the complexity-balancing method is designed to improve RD performance with minimal computational complexity. The proposed method performs motion estimation in the decoder side and transmits the estimated motion vectors to the encoder. The proposed encoder can perform more accurate refinement using the transmitted motion vectors from the decoder. During the motion refinement, the optimal predicted motion vectors are decided by the received motion vector and the predicted motion vectors and complexity load of block is allocated by adjusting the search range based on the difference between the received motion vector and the predicted motion vectors. The computational complexity of the proposed encoder is decreased 11.9% compared to the H.264/AVC encoder and that of the proposed decoder are reduced 99% compared to the conventional DVC decoder.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.353-361
• /
• 2020

VVC (Versatile Video Coding) is a new video compression technique that is being standardized, and it supports HD / UHD / 8K video, and High Dynamic Range (HDR) video with a goal of approximately 2 times higher coding efficiency than the conventional HEVC. It also aims to support a variety of functionalities such as screen content coding, adaptive resolution changes, and independent sub-pictures. In this paper, we investigate the signaling process of intra prediction mode first, and develop an effective coding method of the chroma intra prediction mode. In case of the DM mode, the proposed method simplifies the prediction mode of the chorma intra prediction mode when referring to the angular mode of the luminance block. It can improve coding efficiency of the chroma intra prediction mode, and the proposed process can also consider the size of the block in order to further improve its coding efficiency.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.676-683
• /
• 2012

Motion estimation in video coding greatly affects implementation complexity. In this paper, a reducing method of the complexity in motion estimation is proposed by using both the depth and color cameras. We obtain object information with video sequence from distance information calculated by depth camera, then perform labeling for grouping pixels within similar distances as the same object. Three search regions (background, inside-object, boundary) are determined adaptively for each of motion estimation blocks within current and reference pictures. If a current block is the inside-object region, then motion is searched within the inside-object region of reference picture. Also if a current block is the background region, then motion is searched within the background region of reference picture. From simulation results, we can see that the proposed method compared to the full search method remains the almost same as the motion estimated difference signal and significantly reduces the searching complexity.