H.264编码器中基于最匹配块的快速帧间模式选择方法

In H.264 encoder, all possible coding modes should be checked to choose the most appropriate mode for every macroblock, which adds a heavy computation burden to the encoder. In this paper, a fast inter-mode decision method is presented to reduce computation complexity of an H.264 encoder. By detecting the best matching block （BMB） before transform and quantization, some coding modes can be skipped and the corresponding encoding steps can be omitted for these BMBs. Meanwhile this method can also be used to detect all-zero blocks. The experimental results show that this method achieves consistently significant reduction of encoding time while keeping almost the same rate-distortion performance.     

Improved fast inra prediction algorithm of H.264/AVC

With advanced prediction modes of intra prediction, intra coding of H.264/AVC offers significant coding gains compared with previous video coding standards. It uses an important tool called Lagrangian rate-distortion optimization (RDO) technique to decide the best coding mode for a block, but the computational burden is extremely high. In this paper, we proposed an improved fast intra prediction algorithm including block type selection and mode decision algorithm based on analysis of edge feature of a block. Our algorithm filters out unlikely block type and candidate modes to reduce the RDO calculations. Experimental results showed that the proposed algorithm can reduce the computation complexity of intra prediction from 52.90% to 56.31%, with 0.04 dB PSNR degradation and 2% increase of bit rate.     

An Improvement of MPEG-4 Rate Control Algorithm

Frame skipping in low bit video coding could significantly reduce the visual quality of reconstructed video. At the same time, if the complexity of the video sequence remains high for a long period, then driving up the long term average bit rate, the only resort of MPEG-4 Q2 rate control algorithm results in using a high quantization scale, which shows a poor visual quality of the reconstructed video. This paper analyzes the main causes of frame skipping in current MPEG-4 frame rate control scheme, and presents a new rate control algorithm based on the quadratic R-D model over a CBR channel. Key features of the present work are. 1) the bits allocated to each P-frame or B-frame are in proportion to its distance from the end of this GOP, i.e. more bits are allocated to the frames that are nearer to their reference Ⅰ -frame: 2) the target buffer level is changeable in the GOP, at the end of each GOP( five P-frames or B-frames), the target buffer level is linearly reduced from 1/2 to 1/4 of buffer size, to other frames, the target buffer level is set to 1/2 of buffer size: 3 ) a selective and judicious use of the reduced resolution mode, in addition to a modulation of the quantization scale parameter, is to control the average long term bit rate. Experimental results with different video sequences of varied complexity, encoded at low bit rates show better efficacy of the proposed algorithm than MPEG-4 Q2 rate control scheme, and the experimental results also show that the improved algorithm has significantly reduced the number of frame skipping, increased the overall PSNR, and improved the perceptual quality.     

Adaptive foreground and shadow segmentation using hidden conditional random fields

Video object segmentation is important for video surveillance, object tracking, video object recognition and video editing. An adaptive video segmentation algorithm based on hidden conditional random fields (HCRFs) is proposed, which models spatio-temporal constraints of video sequence. In order to improve the segmentation quality, the weights of spatio-temporal con- straints are adaptively updated by on-line learning for HCRFs. Shadows are the factors affecting segmentation quality. To separate foreground objects from the shadows they cast, linear transform for Gaussian distribution of the background is adopted to model the shadow. The experimental results demonstrated that the error ratio of our algorithm is reduced by 23% and 19% respectively, compared with the Gaussian mixture model (GMM) and spatio-temporal Markov random fields (MRFs).     

WVD的快速计算

The paper proposes a new method for computation of the Wigner-Ville distribution (WVD) taking account of the conjugate symmetry of the WVD kernel function and the periodicity and symmetry of the trigonometric function. The method transfers the computation of WVD into real field from complex field to remove the redundancies in the fast Fourier transform(FFT) computation. The realization of fast cosine operation and fast sine operation considerably reduces the computation cost. Theoretical analysis shows that     

PID-based bit allocation strategy for asymmetric stereoscopic video coding with fuzzy quality controller

Asymmetric stereoscopic video coding can take advantage of binocular suppression in human vision by representing one of the two views in lower quality.This paper proposes a bit allocation strategy for asymmetric stereoscopic video coding.In order to improve the accuracy of bit allocation and rate control in the left view,a proportionalintegral-derivative controller is adopted.Meanwhile,to control the quality fluctuation between consecutive frames of the left view,a quality controller is adopted.Besides,a fuzzy controller is proposed to control the variation in quality between the left and right views by comparing the PSNR disparity of two views with a fixed threshold,which is used to quantize the binocular psycho-visual redundancy and adjust the quantization parameter (QP) of the right view correspondingly.The proposed algorithm has been implemented in H.264/AVC video codec,and the experimental results show its effectiveness in rate control while keeping a good quality for the left view,and fewer bits are allocated for the right view so that the overall bit rate is saved by 7.2% at most without the loss of subjective visual quality for stereoscopic video.     

Temporal Error Concealment Technique for MPEG-4 Video Streams

