This paper describes an implementation of a software H.261 codec for PC, that takes an advantage of the fast computational algorithms for DCT-based videocompression, which have been presented by the author at the Feb...
详细信息
ISBN:
(纸本)0819420425
This paper describes an implementation of a software H.261 codec for PC, that takes an advantage of the fast computational algorithms for DCT-based videocompression, which have been presented by the author at the February's 1995 SPIE/IS&T meeting. The motivation for developing the H.261 prototype system is to demonstrate a feasibility of real time software- only videoconferencing solution to operate across a wide range of network bandwidth, frame rate, and resolution of the input video. As the bandwidths of current network technology will be increased, the higher frame rate and resolution of video to be transmitted is allowed, that requires, in turn, a software codec to be able to compress pictures of CIF (352 X 288) resolution at up to 30 frame/sec. Running on Pentium 133 MHz PC the codec presented is capable to compress video in CIF format at 21 - 23 frame/sec. This result is comparable to the known hardware-based H.261 solutions, but it doesn't require any specific hardware. The methods to achieve high performance, the program optimization technique for Pentium microprocessor along with the performance profile, showing the actual contribution of the different encoding/decoding stages to the overall computational process, are presented.
The large quantity of data associated with visual information necessitates the use of compression techniques. In this paper, we propose a novel approach (compressed domain technique) to implement spatial scalability d...
详细信息
ISBN:
(纸本)0819420425
The large quantity of data associated with visual information necessitates the use of compression techniques. In this paper, we propose a novel approach (compressed domain technique) to implement spatial scalability directly on the compressed image/video data. In contrast to the spatial domain technique (baseline for comparison), the proposed technique removes the unnecessary decompression and re-compression procedures. The computational complexity is greatly reduced by using certain approximations. We note that depending on the image/video content, only marginal quality degradation (almost unnoticeable subjectively) may be introduced. Simulation results confirm the substantial reductions in computational complexity of the proposed technique at a comparable performance to the spatial domain technique.
A crucial operation in image and video processing applications is affine transforms. Typical applications of affine transforms include fractal block coding, camera operation detection, affine motion estimation, etc. A...
详细信息
ISBN:
(纸本)0819420425
A crucial operation in image and video processing applications is affine transforms. Typical applications of affine transforms include fractal block coding, camera operation detection, affine motion estimation, etc. Affine transforms involve complex operations and are hence difficult to implement in real-time. In this paper, we present a novel architecture for real-time implementation of affine transforms. First, we derive two fundamental operations from affine transforms and then propose an efficient method of implementing these operations. As an example of the application of ATP (Affine Transform Processor), we propose a high performance videocompression algorithm mapped onto the proposed architecture. This algorithm is based on combined affine transform and vector quantization (ATVQ), where the infra-frame and inter-frame redundancy in the video sequence are exploited through piecewise self-similarity on a block-wise basis within a frame and between frames. ATVQ has the advantages of superior coding performance at a significantly reduced computational complexity. ATVQ has been mapped onto the ATP and real-time execution is demonstrated using a VHDL (VHSIC Hardware Description Language) implementation of ATP.
Block matching algorithms (BMAs) are often employed for motion estimation (ME) in video coding. Most conventional BMAs treat the ME problem as an optimization problem and employ certain search schemes to find a soluti...
详细信息
ISBN:
(纸本)0819420425
Block matching algorithms (BMAs) are often employed for motion estimation (ME) in video coding. Most conventional BMAs treat the ME problem as an optimization problem and employ certain search schemes to find a solution. Except the time-consuming full search algorithms (FS), other fast algorithms such as the three step search (TSS), searching on a reduced search range, cannot guarantee optimal solutions, i.e., search is often trapped at local minima; the ME results are thus usually unsatisfactory. Few of them makes use of the information inherent in the images explicitly. We propose a new ME algorithm which can reduce the search range while guaranteeing global optimality in most cases. Microblock visual patterns are designed to extract edge information to guide block matching: searching is only carried out at places where the real match most likely happens; that is where similar edge features present. The proposed algorithm obtains a speed about 7 - 8 times as fast as that of FS with same search range. The prediction quality is very close to that of FS and much better than that of TSS. It can produce MPEG-1 or MPEG-2 compatible motion vectors, and can be extended to model-based ME. It is suitable for parallel implementation too. Moreover, the visual patterns are potential resources for video indexing to facilitate content-based information retrieval, which is important for applications such as VOD.
Rate control is considered as an important issue in video coding, since it significantly affects video quality. In this paper, we will discuss joint encoder and channel rate control for variable bit-rate (VBR) video o...
详细信息
ISBN:
(纸本)0819420425
Rate control is considered as an important issue in video coding, since it significantly affects video quality. In this paper, we will discuss joint encoder and channel rate control for variable bit-rate (VBR) video over packet-switched Asynchronous Transfer Mode (ATM) networks. Since a variable bit-rate traffic is allowed in such networks, an open-loop encoder without rate control can generate consistent-quality video. But in order to improve statistical multiplexing gain (SMG), an encoder buffer is essential to smooth highly variable video bitstream. Due to the finite buffer size, some forms of encoder rate control have to be enforced and consequently, video quality varies. We argue that a rate control scheme has to balance both issues of consistent video quality on the encoder side and bitstream smoothness for SMG on the network side. We present a joint encoder and channel rate control algorithm for ATM networks, with leaky buckets as open-loop source flow control models. The encoder rate control is separated into a sustainable-rate control and a unidirectional instantaneous-rate control. It can improve the problem of leaky bucket saturation exhibited in previous works. Experimental results with MPEG video will be presented. The results verify our analysis and show the effectiveness of the proposed algorithm.
Motion compensation is a key operation in videocompression to remove the temporal redundancy in a video sequence. One of the application examples is the MPEG videocompression standard. The most commonly used motion ...
详细信息
ISBN:
(纸本)0819423564
Motion compensation is a key operation in videocompression to remove the temporal redundancy in a video sequence. One of the application examples is the MPEG videocompression standard. The most commonly used motion estimation algorithm is the block matching algorithm due to its regularity. Full search is the most straight forward block matching algorithm which can always locate the optimal motion vector. However, its computational complexity makes it impractical in real time applications. Fast algorithm required less computation but the obtained motion vector is suboptimal. In this paper, a hybrid block matching algorithm is proposed. In this algorithm, average intensities of groups of pixels are used to roughly estimate the motion first. Then, the fast search algorithm is applied in a reduced search region centered around the result of the first pass. Experimental results show that the performance of the estimation accuracy is quite close to that of the full search algorithm while the computational complexity is only slightly increased with respect to those fast algorithms.
Traditional data compressionalgorithms for 2D images work using the information theoretic paradigm, attempting to reduce redundant information by as much as possible. However, through the use of a depletion algorithm...
详细信息
ISBN:
(纸本)0819420425
Traditional data compressionalgorithms for 2D images work using the information theoretic paradigm, attempting to reduce redundant information by as much as possible. However, through the use of a depletion algorithm that takes advantage of characteristics of the human visual system, images can be displayed using only half or a quarter of the original information with no appreciable loss of quality.
High compression ratios for both still images and sequences of images are usually achieved by discarding information represented by block discrete cosine transform (BDCT) coefficients which is considered unimportant. ...
详细信息
ISBN:
(纸本)0819423564
High compression ratios for both still images and sequences of images are usually achieved by discarding information represented by block discrete cosine transform (BDCT) coefficients which is considered unimportant. This compression procedure yields images that exhibit annoying block artifacts. In this paper we examine the reconstruction of BDCT compressed images which results in the removal of the blocking artifact. The method we propose for the reconstruction of such images, is based on a hierarchical Bayesian approach. With such an approach image and degradation models are required. In addition, unknown hyperparameters, usually the noise and image variances, have to be estimated in advanced or simultaneously with the reconstructed image. We show how to introduce knowledge about these parameters into the reconstruction procedure. The proposed algorithm is tested experimentally.
We present a two-step segmentation scheme for the very low bit rate coding of general purpose video scenes. Our objective is to determine the regions of interest before the actual segmentation procedure, so as to redu...
详细信息
ISBN:
(纸本)0819423564
We present a two-step segmentation scheme for the very low bit rate coding of general purpose video scenes. Our objective is to determine the regions of interest before the actual segmentation procedure, so as to reduce the computational overhead introduced by this relatively complex process, and to avoid the phenomenon of over-segmentation of the scene. Simulation results show that the proposed scheme results in a radical reduction of the number of discrete spatio-temporal regions, while the background is identified as one uniform region, even when it is characterized by complex global motion.
In this paper, a motion field segmentation scheme for videocompression is presented. A split- and-merge segmentation technique and linear regression are used to segment the field and an affine motion model is used to...
详细信息
ISBN:
(纸本)0819420425
In this paper, a motion field segmentation scheme for videocompression is presented. A split- and-merge segmentation technique and linear regression are used to segment the field and an affine motion model is used to describe the movements of the regions. In the regression, a linearization of the displaced frame difference is minimize directly. The results are compared with block-based motion estimates and MPEG style coding.
暂无评论