• Title/Summary/Keyword: 영상압축표준

Search Result 489, Processing Time 0.022 seconds

A Center Biased Cross-Diamond Search Algorithm for Fast Fractional-pel Motion Estimation (고속 부화소 움직임 추정을 위한 중심 지향적 십자 다이아몬드 탐색 알고리즘)

  • Jo, Seong-Hyeon;Lee, Jong-Hwa
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.2
    • /
    • pp.78-84
    • /
    • 2009
  • In general video coding systems, motion estimation (ME) is regarded as a vital component in a video coder as it consumes a large amount of computation resources. Fractional pixel motion estimation can improve the video compression rate at the cost of higher computational complexity. It is based on the experimental results that the sum of absolute differences (SAD) shows parabolic shape and thus can be approximated by using interpolation technique. In this paper, we propose a fast fractional pixel search algorithm by combining SASR (Simplified Adaptive Search Range) and the CBCDS (Center Biased Cross-Diamond Search) pattern with the predicted motion vector. Compare with the fractional pel full search and the CBFPS, the proposed CBCDS algorithms can reduce fractional pel search points up to 81.4%, respectively with the PSNR lost about 0.05dB.

In-Loop Selective Decontouring Algorithm in Video Coding (비디오 부호화 루프 내에서 의사 윤곽 오차의 선택적 제거 알고리즘)

  • Yoo, Ki-Won;Sohn, Kwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.697-702
    • /
    • 2010
  • Contour artifact is known as the unintentional result of quantizing a flat area that has smooth gradients. In this letter, a decontouring algorithm is proposed to efficiently remove false contours that occur in typical block-based video coding applications. First, the algorithm goes through a refinement stage to determine candidate blocks probably having noticeable false contours with different kinds of features in a block. Then, pseudo-random noise masking is applied to those blocks to mitigate the contour artifacts. This block-based selective decontouring can efficiently remove the unnecessary processing of those blocks that have no false contour, which incidentally ensures a minor penalty in visual quality and computational complexity. The proposed algorithm was demonstrated, integrated into H.264/AVC, that visual quality can be significantly enhanced with an ignorable rate-distortion (RD) loss and an minor increase in computational complexity.

The Efficient 32×32 Inverse Transform Design for High Performance HEVC Decoder (고성능 HEVC 복호기를 위한 효율적인 32×32 역변환기 설계)

  • Han, Geumhee;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.953-958
    • /
    • 2013
  • In this paper, an efficient hardware architecture is proposed for $32{\times}32$ inverse transform HEVC decoder. HEVC is a new image compression standard to deal with much larger image sizes compared with conventional image codecs, such as 4k, 8k images. To process huge image data effectively, it adopts various new block structures. Theses blocks consists of $4{\times}4$, $8{\times}8$, $16{\times}16$, and $32{\times}32$ block. This paper suggests an effective structures to process $32{\times}32$ inverse transform. This structure of inverse transform adopts the decomposed $16{\times}16$ matrixes of $32{\times}32$ matrix, and simplified the operations by implementing multiplying with shifters and adders. Additionally the operations frequency is downed by using multicycle paths. Also this structure can be easily adopted to a multi-size transform or a forward transform block in HEVC codec.

Design of A Deblocking Filter Based on Macroblock Overlap Scheme for H.264/AVC (H.264/AVC용 매크로블록 겹침 기법에 기반한 디블록킹 필터의 설계)

  • Kim, Won-Sam;Sonh, Seung-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.699-706
    • /
    • 2008
  • H.264/AVC is a new international standard for the compression of video images, in which a deblocking filter has been adopted to remoye blocking artifacts. This paper proposes an efficient architecture of deblocking filter in H.264/AVC. By making good use of data dependence between neighboring $4{\times}4$ blocks, the memory sire is reduced and the throughput of the deblocking filter processing is increased. The designed deblocking filter further enhances the parallelism by simultaneously executing horizontal and vertical filtering within a macroblock in pipeline method and adopting overlap between macroblocks. The implementation result shows that the proposed architecture enhances the performance of deblocking filter processing from 1.75 to 4.23 times than that of the conventional deblocking filter. Hence the Proposed architecture of deblocking filter is able to perform real-time deblocking in high-resolution($2048{\times}1024$) video applications.