Concerning inter4v mode employed widely in MPEG-4 video, a new temporal error concealment scheme for MPEG-4 video sequences is proposed, which can selectively interpolate one or four motion vectors (MVs) for the missing macroblock (MB) according to the estimated MB coding mode. Performance of the proposed scheme is compared with the existing schemes with multiple testing sequences at different bit error rates. Experimental results show that the proposed algorithm can mask the impairments caused by transmission errors more efficiently than 0 MV and average MV methods by consuming more time for different bit error rates. It has an acceptable image quality close to that obtained by the selective motion vector matching (SMVM) algorithm, while taking less than half of cycles of operations. The proposed concealment scheme is suitable for low complexity video real-time implementations.     

Dominant edge direction based fast intra mode decision in the H.264/AVC encoder

The H.264/AVC video coding standard uses an intra prediction mode with 4×4 and 16×16 blocks for luma and 8×8 blocks for chroma. This standard uses the rate distortion optimization （RDO） method to determine the best coding mode based on the compression performance and video quality. This method offers a large improvement in coding efficiency compared to other compression standards, but the computational complexity is greater due to the various intra prediction modes. This paper proposes a fast intra mode decision algorithm for real-time encoding of H.264/AVC based on the dominant edge direction （DED）. The DED is extracted using pixel value summation and subtraction in the horizontal and vertical directions. By using the DED, three modes instead of nine are chosen for RDO calculation to decide on the best mode in the 4×4 luma block. For the 16×16 luma and the 8 × 8 chroma, only two modes are chosen instead of four. Experimental results show that the entire encoding time saving of the proposed algorithm is about 67% compared to the full intra search method with negligible loss of quality.     

A Pfaffian Formula of the Generalized Inverse Function-Valued Pade Approximant Used in Solving Integral Equations

The generalized inverse function-valued Pade approximant was defined to solve the integral equations. However, it is difficult to compute the approximants by some high-order determinant formulas. In this paper, to simplify computation of the function-valued Pade approximants, an efficient Pfaffian formula for the determinants was extended from the matrix form to the function-valued form. As an important application, a Pfaffian formula of [4/4] type Pade approximant was established.     

Automatic damage detection of engineering ceramics ground surface based on texture analysis

Ground textures seriously interfere with the exact identification of grinding damage. The common nondestructive testing techniques for engineering ceramics are limited by their difficulty and cost. Therefore, this paper proposes a global image reconstruction scheme in ground texture surface using Fourier transform (FT). The lines associated with high-energy frequency components in the spectrum that represent ground texture information can be detected by Hough transform (HT), and the corresponding high-energy frequency components are set to zero. Then the spectrum image is back-transformed into the spatial domain image with inverse Fourier transform (IFT). In the reconstructed image, the main ground texture information has been removed, whereas the surface defects information is preserved. Finally, Canny edge detection is used to extract damage image in the reconstructed image. The experimental results of damage detection for the ground texture surfaces of engineering ceramics have shown that the proposed method is effective.     

Critical Discourse Analysis of City Cultural Identity Construction—A Case Study of Video Xi tang

With the rapid development of science and technology,video has become a very important way to demonstrate the city itself.This paper,based on Fairclough’s three-dimensional conception of discourse to the video of Xitang,analyzes the on-screen titles of this video to reveal the ideology behind it.Through the analysis,it points out that this video,while protecting Xitang’s own unique traditional characteristics,it tries to cater for the needs not only Chinese people but also foreigners.To some extent,it tries to promote Xitang itself.     

Content-adaptive robust error concealment for packet-lossy H.264 video streaming

In this paper, we present a spatio-temporal post-processing error concealment (EC) algorithm designed initially for a H.264 video-streaming scheme over packet-lossy networks. It aims at optimizing the subjective quality of the restored video under the constraints of low delay and computational complexity, which are critical to real-time applications and portable devices having limited resources. Specifically, it takes into consideration the physical property of motion field in order to achieve more meaningful perceptual video quality, in addition to the improved objective PSNR. Further, a simple bilinear spatial interpolation approach is combined with the improved boundary-match (B-M) based temporal EC approach according to texture and motion activity analysis. Finally, we propose a low complexity temporal EC method based on motion vector interpolation as a replacement of the B-M based approach in the scheme under low-computation requirement, or as a complement to further improve the scheme's performance in applications having enough computation resources. Extensive experiments demonstrated that the proposal features not only better reconstruction, objectively and subjectively, than JM benchmark, but also robustness to different video sequences.     

Channel adaptive rate control for energy optimization

Low energy consumption is one of the main challenges for wireless video transmission on battery limited devices. The energy invested at the lower layers of the protocol stack involved in data communication, such as link and physical layer, represent an important part of the total energy consumption. This communication energy highly depends on the channel conditions and on the transmission data rate. Traditionally, video coding is unaware of varying channel conditions. In this paper, we propose a cross-layer approach in which the rate control mechanism of the video codec becomes channel-aware and steers the instantaneous output rate according to the channel conditions to reduce the communication energy. Our results show that energy savings of up to 30% can be obtained with a reduction of barely 0.1 dB on the average video quality. The impact of feedback delays is shown to be small. In addition, this adaptive mechanism has low complexity, which makes it suitable for real-time applications.     

