Reduction of discrete cosine transform/ quantisation/inverse quantisation/inverse discrete cosine transform computational complexity in H.264 video encoding by using an efficient prediction algorithm

This study develops a novel prediction algorithm to effectively save the computational complexity of discrete cosine transform (DCT), quantisation (Q), inverse Q (IQ), and inverse DCT (IDCT) in video encoding for H.264 applications. Based on the DC value of the DCT coefficients that is equal to the sum of residual data in the 4times4 sub-macroblock (sub-MB), a mathematical model is built to develop a prediction algorithm for reducing the computations in the DCT/Q/IQ/IDCT process. Experimental results and comparisons demonstrate that the proposed prediction algorithm significantly reduces the encoding time while incurring little additional overhead, and lowers the bit rate with little peak signal-to-noise ratio degradation.     

A comparison of fast inverse discrete cosine transform algorithms

The discrete cosine transform (DCT) is often applied to image compression to decorrelate picture data before quantization. This decorrelation results in many of the quantized transform coefficients equaling zero, hence the compression gain. At the decoder, very few nonzero quantized transform coefficients are received, so the input to the inverse DCT is sparse, greatly reducing the required computation. This paper describes different styles of implementations of fast inverse DCTs designed especially for sparse data and compares them on workstation processors.This research has been sponsored by ARPA     

Wavelet domain-based video noise reduction using temporal discrete cosine transform and hierarchically adapted thresholding

A novel spatio-temporal filter for video denoising, which operates entirely in the wavelet domain, is proposed. For effective noise reduction, the spatial and temporal redundancies that exist in the wavelet domain representation of a video signal are exploited. First, a 2D discrete wavelet transform is applied to the input noisy frames. This is followed by a discrete cosine transform (DCT), which is applied to the temporal subband coefficients to minimise the redundancy among the consecutive frames. The DCT transformed, noise-free coefficients in the different wavelet domain subbands for the original image sequence are modelled using a prior having a generalised Gaussian distribution. On the basis of this prior, filtering of the noisy wavelet coefficients in each subband is carried out using a new, low-complexity wavelet shrinkage method, which utilises the correlation that exists between subsequent resolution levels. Experimental results show that the proposed scheme outperforms several state-of-the-art spatio-temporal filters in terms of both the peak signal-to-noise ratio and the visual quality     

A motion compensated lifting wavelet codec for 3D video coding

A motion compensated lifting (MCLIFT) ramework for the 3D wavelet video coding is proposed in this paper,By using bi-directional motion compensation in each lifting step of the temporal direction,the video frames are effectively de-correlated,With the proper entropy coding and bit-stream packaging schemes,the MCLIFT wavelet video coder is scalable at frame rate and quality level .Experimental results show that the MCLIFT video coder outperforms the 3D wavelet video coder without motion by an average of 0.9-1.3dB,and outperforms MPEG-4 coder by an average of 0.2-0.6dB.     

An improved 3D wavelet-based scalable video coding codec for MC-EZBC

With the rapid growth of modern multimedia applications, 3D wavelet-based scalable video coding (SVC) codec has received considerable attention lately because of its high coding performance and flexibility in bitstream scalability. It combines the motion-compensated temporal filtering (MCTF) together with the spatial decomposition to produce an embedded bitstream offering various levels of video quality over the heterogeneous networks. However, in the existing 3D wavelet-based SVC schemes, where the block types for block matching algorithms are limited, weighting matrices for block-wise motion compensation are fixed, and variations in activities of temporal subbands are not considered in the selection of the Lagrange multiplier for mode decision. In this paper, our major contribution is to provide some recent extensions to the well-known scalable subband/wavelet video codec Motion-Compensated Embedded Zero Block Coding (MC-EZBC) using three novel and content adaptive algorithms. Firstly, the enhanced hierarchical variable size block matching (Enhanced HVSBM) algorithm is proposed for the variable block size motion estimation. Then, the rate-distortion optimization (RDO) based adaptive Lagrange multiplier selection model for mode decision is presented. Finally, we introduce the adaptive weighting matrices design for overlapped block motion compensation (OBMC). Experimental results show that all the three proposed algorithms significantly improve the overall coding performance of MC-EZBC. Comparisons with other popular wavelet-based SVC codecs demonstrate the effectiveness of our improved codec in terms of both video quality assessment and computational complexity.     

基于余弦变换和小波变换的数字水印算法

在互联网络技术和多媒体技术普及的今天,数字水印技术已经成为目前信息安全技术领域的一个重要方向。本文提出了一种基于离散余弦变换和离散小波变换的数字水印算法,以一个长度为n服从N(0,1)正态分布的随机数序列作为水印信号嵌入到图像最具感知意义的频率部分。实验结果表明,此算法具有良好的视觉效果和鲁棒性。     

Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format

