A NOVEL SCANNING SCHEME FOR DIRECTIONAL SPATIAL PREDICTION OF AVS INTRA CODING

ABSTRACT: Transform coefficient scan is an important procedure of video coding. In video coding standards such as MPEG2, MPEG4, H.264/AVC and AVS, there are zigzag scan for frame coding and field scan for field coding. In this paper, a novel scanning scheme (Z-Scan) of AVS for intra-prediction coding is proposed. In traditional zigzag scanning the fixed scan pattern is used, which has designed to organize quantized transform coefficients in order to bring the high-frequency components as more as possible, so that the coefficients can be encoded more efficiently using the entropy encoding. However, zigzag scan cannot efficiently organize the transform coefficients due to different residual energy distribution produced by different intra prediction. To resolve this problem, in this paper, we propose a new zscan scheme to further improve intra coding efficiency for the AVS standard. In this method, traditional zigzag scan, horizontal z-scan, and vertical z-scan are used depending on the spatial prediction directions. It is relatively easy to implement our z-scan scheme into AVS codec without changing the syntax. Experimental results demonstrate that the z-scan scheme can remarkably reduce bitrates by approximately 2.1% compared with AVS codec using zigzag scan, while the PSNR of video sequences are maintained. Simulation results show that the proposed adaptive coefficient scanning scheme can achieve significant compression improvement

Poboljšana adaptivna pretvorba ostataka prilikom H.264/AVC video kodiranja bez gubitka kvalitete

The H.264/AVC was designed mainly for lossy video coding, the lossless coding of H.264 use bypass mode for DCT and quantization. Although sample-by-sample DPCM improves performance of coding, the benefit is limited in intra. In this paper, a new adaptive transform is proposed based on the character of 4x block residual coefficient\u27s distribution, which can be used both in intra and inter coding. The greatest strength of the proposed transform is the decorrelation without inflation versus dynamic range of input matrix. Due to the random distribution of residual coefficients, a specific transform is hard to play a positive impact on them. Therefore, several transforms of different directions will be implemented simultaneously, and the most efficient one will be determined by a proposed mechanism. Then, by means of statistic method, a new scan order is designed for CAVLC entropy encoder, cooperating with corresponding transform. The simulation results show that based on the fast algorithm of proposed method, the bit saving achieves about 7.41% bit saving in intra coding and 10.47% in inter, compared with H.264-LS.H.264/AVC je napravljen prvenstveno za kodiranje videa uz gubitak kvalitete, dok kodiranje H.264 bez gubitka kvalitete koristi zaobilazni mod za DCT i kvantizaciju. Iako uzorak-po-uzorak (DPCM) kvantizacija poboljšava performanse kodiranja, dobitak je ograničen. U ovom radu predlaže se nova adaptivna transformacija koja se zasniva na znakovima od 4x4 blokova distribucije ostataka koeficijenata, koja može koristiti i unutarnje i među kodiranje. Najveća snaga predložene transformacije je u nekoreliranosti bez inflacije protiv dinamičke veličine ulazne matrice. Radi slučajne distribucije ostataka koeficijenata, teško je postići da određena transformacija ima pozitivan učinak na njih. Iz tog razloga istovremeno je implementirano nekoliko transformacija različitih pristupa, te je korištenjem predloženog mehanizma odabrana najefikasnija. Zatim je, korištenjem statističke metode, dizajniran novi poredak snimanja za CAVLC entropijski enkoder, koji surađuje s odgovarajućom transformacijom. Rezultati simulacija pokazuju da korištenjem brzog algoritma predložene metode dolazi do smanjenja korištenih bitova od 7.41% kod među kodiranja i 10.47% prilikom unutarnjeg kodiranja u usporedbi s H.264-LS

High-Efficient Parallel CAVLC Encoders on Heterogeneous Multicore Architectures

This article presents two high-efficient parallel realizations of the context-based adaptive variable length coding (CAVLC) based on heterogeneous multicore processors. By optimizing the architecture of the CAVLC encoder, three kinds of dependences are eliminated or weaken, including the context-based data dependence, the memory accessing dependence and the control dependence. The CAVLC pipeline is divided into three stages: two scans, coding, and lag packing, and be implemented on two typical heterogeneous multicore architectures. One is a block-based SIMD parallel CAVLC encoder on multicore stream processor STORM. The other is a component-oriented SIMT parallel encoder on massively parallel architecture GPU. Both of them exploited rich data-level parallelism. Experiments results show that compared with the CPU version, more than 70 times of speedup can be obtained for STORM and over 50 times for GPU. The implementation of encoder on STORM can make a real-time processing for 1080p @30fps and GPU-based version can satisfy the requirements for 720p real-time encoding. The throughput of the presented CAVLC encoders is more than 10 times higher than that of published software encoders on DSP and multicore platforms

Low complexity video compression using moving edge detection based on DCT coefficients

In this paper, we propose a new low complexity video compression method based on detecting blocks containing moving edges us- ing only DCT coe±cients. The detection, whilst being very e±cient, also allows e±cient motion estimation by constraining the search process to moving macro-blocks only. The encoders PSNR is degraded by 2dB com- pared to H.264/AVC inter for such scenarios, whilst requiring only 5% of the execution time. The computational complexity of our approach is comparable to that of the DISCOVER codec which is the state of the art low complexity distributed video coding. The proposed method ¯nds blocks with moving edge blocks and processes only selected blocks. The approach is particularly suited to surveillance type scenarios with a static camera

Low power context adaptive variable length encoder in H.264

The adoption of digital TV, DVD video and Internet streaming led to the development of Video compression. H.264/AVC is the industry standard delivering highly efficient and reliable video compression. In this Video compression standard, H.264/AVC one of the technical developments adopted is the Context adaptive entropy coding schemes. This thesis developed a complete VHDL behavioral model of a variable length encoder. A synthesizable hardware description is then developed for components of the variable length encoder using Synopsys tools. Many implementations were focused on density and speed to reduce the hardware cost and improve quality but with higher power consumption. Low power consumption of an IC leads to lower heat dissipation and thereby reduces the need for bigger heat sinking devices. Reducing the need for heat sinking devices can provide lot of advantages to the manufacturers in terms of cost and size of the end product. Focus towards smaller area with higher power consumption may not be appropriate for some end products that need thinner mechanical enclosures because even if the design has smaller area it needs a bigger heat sink thereby making the enclosures bigger. This thesis therefore aimed at low power consumption without compromising much on the area. The designed architecture enables real-time processing for QCIF and CIF frames with 60-fps using 100MHz clock. The resultant hardware power is 1.4mW at 100MHz using 65nm technology. The total logic gate count is 32K gates

Low complexity intra video coding using transform domain prediction

In this paper, a new low complexity intra coding framework is presented. The proposed method is extremely computationally efficient as it uses intra prediction in the DCT domain. To facilitate finding a good predictor, we propose to extend the number of neighouring blocks to be searched, based on a consideration of the type of edges we can expect to observe in the pixel data. The best predictor can be selected from the candidate blocks without recourse to rate-distortion optimisation or pixel interpolation. To obtain better performance we also propose to automatically adapt the entropy encoding block to the prediction mode used. Experimental results show that the encoding scheme compares favorably to H.264/AVC in terms of compression efficiency but with a significant reduction in overall computational complexity