• Title/Summary/Keyword: MPEG-4 Video

Search Result 508, Processing Time 0.022 seconds

Voting-based Intra Mode Bit Skip Using Pixel Information in Neighbor Blocks (이웃한 블록 내 화소 정보를 이용한 투표 결정 기반의 인트라 예측 모드 부호화 생략 방법)

  • Kim, Ji-Eon;Cho, Hye-Jeong;Jeong, Se-Yoon;Lee, Jin-Ho;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.498-512
    • /
    • 2010
  • Intra coding is an indispensable coding tool since it can provide random accessibility as well as error resiliency. However, it is the problem that intra coding has relatively low coding efficiency compared with inter coding in the area of video coding. Even though H.264/AVC has significantly improved the intra coding performance compared with previous video standards, H.264/AVC encoder complexity is significantly increased, which is not suitable for low bit rate interactive services. In this paper, a Voting-based Intra Mode Bit Skip (V-IMBS) scheme is proposed to improve coding efficiency as well as to reduce encoding time complexity using decoder-side prediction. In case that the decoder can determine the same prediction mode as what is chosen by the encoder, the encoder does not send that intra prediction mode; otherwise, the conventional H.264/AVC intra coding is performed. Simulation results reveal a performance increase up to 4.44% overall rate savings and 0.24 dB in peak signal-to-noise ratio while the frame encoding speed of proposed method is about 42.8% better than that of H.264/AVC.

Selective Inter-layer Residual Prediction Coding and Fast Mode Decision for Spatial Enhancement Layers in Scalable Video Coding (스케일러블 비디오 부호화에서 선택적 계층간 차분 신호 부호화 및 공간적 향상 계층에서의 모드 결정)

  • Lee, Bum-Shik;Hahm, Sang-Jin;Park, Chang-Seob;Park, Keun-Soo;Kim, Mun-Churl
    • 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.

Reconfigurable SoC Design with Hierarchical FSM and Synchronous Dataflow Model (Hierarchical FSM과 Synchronous Dataflow Model을 이용한 재구성 가능한 SoC의 설계)

  • 이성현;유승주;최기영
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.8
    • /
    • pp.619-630
    • /
    • 2003
  • We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

A Blind Watermarking Algorithm using CABAC for H.264/AVC Main Profile (H.264/AVC Main Profile을 위한 CABAC-기반의 블라인드 워터마킹 알고리즘)

  • Seo, Young-Ho;Choi, Hyun-Jun;Lee, Chang-Yeul;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.181-188
    • /
    • 2007
  • This paper proposed a watermark embedding/extracting method using CABAC(Context-based Adaptive Binary Arithmetic Coding) which is the entropy encoder for the main profile of MPEG-4 Part 10 H.264/AVC. This algorithm selects the blocks and the coefficients in a block on the bases of the contexts extracted from the relationship to the adjacent blocks and coefficients. A watermark bit is embedded without any modification of coefficient or with replacing the LSB(Least Significant Bit) of the coefficient with a watermark bit by considering both the absolute value of the selected coefficient and the watermark bit. Therefore, it makes it hard for an attacker to find out the watermarked locations. By selecting a few coefficients near the DC coefficient according to the contexts, this algorithm satisfies the robustness requirement. From the results from experiments with various kinds and various strengths of attacks the maximum error ratio of the extracted watermark was 5.02% in maximum, which makes certain that the proposed algorithm has very high level of robustness. Because it embeds the watermark during the context modeling and binarization process of CABAC, the additional amount of calculation for locating and selecting the coefficients to embed watermark is very small. Consequently, it is highly expected that it is very useful in the application area that the video must be compressed right after acquisition.

