• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.43-46
• /
• 2021

최근 기계 임무수행에 사용되는 데이터양이 증가함에 따라 기계를 위한 효율적인 영상 압축방식의 필요성이 높아졌다. 기존의 비디오 코덱은 HVS (Human Visual System) 특성을 고려한 기술이기 때문에 부호화 과정에서 기계 임무수행에 필요하지 않은 정보를 효과적으로 제거할 수 없다. 반면 심층신경망 기반 압축네트워크의 경우, 원본 영상으로부터 기계 임무수행에 필수적인 데이터만을 추출하여 부호화 하도록 학습할 수 있는 장점이 있다. 본 논문에서는 압축 심층신경망과 기계 임무수행 네트워크로 구성되는 VCM (Video Coding for Machine) 프레임워크를 제안하고 학습에 의한 압축효율 향상을 검증한다. 이를 위해 압축 심층신경망을 객체탐지 임무수행 네트워크와 함께 학습시킨 결과, VVC (Versatile Video Coding) 대비 평균 61.16%의 BD-rate 감소가 확인되었다. 뿐만 아니라, 학습된 압축 심층신경망은 객체분할 임무수행에서도 VVC 대비 평균 58.43%의 BD-rate 감소를 보여 다중 기계 임무의 효율적 수행이 가능함을 확인할 수 있었다.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.297-300
• /
• 2007

Due to its impressive compression performance, the H.264 video coder is highlighted in the video communications industry, such as DMB (Digital Multimedia Broadcasting), PMP (Portable Multimedia Player), etc. The main bottleneck to use the H.264 coder lays in the computational complexity, i.e. five times more complex than the market leading MPEG-4 Simple Profile codec. In this paper, we propose the hierarchical mode decision method for intraframe coding for the reduction of the computation complexity of the encoder. By determining the mode group early, the propose algorithm can skip the computationally demanding computation in the mode decision. The proposed algorithm is composed of three steps: $16{\times}16$ mode decision, $4{\times}4$ mode-group decisions, and final mode decision among the selected mode group. The simulation results show that the proposed algorithm achieves 20% to 50% reduction in the computational complexity compared with the conventional algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.119-126
• /
• 2013

Achieve real-time encryption and video data transcoding, current video encryption methods usually integrate encryption algorithm with video compression course. This paper is devoted to discussing the video encryption technology, by encrypting to avoid unauthorized person getting video data. This paper studied the H.264 entropy coding and proposed of CAVLC video encryption scheme which is combined with the process of entropy coding of H.264 CAVLC encryption scheme. Three encryption levels are proposed. In addition, a scrambling method is also proposed which makes the encrypted frames more robust in anti crack. This method showed more robust video data encryption function and compressive rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.591-601
• /
• 2002

Motion compensation is a powerful method to compress an image sequence. Its main drawback is that once an error is occurred, the error propagates through the frames. Recently, the intra update method was proposed to stop the error propagation at the expense of reduction in compression efficiency. This paper proposes an intra update method based on a rate-distortion optimization in error prone environments. The rate and the distortion are estimated using the Lagrangian optimization to select the coding mode and the quantization step size. The proposed method is applied to MPEG-4 codec, and the experimental results show that it is robust to the error such as packet losses comparing with the conventional ones.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.252-261
• /
• 2012

This papers proposes a motion vector coding method which selects the optimal predictive motion vector after excluding some candidate predictive motion vectors in the minimum rate-distortion sense, and prunes the candidate predictive motion vectors by a contradiction testing that operates under a predefined criterion at both encoder and decoder for reducing the signaling information. Experimental results show that the proposed method gains in BDBR by up to 1.8% compared to the H.264/AVC.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.238-247
• /
• 2002

In this paper, we propose an object-based stereo sequence compression technique using disparity-motion vector relationship. The proposed method uses the coherence of motion vectors and disparity vectors in the left and right Image sequences. After two motion vectors and one disparity vector ate computed using FBMA(Fixed Block Matching Algorithm), the disparity vector of the current stereoscopic pall is computed by disparity-motion vector relationship with vectors which are previously estimated. Moreover, a vector regularization technique is applied in order to obtain reliable vectors. For an object-based coding. the object is defined and coded in terms of layers of VOP such as in MPEG-4. we present a method using disparity and motion vector relationship for extending two-frame compensation into three-frame compensation method for prediction coding of B-VOP. The proposed algorithm shows a high performance when comparing with a conventional method.

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.142-150
• /
• 2004

MPEG-4 AVC is an international video coding standard that is being developed. The standardization is mainly targeted at a very high compression ratio. MPEG-4 AVC is a general video coding technology that may be used in various applications. Therefore, MPEG-4 AVC needs an efficient rate control method to be applied in various communication environments. This paper is based on the rate control method that considers human visual characteristic. In this paper, we propose the constant bit rate control method using adaptive quantization and scene change detection. Experiments performed using various test images and experimentation results exhibits a favorable performance over existing rate control methods.

• The Journal of the Acoustical Society of Korea
• /
• v.8 no.4
• /
• pp.74-82
• /
• 1989

In this paper, we have studied on the methodologies of implementation and the performance evaluations about the real-time packetized coding of multi-channel speech signals. Our suggested coding algorithm is very, simple and it has majorly the data handling operations rather than the numerical calculations. And it gives about $40\%$ of compression ratio with less than the conventional codings. Nevertheless, using this algorithm, we can save the memories for the speech signal and we can raise the efficiency of the channel transmission. Especially because of its simplicity of algorithm, we can easily obtain the merits of the multi-channel operations.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.193-198
• /
• 2009

The H.264/ AVC video coding standard supports the intra prediction with various block sizes for luma component and a 8x8 block size for chroma components. This new feature of H.264/AVC offers a considerably higher improvement in coding efficiency compared to previous compression standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intra prediction mode for each block size, and it brings about the drastic increase of the computation complexity of H.264 encoder. In this paper, a fast block size decision algorithm is proposed to reduce the computation complexity of the intra prediction in H.264/AVC. The proposed algorithm computes the smoothness based on AC and DC coefficient energy for macroblocks and compares with the nonparametric criteria which is determined by considering information on neighbor blocks already reconstructed, so that deciding the best probable block size for the intra prediction. Also, the use of non-parametric criteria makes the performance of intra-coding not be dependent on types of video sequences. The experimental results show that the proposed algorithm is able to reduce up to 30% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1329-1336
• /
• 1996

In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.