Uncovered Background Prediction in Interframe Coding

Mukawa, Naoki; Kuroda, Hideo

doi:10.1109/tcom.1985.1096229

Cited by 24 publications

(18 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Long-term memory MCP includes this method as a special case when using the Adaptive Buffering memory control as shown for the surveillance sequence. For background memory prediction, researchers have proposed to estimate an additional reference frame for motion compensation that contains the back-ground [MK85,Hep90,Yua93,DM96,ZK98]. For aliasing prediction, a superresolution image for sub-pixel motion compensation is estimated [Wed99].…”

Section: Methodsmentioning

confidence: 99%

“…Several researchers have proposed algorithms to exploit uncovered background effects using background memory prediction [MK85,Hep90,Yua93,DM96,ZK98]. Generating a background memory frame as a second reference picture for MCP is mainly an image segmentation problem where an algorithm has to distinguish between moving foreground objects and the background.…”

Section: Exploitation Of Long-term Statistical Dependenciesmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Frame Motion-Compensated Prediction for Video Transmission

Wiegand

Girod

2001

View full text Add to dashboard Cite

Section: Methodsmentioning

confidence: 99%

Section: Exploitation Of Long-term Statistical Dependenciesmentioning

confidence: 99%

Multi-Frame Motion-Compensated Prediction for Video Transmission

Wiegand

Girod

2001

View full text Add to dashboard Cite

“…Multiframe techniques have first been utilized for background prediction by Mukawa and Kuroda [MK85]. The method permits a prediction signal for uncovered background.…”

Section: Multiframe Motion Compensationmentioning

confidence: 99%

Video Coding with Superimposed Motion-Compensated Signals

Flierl¹

2004

The International Series in Engineering and Computer Science

View full text Add to dashboard Cite

“…Even before [18], techniques in [19]- [22] construct simple golden frames such as backgroundframe or background memory for efficient video coding by using block-based motion information. Mukawa and Kuroda [23] introduced background replenishment and the updating technique at the pixel level using the frame-difference signal to a threshold (against cumulative differences for a block) to decide whether a picture element belongs to a static or nonstatic region. For dynamic background adaptation, the background pixel value is changed by ±1 out of 256 toward the new reconstructed signal value.…”

Section: Introductionmentioning

confidence: 99%

“…Hepper [24] modifies the technique by evaluating the change information of successive pictures to adapt new background information quickly. Owing to the dependency on block-based motion vectors [19]- [22] (or block-based processing [23], [24]) and lack of adaptability in multimodal backgrounds for dynamic environments, the background frame generation techniques in [19]- [24] could not perform well. Uncovered background can also be efficiently encoded using sprite or multiple-sprite [25] coding through object segmentation.…”

Section: Introductionmentioning

confidence: 99%

A Long-Term Reference Frame for Hierarchical B-Picture-Based Video Coding

Paul

Wang

Lau

et al. 2014

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Generally, H.264/AVC video coding standard with hierarchical bipredictive picture (HBP) structure outperforms the classical prediction structures such as "IPPP. . ." and "IBBP. . ." through better exploitation of data correlation using reference frames and unequal quantization setting among frames. However, multiple reference frames (MRFs) techniques are not fully exploited in the HBP scheme because of the computational requirement for B-frames, unavailability of adjacent reference frames, and with no explicit sorting of the reference frames for foreground or background being used. To exploit MRFs fully and explicitly in background referencing, we observe that not a single frame of a video is appropriate to be the reference frame as no one covers adequate background of a video. To overcome the problems, we propose a new coding scheme with the HBP, which uses the most common frame in scene (McFIS), generated by background modeling, as a long-term reference (LTR) frame for the third unipredictive reference frame, so that foreground and background areas are expected to be referenced from the two frames in the HBP structure and the McFIS, respectively. There are two approaches to generate McFIS under the proposed methodology. In the first approach, we generate a McFIS using a number of original frames of a scene in a video and then encode it as an I-frame with a higher quality. For the rest of the scene, this generated I-frame is used as an LTR frame. In the second approach, we generate an McFIS from the decoded frames and then use it as an LTR frame, without the need to encode the McFIS. The first and the second approaches are suitable for a video with static background and dynamic background, respectively. In general, the second approach requires more computational time than that of the the first approach. The experiments confirm that the proposed scheme outperforms three state-of-the-art algorithms by improving the image quality significantly with reduced computational time.Index Terms-Long-term reference (LTR) frame, most common frame in scene (McFIS), uncovered background, video coding.

show abstract

Uncovered Background Prediction in Interframe Coding

Cited by 24 publications

References 4 publications

Multi-Frame Motion-Compensated Prediction for Video Transmission

Multi-Frame Motion-Compensated Prediction for Video Transmission

Video Coding with Superimposed Motion-Compensated Signals

A Long-Term Reference Frame for Hierarchical B-Picture-Based Video Coding

Contact Info

Product

Resources

About