Investigating the Characteristics of Policy Information Resources for Activating Policy Information Services (정책정보서비스 활성화를 위한 정책정보 자료원의 특성 연구)

  • Lee, Myeong-Hee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.53 no.1
    • /
    • pp.33-55
    • /
    • 2019
  • Knowledge information resources produced by policy research institutes were categorized into knowledge information resources derived from research processes, knowledge information resources derived from research results, and knowledge information resources processed from research results, respectively. The names of these knowledge information resources and the metadata items were investigated on 13 policy research institute websites. In addition, the study examined the provision status of 8 Knowledge information resources specialized by type on the websites and confirmed that they work as knowledge resource management systems for each corresponding area. The results of the study suggest constructing a collective search system for research results based on the same research topics, developing a knowledge map of policy information, compressing reports for policy makers, building subject expert databases, producing video reports, developing metadata standards, and creating statistical databases and indicators by subject areas.

Fast Intra-Mode Decision for H.264/AVC using Inverse Tree-Structure (H.264/AVC 표준에서 역트리 구조를 이용하여 고속으로 화면내 모드를 결정하는 방법)

  • Ko, Hyun-Suk;Yoo, Ki-Won;Seo, Jung-Dong;Sohn, Kwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.13 no.3
    • /
    • pp.310-318
    • /
    • 2008
  • The H.264/AVC standard achieves higher coding efficiency than previous video coding standards with the rate-distortion optimization (RDO) technique which selects the best coding mode and reference frame for each macroblock. As a result, the complexity of the encoder have been significantly increased. In this paper, a fast intra-mode decision algorithm is proposed to reduce the computational load of intra-mode search, which is based on the inverse tree-structure edge prediction algorithm. First, we obtained the dominant edge for each $4{\times}4$ block from local edge information, then the RDO process is only performed by the mode which corresponds to dominant edge direction. Then, for the $8{\times}8$ (or $16{\times}16$) block stage, the dominant edge is calculated from its four $4{\times}4$ (or $16{\times}16$) blocks' dominant edges without additional calculation and the RDO process is also performed by the mode which is related to dominant edge direction. Experimental results show that proposed scheme can significantly improve the speed of the intra prediction with a negligible loss in the peak signal to noise ratio (PSNR) and a little increase of bits.

Region Selective Transmission Method of MMT based 3D Point Cloud Content (MMT 기반 3차원 포인트 클라우드 콘텐츠의 영역 선별적 전송 방안)

  • Kim, Doohwan;Kim, Junsik;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.25-35
    • /
    • 2020
  • Recently, the development of image processing technology, as well as hardware performance, has been continuing the research on 3D point processing technology that provides users with free viewing angle and stereoscopic effect in various fields. Point cloud technology, which is a type of representation of 3D point, has attracted attention in various fields because it can acquired/expressed point precisely. However, since Hundreds of thousands, millions of point are required to represent one 3D point cloud content, there is a disadvantage that a larger amount of storage space is required than a conventional 2D content. For this reason, the MPEG (Moving Picture Experts Group), an international standardization organization, is continuing to research how to efficiently compress, store, and transmit 3D point cloud content to users. In this paper, a V-PCC bitstream generated by a V-PCC (Video-based Point Cloud Compression) encoder proposed by the MPEG-I (Immersive) group is composed of an MPU (Media Processing Unit) defined by the MMT. In addition, by extending the signaling message defined in the MMT standard, a parameter for a segmented transmission method of the 3D point cloud content by area and quality parameters considering the characteristic of the 3D point cloud content, so that the quality parameters can be selectively determined according to the user's request. Finally, in this paper, we verify the result through design/implementation of the verification platform based on the proposed technology.