Multi-user Motion JPEG2000 over wireless LAN: run-time performance-energy optimization with application-aware cross-layer scheduling

This paper introduces a video application-aware cross-layer framework for joint performance-energy optimization, considering the scenario of multiple users upstreaming real-time Motion JPEG2000 video streams to the access point of a WiFi wireless local area network and extends the PHY-MAC run-time cross-layer scheduling strategy that we introduced in (Mang-haram et al., 2005; Pollin el al., 2005) to also consider congested network situations where video packets have to be dropped. We show that an optimal solution at PHY-MAC level can be highly suboptimal at application level, and then show that making the cross-layer framework application-aware through a prioritized dropping policy capitalizing on the inherent scalability of Motion JPEG2000 video streams leads to drastic average video quality improvements and inter-user quality variation reductions of as much as 10 dB PSNR, without affecting the overall energy consumption requirements.     

Parallel processing architecture of H.264 adaptive deblocking filters

In H.264, computational complexity and memory access of deblocking filters are variable, dependent on video contents. This paper proposes a VLSI architecture of deblocking filters with adaptive dynamic power, which avoids redundant computations and memory accesses by precluding the blocks that can be skipped. The vertical and horizontal edges are simultaneously processed in an advanced scan order to speed up the decoder. As a result, dynamic power of the proposed architecture can be reduced adaptively （up to about 89%） for different videos, and the off-chip memory access is improved when compared to previous designs. Moreover, the processing capability of the proposed architecture is in particular appropriate for real-time deblocking of high-definition television （HDTV, 1920× 1080 pixels/frame, 60 frames/s video signals） video operation at 62 MHz. Using the proposed architecture, power can be reduced by up to about 89% and processing time by from 25% to 81% compared with previous designs.     

A Fast Fractal Image Compression Coding Method

Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic.Serach of the bast matched domain block is the most computation intensive part of the fractal encoding process.In this paper,a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block‘s neighbours is presented.Experimental results show that the proposed algorithm is very simple in implementation,fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley‘s fractal block coding.     

Iris Localization Algorithm Based on Improved Generalized Symmetry Transform

Accuracy and fastness of iris localization are very important in automatic iris recognition. A new fast iris localization algorithm based on improved generalized symmetry transform (GST) was proposed by utilizing iris symmetry. GST was improved in three aspects: 1 ) A new distance weight function is defined. The new weight function, which is effective in iris localization, utilized the characteristic of irises that the iris is a circular object and it has one inner boundary and one outer boundary. 2) Each calculation of the symmetry measurement of a pair of symmetry points was performed by taking one point of a pair as the starting point of the transformation. This is the most important reason for fast iris localization, due to which, repetitious computation was largely excluded. 3) A new phase weight function was proposed to adjust GST to locate circle target much better because the inner part of iris is darker than the outer part. The edge map of iris image was acquired and GST was only implemented on the edge point, which decreased computation without loss of accuracy. The modification of distance weight function and phase weight function leads to the accuracy of localization, and other ideass peed up the localization. Experiments show that the average speed of new algorithm is about 7.0-8.5 times as high as traditional ones including integro-differential operator and Hough transform method.     

An adaptive preprocessing algorithm for low bitrate video coding

INTRODUCTION Currently, main video coding algorithms, such as H.26x and MPEG families are all based on block discrete cosine transform (BDCT). At low bit rate, all these BDCT-based algorithms suffer from visible blocking artifacts, which are easily noticeable as the discontinuities between neighboring blocks, particu- larly in flat and low activity homogeneous areas of the image because high frequency DCT coefficients are inclined to be quantizd to zeros due to the high quan- tizatio…     

Exact Computation of Parallel Robot＇s Generalized Inertia Matrix

According to the definition of the new hypothetical states which have obvious physical significance and are termed as no-gravity static and accelerated states, a method for exact computation of the parallel robot＇s generalized inertia matrix is presented. Based on the matrix theory, the generalized inertia matrix of the parallel robot can be computed on the assumption that the robot is in these new hypothetical states respectively. The approach is demonstrated by the Delta robot as an example. Based on the principle of the virtual work, the inverse dynamics model of the robot is formulized after the kinematics analysis. Finally, a numerical example is given and the element distribution of the Delta robot＇s inertia matrix in the workspace is studied. The method has computationa＇, advantage of numerical accuracy for the Delta robot and can be parallelized easily.     

Topological inverse semigroups

That the projective limit of any projective system of compact inverse semigroups is also a compact inverse semigroup,the injective limit of any injective system of inverse semigroups is also an inverse semigroup, and that a compact inversesemigroup is topologically isomorphic to a strict projective limit of compact metric inverse semigroups are proved. It is alsodemonstrated that Horn (S,T) is a topological inverse semigroup provided that S or T is a topological inverse semigroup withsome other conditions. Being proved by means of the combination of topological semigroup theory with inverse semigroup theory,all these results generalize the corresponding ones related to topological semigroups or topological groups.