• Title/Summary/Keyword: MPEG-4

Search Result 1,149, Processing Time 0.032 seconds

Rate-Distortion Model for HEVC Quadtree Coding (HEVC 쿼드트리 부호화를 위한 율-왜곡 모델)

  • Lee, Bumshik;Kim, Munchurl
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.169-172
    • /
    • 2011
  • 최근 ISO/IEC의 MPEG과 ITU-T의 VCEG이 JCT-VC (Joint Collaborative Team for Video Coding)를 구성하여 HEVC (High Efficiency Video Coding) 차세대 비디오 압축 표준 제정을 위한 작업을 진행 중이다. 과거 압축률이 가장 좋은 것으로 알려진 H.264/AVC 보다 최대 50%까지 부호화 효율 향상을 목표로 하고 있다. HEVC는 H.264/AVC와는 상이한 부호화 구조를 채택하고 있고 작은 크기의 영상뿐만 아니라 크기가 큰 영상까지도 효율적으로 부호화할 수 있도록 설계되고 있다. 예측 및 변환 부호화 과정이 계층적 쿼드트리 구조를 가지며, 특히 변환 부호화는 작은 크기의 변환 블록으로부터 $32{\times}32$ 크기의 변환 블록까지 크게 확장되어 계층적 변환 구조를 이루며 부호화하도록 되어 있다. 본 논문에서는 기존 코덱과는 상이한 부호화 구조를 갖는 쿼드트리 부호화 기반 HEVC 코덱 표준을 위한 율-왜곡 (Rate-Distortion) 모델을 제안한다. 기존의 코덱에서는 부호화되는 기본 단위가 $16{\times}16$로 일정하고, 변환 및 양자화되는 블록의 크기 역시 $4{\times}4$또는 $8{\times}8$ 크기 단위로 그 블록의 크기가 작을 뿐만 아니라 고정된 크기를 사용한다. 따라서 단일 확률 모형을 사용하여 율-왜곡 모델을 만들었으며, 그 정확도 역시 비교적 정확한 결과를 얻었다. 그러나 HEVC에서는 계층적 가변 블록 크기를 갖는 기본 부호화, 예측 및 변환/양자화 기법을 사용하기 때문에 기존의 단일 모델로는 정확한 율-왜곡 모델을 만들어 내기 어렵다. 제안하는 방법은 HEVC의 기본 단위인 CU (Coding Unit)별로 독립적인 확률 모형을 사용하여 율-왜곡모델을 사용하는 것으로 CU의 크기가 가변적이고 CU 내의 텍스처 역시 크기에 따라 매우 다른 특성을 가지고 있기 때문에 단일 모델을 사용하는 것보다 매우 효율적인 것을 실험을 통하여 확인하였다.

  • PDF

A Study on Implementation of XML-Based Information Retrieval System for Video Contents (XML 기반의 동영상콘텐츠 검색 시스템 설계 및 구현)

  • Kim, Yong;So, Min-Ho
    • Journal of the Korean Society for information Management
    • /
    • v.26 no.4
    • /
    • pp.113-128
    • /
    • 2009
  • Generally, a user uses briefly summarized video data and text information to search video contents. To provide fast and accurate search tool for video contents in the process of searching video contents, this study proposes a method to search video clips which was partitioned from video contents. To manage and control video contents and metadata, the proposed method creates structural information based on XML on a video and metadata, and saves the information into XML database. With the saved information, when a user try to search video contents, the results of user's query to retrieve video contents would be provided through creating Xpath which has class structure information. Based on the proposed method, an information retrieval system for video clips was designed and implemented.