Optimized Hardware Design of Deblocking Filter for H.264/AVC (H.264/AVC를 위한 디블록킹 필터의 최적화된 하드웨어 설계)

  • Jung, Youn-Jin;Ryoo, Kwang-Ki
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.1
    • /
    • pp.20-27
    • /
    • 2010
  • This paper describes a design of 5-stage pipelined de-blocking filter with power reduction scheme and proposes a efficient memory architecture and filter order for high performance H.264/AVC Decoder. Generally the de-blocking filter removes block boundary artifacts and enhances image quality. Nevertheless filter has a few disadvantage that it requires a number of memory access and iterated operations because of filter operation for 4 time to one edge. So this paper proposes a optimized filter ordering and efficient hardware architecture for the reduction of memory access and total filter cycles. In proposed filter parallel processing is available because of structured 5-stage pipeline consisted of memory read, threshold decider, pre-calculation, filter operation and write back. Also it can reduce power consumption because it uses a clock gating scheme which disable unnecessary clock switching. Besides total number of filtering cycle is decreased by new filter order. The proposed filter is designed with Verilog-HDL and functionally verified with the whole H.264/AVC decoder using the Modelsim 6.2g simulator. Input vectors are QCIF images generated by JM9.4 standard encoder software. As a result of experiment, it shows that the filter can make about 20% total filter cycles reduction and it requires small transposition buffer size.

De-blocking Filter for Improvement of Coding Efficiency and Computational Complexity Reduction on High Definition Video Coding (고화질 비디오의 부호화 효율성 증대와 연산 복잡도 감소를 위한 디블록킹 필터)

  • Jung, Kwang-Su;Nam, Jung-Hak;Jo, Hyun-Ho;Sim, Dong-Gyu;Oh, Seoung-Jun;Jeong, Sey-Yoon;Choi, Jin-Soo
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.513-526
    • /
    • 2010
  • In this paper, we propose a de-blocking filter for improvement of coding efficiency and computational complexity reduction on a high definition video coding. Recently, the H.264/AVC standard-based research for high definition video coding method is under way because the amount of used of high definition videos is on the increase. The H.264/AVC de-blocking filter is designed for low bitrate video coding and it improves not only the subjective quality but also coding efficiency by minimizing the blocking artifact. However, the H.264/AVC de-blocking filter that strong filtering is performed is not suitable in a high definition video coding which occurs relatively low blocking artifact. Also, the conventional de-blocking filter has high computational complexity in decoder side. The computational complexity of the proposed method is reduced about maximum 8.8% than conventional method. Furthermore, the coding efficiency of the proposed method is about maximum 7.3% better than H.264/AVC de-blocking filter.

ROUTE/DASH-SRD based Point Cloud Content Region Division Transfer and Density Scalability Supporting Method (포인트 클라우드 콘텐츠의 밀도 스케일러빌리티를 지원하는 ROUTE/DASH-SRD 기반 영역 분할 전송 방법)

  • Kim, Doohwan;Park, Seonghwan;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.24 no.5
    • /
    • pp.849-858
    • /
    • 2019
  • Recent developments in computer graphics technology and image processing technology have increased interest in point cloud technology for inputting real space and object information as three-dimensional data. In particular, point cloud technology can accurately provide spatial information, and has attracted a great deal of interest in the field of autonomous vehicles and AR (Augmented Reality)/VR (Virtual Reality). However, in order to provide users with 3D point cloud contents that require more data than conventional 2D images, various technology developments are required. In order to solve these problems, an international standardization organization, MPEG(Moving Picture Experts Group), is in the process of discussing efficient compression and transmission schemes. In this paper, we provide a region division transfer method of 3D point cloud content through extension of existing MPEG-DASH (Dynamic Adaptive Streaming over HTTP)-SRD (Spatial Relationship Description) technology, quality parameters are further defined in the signaling message so that the quality parameters can be selectively determined according to the user's request. We also design a verification platform for ROUTE (Real Time Object Delivery Over Unidirectional Transport)/DASH based heterogeneous network environment and use the results to validate the proposed technology.