• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.307-315
• /
• 2014

A new modified lossless intra-coding method based on a cross residual transform is applied to HEVC(High Efficiency Video Coding). The HEVC standard including a multi-directional spatial prediction method to reduce spatial redundancy encodes the pixels in a PU (Prediction Unit) by using neighboring pixels. In the new modified lossless intra-coding method, the spatial prediction is performed by pixel-based DPCM but is implemented by block-based manner by using cross residual transform on the HEVC standard. The experimental results show that the new lossless intra-coding method reduces the bit rate of approximately 8.4% in comparison with the lossless-intra coding method in the HEVC standard and the proposed method results in slightly better compression ratio than the JPEG2000 lossless coding.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.29-37
• /
• 2008

To transmit video bit stream over low bandwidth such as wireless channel, high compression algorithm like H.264 codec is exploited. In transmitting high compressed video bit-stream over low bandwidth, packet loss causes severe degradation in image quality. In this paper, a new algorithm for recovery of missing or erroneous motion vector is proposed. Considering that the missing or erroneous motion vectors in blocks are closely correlated with those of neighboring blocks. Motion vector of neighboring blocks are clustered according to average linkage algorithm clustering and a representative value for each cluster is determined to obtain the candidate motion vector sets. As a result, simulation results show that the proposed method dramatically improves processing time compared to existing H.264/AVC. Also the proposed method is similar to existing H.264/AVC in terms of visual quality.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.808-815
• /
• 2013

In this paper, we propose a novel fast and low-complexity Motion Estimation (ME) algorithm for Ultra High Definition (UHD) High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of video codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. We analyze the previous motion estimation algorithms and propose three optimal algorithm to reduce the computation proportion for HEVC. The proposed algorithm uses only 0.36% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 1.1%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.57-61
• /
• 2015

This paper proposes a fast intra prediction algorithm for the High Efficiency Video Coding (HEVC). HEVC has 35 modes, such as DC mode, Planar mode, and 33 angular modes for the intra-prediction. To reduce the complexity and to support fast decision for intra prediction, this paper proposes a hierarchical mode decision method (HMD). The proposed HMD mainly focuses on how to reduce the number of prediction modes. The experimental results show that the proposed HMD can reduce the encoding time about 39.17% with little BDBR loss. On average, the proposed HMD can achieve the encoding time saving e about 14.13 ~ 19.37% compared to that of the existing algorithms with slightly increasing 0.01 ~ 0.42% BDBR.

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.473-480
• /
• 2003

In this paper, we propose a new quadtree coding a1gorithm to improve the performance of the old one. The new algorithm can process any frame of size in standard and reduce encoding and decoding time by decreasing computational load. It also improves the image quality comparing with any old quantizer based on quadtree and zerotree structure. In order for the new algorithm to be applied for real video codec, we analyze the statistical characteristics of coefficients of differential image and add a function that makes It deal with an arbitrary size of image by using new technique while the old one process by block unit. We can also improve the image quality by scaling the coefficient's value from a differential image. By comparing the performance of the new algorithm with quadtree and SPIHT, it Is shown that PSNR is improved, that the computational load is not reduced in encoding and decoding.

• Journal of Broadcast Engineering
• /
• v.25 no.6
• /
• pp.1013-1016
• /
• 2020

This paper presents a selective encryption and decryption method exploiting the start code of the IVC bitstream. The existing encryption methods for video are largely classified into two methods: Naive Encryption Algorithm (NEA) and Selective Encryption Algorithm (SEA). Since NEA encrypts the entire bitstream, it has the advantage of high security but has the disadvantage of high computational complexity. SEA improves the encryption and decryption speed compared to NEA by encrypting a part of the bitstream, but there is a problem that security is relatively low. The proposed method improves the encryption and decryption speed and the security of the existing SEA by using the start code of the IVC bitstream. As a result of the experiment, the proposed method reduces the encryption speed by 96% and the decryption speed by 98% on average compared to the NEA.

• Journal of Broadcast Engineering
• /
• v.26 no.6
• /
• pp.778-789
• /
• 2021

Recently, various lightweight methods for using Convolutional Neural Network(CNN) models in mobile devices have emerged. Weight quantization, which lowers bit precision of weights, is a lightweight method that enables a model to be used through integer calculation in a mobile environment where GPU acceleration is unable. Weight quantization has already been used in various models as a lightweight method to reduce computational complexity and model size with a small loss of accuracy. Considering the size of memory and computing speed as well as the storage size of the device and the limited network environment, this paper proposes a method of compressing integer weights after quantization using a video codec as a method. To verify the performance of the proposed method, experiments were conducted on VGG16, Resnet50, and Resnet18 models trained with ImageNet and Places365 datasets. As a result, loss of accuracy less than 2% and high compression efficiency were achieved in various models. In addition, as a result of comparison with similar compression methods, it was verified that the compression efficiency was more than doubled.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.200-201
• /
• 2010

블록 기반의 적응적 루프 필터(BALF : Block Adaptive Loop Filter)는 압축 성능에 있어서 상당히 높은 효율을 보이는 기술 중 하나이다. BALF는 복원된 영상을 원본 영상에 최대한 유사하게 만드는 Weiner 필터계수와 해당 필터가 적용될 영역에 대한 정보를 복원된 영상에 적용함으로써 화질을 높일 수 있다. 그러나 BALF는 단위블록 전체에 대해 하나의 필터를 생성하여 적용하는 방법으로, 블록 내부에서 구분되는 신호적 특성을 따로 분류하지 않는다. 그러므로 BALF는 높은 부호화 성능을 보이는 반면, 높은 복호화 복잡도를 요구한다는 단점이 있다. 본 논문에서는 필터가 적용될 블록을 내부와 경계 영역으로 나누어 경계 영역을 위한 필터를 구분하여 생성하는 루프필터를 제안한다. 제안하는 알고리즘은 기존의 BALF에 비해 부호화 성능이 저하되지만, 필터를 적용할 영역을 선택 가능하게 함으로써 복호화 복잡도를 조절할 수 있도록 하였다. 제안한 방법의 실험결과, 기존의 방법인 BALF에 대하여 블록의 경계 영역 필터를 사용할 경우, 약 3.77%의 부호화 성능 저하에 대하여 약 33.76%의 필터링 속도 향상을 보였다.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.503-504
• /
• 2008

최근 정보통신 기술들이 빠르게 발전하고 있다. 다양한 통신 기술들 중에서도 업무의 효율을 높이고자 회사 및 가정, 학교 등에서 자주 사용되고 있는 영상채팅시스템을 구현해보고자 한다. 쿼타임 코덱 중 가장 보편적인 코덱으로 인코딩이 쉽고 저사양의 CPU만으로도 실시간 스트리밍이 가능한 H.263 코덱을 사용하여 영상채팅시스템을 Visual C++로 구현을 하였다. 전송로의 지연을 줄이기 위하여 영상, 음성, 텍스트 등을 압축하고 복원하는 데 걸리는 시간을 최소화기 위하여 데이터의 전송대역폭을 적절히 조절하는 알고리듬을 제안하여 전송지연을 최소화하였다. 또한 P2P 방식을 사용하여 다양한 영상 환경에 대하여 영상 및 텍스트 데이터의 안정성과 화질이 우수함을 보였으며, 실시간 가스안전관리 상담에 이용하여 업무의 효율을 높이고자 한다.