Still image comunications on the internet using the wavelet image compression technique (웨이블릿 영상 압축 기법을 이용한 인터넷에서의 정지영상 서비스)

  • 신무균;정제창;김민구
    • Journal of Broadcast Engineering
    • /
    • v.4 no.1
    • /
    • pp.12-21
    • /
    • 1999
  • Without a question. the most significant new medium for transmitting information is the Internet. Unfortunately. the multimedia elements that enrich our titles are extremely bulky. While the Internet hype is available in unlimited supply. Internet bandwidth and functionality of web browser are not making the net quite hospitable to multimedia data formats. In this thesis. for smoother and better communications over the net. a study is done on still image compression techniques. based on wavelet transform which is selected on MPEG-4 as a still image compression standard and a strong candidate for the JPEG-2000 standard. For Internet service. the study of plug-in programming and ActiveX control is implemented to enrich the functionality of web browser. As a result. the proposed still image service gives better image quality than current standard JPEG and does not yield to the common blocking artifacts.

  • PDF

Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping (섹터 매핑 기법을 적용한 효율적인 FTL 알고리듬 설계)

  • Yoon, Tae-Hyun;Kim, Kwang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1418-1425
    • /
    • 2009
  • This paper proposes a novel FTL (Flash Translation Layer) algorithm based on sector-level mapping to reduce the number of total erase operations in flash memory accesses. The proposed algorithm can reduce the number of erase operations by utilizing the sector-level mapping table when writing data at flash memory. Sector-level mapping technique reduces flash memory access time and extendsthe life time of the flash memory. In the algorithm, wear-leveling is implemented by selecting victim blocks having the minimal number of erase operations, when empty spaces for write are not available. To evaluate the performance of the proposed FTL algorithm, experiments were performed on several applications, such as MP3 players, MPEG players, web browsers and document editors. The proposed algorithm reduces the number of erase operations by 72.4% and 61.9%, when compared with well-known BAST and FAST algorithms, respectively.

An Efficient Coding Method for Stereoscopic Videos using HEVC (HEVC를 이용한 양안식 영상의 효율적인 부호화 방법)

  • Hwang, Soo-Jin;Ho, Yo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12C
    • /
    • pp.721-726
    • /
    • 2011
  • The compression performance of HEVC (high efficiency video coding) is improved 40%, compared to H.264/AVC. Since the existing 3D video CODEC is based on H.264/AVC or MPEG-2, we can improve the compression performance when we use the proposed stereoscopic video coding method based on HEVC. Since the stereoscopic video has the temporal and inter-view correlations, the videos of the left and right cameras encode together to improve the performance. Especially, we implemented the proposed technique using HM(HEVC test model) 3.4. To compare the performance of the proposed method, we only compare the right view video which is coded using the inter-view prediction. The proposed method which is considered inter-view correlation is improved the performance which BDBR reduce about 36.24% and BDPSNR increase approximately 1.19 dB compared to the separated-coding method.

Image Segmentation Using Block Classification and Watershed Algorithm (블록분류와 워터쉐드를 이용한 영상분할 알고리듬)

  • Lim, Jae-Hyuck;Park, Dong-Kwon;Won, Chee-Sun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.81-92
    • /
    • 1999
  • In this paper, we propose a new image segmentation algorithm which can be use din object-based image coding applications such as MPGA-4. Since the conventional objet segmentation methods based on mathematical morphology tend to yield oversegmented results, they normally need a postprocess which merges small regions to obtain a larger one. To solve this oversegmentation problem, in this paper, we prosed a block-based segmentation algorithm that can identify large texture regions in the image. Also, by applying the watershed algorithm to the image blocks between the homogeneous regions, we can obtain the exact pixel-based contour. Experimental results show that the proposed algorithm yields larger segments, particularly in the textural area, and reduces the computational complexities.

  • PDF