Given a compressed image in the restricted quadtree and shading format, this paper presents a fast algorithm for computing 2D discrete cosine transform (DCT) on the compressed grey image directly without the need to decompress the compressed image. The proposed new DCT algorithm takes O(K²logK+N²) time where the decompressed image is of size N×N and K denotes the number of nodes in the restricted quadtree. Since commonly K<N, the proposed algorithm is faster than the indirect method by decompressing the compressed image first, then applying the conventional DCT algorithm on the decompressed image. The indirect method takes O(N²logN) time.     

Real-time motion estimation for image and video processing applications

This contribution focuses on different topics that are covered by the special issue titled “Real-Time Motion Estimation for image and video processing applications” and which incorporate GPUS, FPGAs, VLSI systems, DSPs, and Multicores, among other platforms. The guest editors have solicited original contributions, which address a wide range of theoretical and practical issues related to high-performance motion estimation image processing including, but not limited to: real-time matching motion estimation systems, real-time energy-based motion estimation systems, gradient-based motion estimation systems, optical flow estimation systems, color motion estimation systems, multi-scale motion estimation systems, optical flow and motion estimation systems, analysis or comparison of specialized architectures for motion estimation systems and real-world applications.     

A semi-fragile watermarking scheme for authenticating audio signal based on dual-tree complex wavelet transform and discrete cosine transform

In this paper, a novel semi-fragile watermarking scheme for authenticating an audio signal based on dual-tree complex wavelet transform (DT-CWT) and discrete cosine transform (DCT) is proposed. Specifically, the watermark data are efficiently inserted into the coefficients of the low-frequency sub-band of DT-CWT taking advantages of both DCT and quantization index modulation (QIM). First, the original digital audio signal is segmented and then performed with DT-CWT. Second, based on the energy compression property, the low-frequency sub-band coefficients of the DT-CWT domain are performed with DCT, and the DC component is utilized to embed one distorted watermark bit by the QIM technique. Finally, inverse DCT and DT-CWT are orderly implemented on the watermarked coefficients of each audio segment to get a watermarked audio signal. Simulation results show that the hybrid embedding domain constructed by DT-CWT and DCT is effective, and the proposed watermarking scheme is not only inaudible, but also robust against content persistent non-malicious audio signal processing operations, such as MP3 compression, noise addition, re-sampling, re-quantization, etc. Furthermore, the proposed scheme can effectively authenticate the veracity and integrity of audio content and greatly expands the applicability of the audio watermarking scheme.     

A lossy 3D wavelet transform for high-quality compression of medical video

In this paper, we present a lossy compression scheme based on the application of the 3D fast wavelet transform to code medical video. This type of video has special features, such as its representation in gray scale, its very few interframe variations, and the quality requirements of the reconstructed images. These characteristics as well as the social impact of the desired applications demand a design and implementation of coding schemes especially oriented to exploit them. We analyze different parameters of the codification process, such as the utilization of different wavelets functions, the number of steps the wavelet function is applied to, the way the thresholds are chosen, and the selected methods in the quantization and entropy encoder. In order to enhance our original encoder, we propose several improvements in the entropy encoder: 3D-conscious run-length, hexadecimal coding and the application of arithmetic coding instead of Huffman. Our coder achieves a good trade-off between compression ratio and quality of the reconstructed video. We have also compared our scheme with MPEG-2 and EZW, obtaining better compression ratios up to 119% and 46%, respectively for the same PSNR.     

An algebraic method for synthesizing fast algorithms of discrete cosine transform of arbitrary size

An algebraic method for synthesizing fast algorithms of the discrete cosine transform (DCT) of arbitrary size is proposed. The method is based on the polynomial algebra $\mathbb{F}{{[x]} \mathord{\left/ {\vphantom {{[x]} {p(x)}}} \right. \kern-0em} {p(x)}}$ associated with the DCT. The fast DCT algorithm comes as a result of the step-by-step decomposition of this algebra. In turn, the decomposition requires step-by-step factorization of the polynomial p(x). This problem is solved using Galois??s theory, which allows finding all the subfields of the splitting field of the polynomial p(x) where p(x) can be factorized.     

Real-time 3D shape reconstruction, dynamic 3D mesh deformation, and high fidelity visualization for 3D video

3D video [IEEE Multimedia (1997) 18] is the ultimate image media recording dynamic visual events in the real world as is; it records time varying 3D object shape with high fidelity surface properties (i.e., color and texture). Its applications cover wide varieties of personal and social human activities: entertainment (e.g., 3D game and 3D TV), education (e.g., 3D animal picture books), sports (e.g., sport performance analysis), medicine (e.g., 3D surgery monitoring), culture (e.g., 3D archive of traditional dances), and so on. In this paper, we propose: (1) a PC cluster system for real-time reconstruction of dynamic 3D object action from multi-view video images, (2) a deformable 3D mesh model for reconstructing the accurate dynamic 3D object shape, and (3) an algorithm of rendering natural-looking texture on the 3D object surface from the multi-view video images. Experimental results with quantitative performance evaluations demonstrate the effectiveness of these methods in generating high fidelity 3D video from multi-view video images.     

