Inter frame

About: Inter frame is a research topic. Over the lifetime, 4154 publications have been published within this topic receiving 63549 citations.

A new interframe difference algorithm for moving target detection

Abstract: In this paper, a new interframe difference algorithm for moving target detection is proposed which is under a static background based on three-frame-difference method in combination with background subtraction method. Firstly, the current frame image subtracts the previous frame and the next frame image separately, their results are added together to get a gray-scale image of the three-frame-difference method. Secondly, the current frame image subtracts the background image to get another gray-scale image of background subtraction method. Thirdly, their sum of the two gray-scale images of above is translated into binary image after being judged by threshold. Finally, this binary image is processed by morphology filtering and connectivity analyzing. Therefore, moving region is obtained. This new algorithm takes advantage of the good performances of three-frame-difference method and background subtraction method adequately. The analysis in theory and experiment results all show that the algorithm is better in efficiency and effect for moving target detection compared to the other similarity method.

Digital video compression utilizing mixed vector and scalar outputs

Abstract: Interframe compression of moving image data is achieved by a combination of vector coding and scalar coding of transform coefficient differences formed by the subtraction of previous image transform coefficients from corresponding present image transform coefficients along a Zig-Zag path in the arrays of coefficients. More efficient scalar codes are used instead of vector codes for transmission of coefficient data where the previous image coefficients are non-zero along the path. Vector codes are used where a non-zero value in the previous image transform array has not been established but a non-zero value coefficient occurs in the present image transform array. Vector coding efficiency is improved by modified run length coding.

Method and apparatus for detecting motion vectors in a frame decimating video encoder

Abstract: An improved motion estimating method serves to determine a set of target motion vectors between a current frame and its previous selected frame, wherein N number of frames are skipped between the current frame and the previous selected frame, said N being a positive integer inclusive of 1. This method is implemented through the use of all frames, i.e., the current and the previous selected frames and the N number of skipped frames in order to obtain a series of motion vectors for one of the search points within the previous selected frame. Said series of motion vectors is then summed up to define a target motion vector representing the displacement between said one of the search points and the corresponding best matching point in the current frame. The process is repeated until the set of target motion vectors for all of the search points contained in the previous selected frame are detected.

A look at the MPEG video coding standard for variable bit rate video transmission

Abstract: The MPEG video coding standard for the transmission of variable-bit-rate video on asynchronous transfer mode (ATM)-based broadband ISDN is examined. The focus is on its use for real-time transmission of broadcast-quality video. The impact of two key parameters, the intraframe to interframe picture ratio and the quantization index that are defined in the standard, on the bit rates per frame was studied. These parameters can be used to control video sources depending on the state of the network. Also, as opposed to previous work which looks only at bit rates per frame, the bits generated per macroblock are studied. This is the basic MPEG coding unit. By packetizing these bits, insight was obtained into the cell arrival process to a network for a MPEG video source. >

Interframe LSF quantization for noisy channels

Abstract: In linear predictive speech coding algorithms, transmission of linear predictive coding (LPC) parameters-often transformed to the line spectrum frequencies (LSF) representation-consumes a large part of the total bit rate of the coder. Typically, the LSF parameters are highly correlated from one frame to the next, and a considerable reduction in bit rate can be achieved by exploiting this interframe correlation. However, interframe coding leads to error propagation if the channel is noisy, which possibly cancels the achievable gain. In this paper, several algorithms for exploiting interframe correlation of LSF parameters are compared. Especially, performance for transmission over noisy channels is examined, and methods to improve noisy channel performance are proposed. By combining an interframe quantizer and a memoryless "safety-net" quantizer, we demonstrate that the advantages of both quantization strategies can be utilized, and the performance for both noiseless and noisy channels improves. The results indicate that the best interframe method performs as good as a memoryless quantizing scheme, with 4 bits less per frame. Subjective listening tests have been employed that verify the results from the objective measurements.