Propose and Performance Analysis of Turbo Coded New T-DMB System (터보부호화된 새로운 T-DMB 시스템 제안 및 성능 분석)

  • Kim, Hanjong
    • Journal of Digital Convergence
    • /
    • v.12 no.3
    • /
    • pp.269-275
    • /
    • 2014
  • The DAB system was designed to provide CD quality audio and data services for fixed, portable and mobile applications with the required BER below $10^{-4}$. However for the T-DMB system with the video service of MPEG-4 stream, BER should go down $10^{-8}$ by adding FEC blocks which consist of the Reed-Solomon (RS) encoder/decoder and convolutional interleaver/deinterleaver. In this paper we propose two types of turbo coded T-DMB system without altering the puncturing procedure and puncturing vectors defined in the standard T-DMB system for compatibility. One(Type 1) can replace the existing RS code, convolutional interleaver and RCPC code by a turbo code and the other one (Type 2) can substitute the existing RCPC code by a turbo code. Simulation results show that two new turbo coded systems are able to yield considerable performance gain after just 2 iterations. Type 2 system is better than type 1 but the amount of performance improvement is small.

Synthesis of Polymerizable Amphiphiles with Basic Oligopeptides for Gene Delivery Application (염기성 올리고펩티드 유도체를 가진 고분자 리피드의 합성 및 유전자 전달 효과 연구)

  • Bae, Seon Joo;Choi, Hye;Choi, Joon Sig
    • Polymer(Korea)
    • /
    • v.37 no.1
    • /
    • pp.94-99
    • /
    • 2013
  • Polydiacetylene (PDA) is made by photopolymerization of self-assembled diacetylene monomers. If diacetylene monomers are arranged systematically and close enough with distance of atoms, 1,4-addition polymerization will occur by the irradiation of 254 nm ultraviolet rays and then PDA will have alternated ene-yne polymer chains at the main structure. Aqueous solutions of diffused PDA is tinged with blue which shows ${\lambda}_{max}$ 640 nm. Visible color changes from blue to red occurs in response to a variety of environmental perturbations, such as temperature, pH, and ligand-receptor interactions. In this study, we synthesized cationic peptides - PCDA(10,12-pentacosadyinoic acid) liposome using a solid phase peptide synthesis (SPPS) method and prepared liposome solutions at various molar ratios using MPEG-PCDA. When mammalian cells were treated with the liposomes, high transfection efficiency and low toxicity were observed.

Improved BVP Candidate Selection Algorithm for HEVC Screen Content Coding (HEVC기반 스크린 콘텐츠 코딩을 위한 개선된 BVP 후보 선정 방법)

  • Kim, Yu-Seon;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.5
    • /
    • pp.1-7
    • /
    • 2017
  • Joint Collaborative Team on Video Coding (JCT-VC) of ISO/IEC MPEG and ITU-T developed the HEVC Screen Content Coding (HEVC SCC) standard as the HEVC extension for the screen content video coding. The Intra Block Copy (IBC) is the most effective tool adopted in HEVC SCC and predicts current block from already reconstructed neighboring blocks in the same picture. To reduce the amount of data in BV (Block Vector) to be transmitted, a BV predictor (BVP) is used to generate the BV differences in the IBC BV coding. In this paper, we analyze the current BV prediction process using HEVC reference software SCM-2.0 and SCM-4.0. Based on the analysis results, we propose an improved BVP candidate selection algorithm by adding a search process for adjacent BVs in addition to the existing spatial BVP candidates. Experimental results show that the BD-rate reduction of our proposed improvements ranges from 0.2% to 1%.

Fast Motion Estimation Algorithm Using Importance of Search Range and Adaptive Matching Criterion (탐색영역의 중요도와 적응적인 매칭기준을 이용한 고속 움직임 예측 알고리즘)

  • Choi, Hong-Seok;Kim, Jong-Nam;Jeong, Shin-Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.4
    • /
    • pp.129-133
    • /
    • 2015
  • In this paper, we propose a fast motion estimation algorithm which is important in the performance of video encoding. Conventional fast motion estimation algorithms have serious problems of low prediction quality in some frames and still much computation. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution of probability of motion vectors, divides search range into several groups according to its importance, and applies adaptive block matching criteria for each group of search range. The proposed algorithm takes only 3~5% in computational amount and has decreased prediction quality about 0~0.01dB compared with the fast full search algorithm.