Recursive algorithm, architectures and FPGA implementation of the two-dimensional discrete cosine transform

A new recursive algorithm and two types of circuit architectures are presented for the computation of the two-dimensional discrete cosine transform (2D DCT). The new algorithm permits to compute the 2D DCT by a simple procedure of the 1D recursive calculations involving only cosine coefficients. The recursive kernel for the proposed algorithm contains a small number of operations. Also, it requires a smaller number of pre-computed data compared with many of existing algorithms in the same category. The kernel can be easily implemented in a simple circuit block with a short critical delay path. In order to evaluate the performance improvement resulting from the new algorithm, an architecture for the 2D DCT designed by direct mapping from the computation structure of the proposed algorithm has been implemented in an FPGA board. The results show that the reduction of the hardware consumption can easily reach 25% and the clock frequency can increase 17% compared with a system implementing a recently reported 2D DCT recursive algorithm. For a further reduction of the hardware, another architecture has been proposed for the same 2D DCT computation. Using one recursive computation block to perform different functions, this architecture needs only approximately one-half of the hardware that is required in the first architecture, which has been confirmed by an FPGA implementation.     

A method of 3D modeling and codec

3D modeling and codec of real objects are hot issues in the field of virtual reality. In this paper, we propose an automatic registration two range images method and a cycle based automatic global registration algorithm for rapidly and automatically registering all range images and constructing a realistic 3D model. Besides, to meet the requirement of huge data transmission over Internet, we present a 3D mesh encoding/decoding method for encoding geometry, topology and attribute data with high compression ratio and supporting progressive transmission. The research results have already been applied successfully in digital museum. Supported by the National Natural Science Foundation of China (Grant Nos. 60533070, 60773153), the Key Grant Project of Chinese Ministry of Education (Grant No. 308004), the Project of Chinese Ministry of Science and Technology (Grant No. 2006BAK12B09), and the Project of Beijing Municipal Science and Technology Commission (Grant No. Z07000100560714)     

An efficient VLSI architecture for lifting based 1D/2D discrete wavelet transform

In this paper, high performance VLSI architectures for lifting based 1D and 2D-Discrete wavelet transforms (DWTs) are proposed. The proposed logic used for area efficient lifting based DWT is to perform the whole operation with one processing element. Similarly, the proposed logic used for delay efficient lifting based DWT is to perform the whole operation with multiple processing elements in parallel. In both the cases, the processing element consists of one floating point adder and one proposed fused multiply add design. The proposed and existing lifting based 1D and 2D lifting based DWTs are implemented with 45 nm technology. The results show that the proposed designs achieve significant improvement compared with existing architectures. For example, 9-point 2-parallel proposed (9, 7) single level 1D-DWT achieves 33.5% of reduction in total cycle delay compared with direct form. Similarly, 9-point single PE proposed (9, 7) single level 1D-DWT achieves 59.8% and 75.5% of reduction in total area and net power over direct form respectively.     

Illumination compensation and normalization for robust face recognition using discrete cosine transform in logarithm domain.

This paper presents a novel illumination normalization approach for face recognition under varying lighting conditions. In the proposed approach, a discrete cosine transform (DCT) is employed to compensate for illumination variations in the logarithm domain. Since illumination variations mainly lie in the low-frequency band, an appropriate number of DCT coefficients are truncated to minimize variations under different lighting conditions. Experimental results on the Yale B database and CMU PIE database show that the proposed approach improves the performance significantly for the face images with large illumination variations. Moreover, the advantage of our approach is that it does not require any modeling steps and can be easily implemented in a real-time face recognition system.     

三维视频深度图像处理及其ASIC实现

基于自适应色度分割方法,采用专用集成电路( ASIC)完成深度图像的处理及优化.系统级仿真验证结果表明,该深度图像处理方法具有实时性、兼容性、实用性等特点,适用于实时自由视点3D视频的处理.     

Fast and low-complexity method for exact computation of 3D Legendre moments

A new method is proposed for fast and low-complexity computation of exact 3D Legendre moments. The proposed method consists of three main steps. In the first step, the symmetry property is employed where the computational complexity is reduced by 87%. In the second step, exact values of 3D Legendre moments are obtained by mathematically integrating the Legendre polynomials over digital image voxels. An algorithm is employed to significantly accelerate the computational process. In this algorithm, the equations of 3D Legendre moments are treated in a separated form. The proposed method is applied to determine translation-scale invariance of 3D Legendre moments in a very simple way. Numerical experiments are performed where the results are compared with those of the existing methods. Complexity analysis and results of the numerical experiments clearly ensure the efficiency of the proposed method.