Residual frame

About: Residual frame is a research topic. Over the lifetime, 4443 publications have been published within this topic receiving 68784 citations.

Methods and apparatus for generating a picture-in-picture digital television frame by inserting a mean-only frame into a full-size frame

Abstract: A method for generating a picture-in-picture digital television frame comprises the steps of: converting a first analog television signal into a first digital frame comprising a first prescribed number of pixels; deriving a mean-only frame from the first digital frame, the mean-only frame comprising a second prescribed number of pixels; creating an insertion frame on the basis of the mean-only frame; and inserting the insertion frame into a second digital frame, thereby generating a picture-in-picture digital television frame. A Vector Quantization receiver/decoder comprises a mean-only decode section 20, a full decode section 30, and an image inserter 40.

Rate determination algorithms in IS-95 forward traffic channels

Abstract: According to the IS-95 CDMA standard, the transmit data rate can vary from frame to frame depending on the speech activity. However, the receiver does not know the data rate of the received frames. Conventionally, the receiver has to decode the received frame four times corresponding to the four possible data rates in rate set 1 or rate set 2 so as to obtain the correct decoded frame. Two rate determination algorithms for using 8 kbps (rate set 1) and 13 kbps (rate set 2) speech codecs in the forward traffic channel are introduced. The idea of maximum-likelihood estimation is employed in these two algorithms to determine the data rate. By using these algorithms, the received frame can be decoded once only corresponding to the determined rate instead of four times. Consequently, the decoding complexity and the power consumption at the receiver can be significantly reduced. From our analysis, the worst-case complexity and the average power consumption can be saved by a factor of 2 and 5, respectively.

Frame layer bit allocation scheme for constant quality video

Abstract: In order to achieve constant quality across the whole video sequence under the channel bandwidth and buffer constraints, it is necessary to allocate more bits to frames with scene changes or high complexity and fewer bits to low complexity frames. In this work, we propose a new frame layer bit allocation scheme for H.264 video coding using mean absolute difference (MAD) ratio, which is the ratio of MAD of current frame to the average MAD from the starting frame up to the previous frame in a GOP. We provide a theoretical justification of MAD ratio as a measure of frame complexity. Bit budget is allocated to frames according to their MAD ratios, combined with the bits computed based on their buffer status. Simulation results show that the H.264 coder, using our proposed algorithm with virtually little computational complexity added, effectively alleviates visual quality degradation caused by high motion or scene changes. Our proposed algorithm significantly reduces the standard deviation of PSNR, hence producing a nearly constant video quality throughout the whole video sequence, when compared with other existing video schemes

Method and apparatus for processing network frames in a network processor by embedding network control information such as routing and filtering information in each received frame

Abstract: A method and apparatus for processing network frames by embedding control information achieves an efficient frame processing system within a network processor (NP). The layer type of the frame can be quickly determined by the layer processing components of picocode running on the NP by examining control information that is written by ingress processing layers to produce a modified frame format. The frames are routed to appropriate layer processors and processing for certain layers may be bypassed if the picocode determines that no processing is required at that layer. The frame may also be discarded completely by any of the layer processors.

Stereo embedding by reversible watermarking: Further results

Abstract: This paper continues our researches on storage and bandwidth reduction for stereo images by using reversible watermarking. By embedding into one frame of the stereo pair the information needed to recover the other frame, the transmission/storage requirements are halved. Furthermore, the content of the image remains available and one out of the two images is exactly recovered. The quality of the other frame depends on two features: the embedding bit-rate of the watermarking and the size of the information needed to be embedded. This paper focuses on the second feature. Instead of a simple residual between the two frames, a disparity compensation scheme is used. The advantage is twofold. First, the quality of the recovered frame is improved. Second, at detection, the disparity frame is immediately available for 3D computation. Experimental results on standard test images are provided.