Analysis characteristics of officers' watch-keeping for efficient navigation bridge layout of a fisheries training vessel (효율적인 어업실습선의 선교 layout을 위한 당직항해사의 업무특성 분석)

  • KIM, Min-Son;HWANG, Bo-Kyu
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.52 no.1
    • /
    • pp.56-64
    • /
    • 2016
  • This study analyzed characteristics of officers' watch-keeping during fishing operation at the fisheries training ship KAYA (GT: 1,737 tons, Pukyong National University). It observed fishing works of three officers in wheel house of KAYA. The observations were carried out at the fishing ground 45 miles away from east of Jeju from 7 to 8 January 2010. The works and movements of the officers were recorded with three common video cameras and a 4-channel MPEG-4 Triplex DVR. Recorded data of the working circulation was analyzed by using the post-processing method. As a result of the traffic lines, the average (${\pm}S.D$) of working hour (min) and moving frequency (times), distance (m) and speed (m/min) during setting the net was 11.8 (0.9), 43.7 (8.1), 133.9 (35.8) and 10.5 (0.6), respectively. During trawling the net, it was 100, 241 (39.8), 615.7 (194.6) and 5.2 (1.6), respectively. During hauling the net, it was 17.6 (1.4), 41.0 (7.2), 196.9 (37.6) and 10.7 (0.8), respectively. In addition, it has a different tendency of the instrument usage frequency by the fishing works. During setting, the usage priority was CCTV, ECDIS, RPM and pitch controller, net monitor, GPS plotter, chart room, X-band radar, fish finder and public addressor. During trawling, it was CCTV, ECDIS, fish finder, X-band radar, net monitor, chart room, GPS plotter, RPM and pitch controller, auto pilot and steering, interphone, wind speed and direction indicator, No.1. VHF, navigation light control panel and public addressor. During hauling, it was CCTV, RPM and pitch controller, GPS plotter, public addressor, chart room, net monitor, X-band radar, auto pilot and steering and fish finder.

Enhanced Smoothing Algorithm Using GOP Unit (개선된 GOP 단위의 스무딩 알고리즘)

  • Lee, Myoun-Jae
    • Journal of Digital Contents Society
    • /
    • v.12 no.4
    • /
    • pp.485-490
    • /
    • 2011
  • Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA, PCRTT and others. But, these algorithms build a transmission plan per frame unit. So, these algorithms cause frame burst or GOP burst. In order to improve it, MVBAG algorithm build a transmission plan per GOP. But this algorithm may not guarantee QoS when frame's size is abruptly larger or smaller than the computed transmission rate. In this paper, a smoothing algorithm is proposed to enhance MVBAG algorithm's problem. In order to show the proposed algorithm's performance, the proposed algorithm is compared with MVBAG algorithm using various evaluation factors such as number of frames that do not meet the QoS, average transmission rate variability per frame, average transmission rate variability per GOP. Experimental results show that the proposed algorithm outperforms MVBAG algorithm in number of frames that do not meet the QoS.

Multi-view video coding using efficient disparity vector prediction (다시점 동영상에서의 효율적인 변이 벡터 압축 기법)

  • Kim, Yong-Tae;Sohn, Kwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.10 no.4 s.29
    • /
    • pp.621-631
    • /
    • 2005
  • To enhance the performance of multi-view sequence CODEC, an efficient disparity vector coding method fur multiview sequences is proposed herein. For higher coding efficiency, we encode the differential vectors acquired by subtracting the original vectors from the predicted ones. To enhance the performance of disparity vector coding, it is essential to predict the disparity vectors accurately. The prediction by this proposed method utilizes the correlation among the multiview images, while conventional methods exploit the correlation among the causal blocks. Experiments were performed fur three different 5 view sequences. We were able to confirm that the proposed method predicts disparity vectors accurately by comparing the entropy and the mean absolute values for differential vectors with conventional methods. Its performance is superior to vector coding methods used in MPEG-4 which uses only a spatial correlation. The proposed method increases the coding efficiency by a factor of $30{\~}45\%$ while preserving image quality.

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.

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.

Luma Mapping Function Generation Method Using Attention Map of Convolutional Neural Network in Versatile Video Coding Encoder (VVC 인코더에서 합성 곱 신경망의 어텐션 맵을 이용한 휘도 매핑 함수 생성 방법)

  • Kwon, Naseong;Lee, Jongseok;Byeon, Joohyung;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.26 no.4
    • /
    • pp.441-452
    • /
    • 2021
  • In this paper, we propose a method for generating luma signal mapping function to improve the coding efficiency of luma signal mapping methods in LMCS. In this paper, we propose a method to reflect the cognitive and perceptual features by multiplying the attention map of convolutional neural networks on local spatial variance used to reflect local features in the existing LMCS. To evaluate the performance of the proposed method, BD-rate is compared with VTM-12.0 using classes A1, A2, B, C and D of MPEG standard test sequences under AI (All Intra) conditions. As a result of experiments, the proposed method in this paper shows improvement in performance the average of -0.07% for luma components in terms of BD-rate performance compared to VTM-12.0 and encoding/decoding time is almost the same.