Video coding with motion-compensated lifted wavelet transforms

Flierl, Markus; Girod, Bernd

doi:10.1016/j.image.2004.05.002

Cited by 70 publications

(61 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the latter, each frame is firs wavelet transformed in the spatial domain, followed by MCTF. Representative examples of MCTF implementations are [25], [26] and [27]. These approaches can be described as separable because spatial and temporal filterin are applied in separate steps.…”

Section: B Related Workmentioning

confidence: 99%

Directional Transforms for Video Coding Based on Lifting on Graphs

Martinez-Enriquez

Cid-Sueiro

Díaz-de-María

et al. 2018

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Abstract-In this work we describe and optimize a general scheme based on lifting transforms on graphs for video coding. A graph is constructed to represent the video signal. Each pixel becomes a node in the graph and links between nodes represent similarity between them. Therefore, spatial neighbors and temporal motion-related pixels can be linked, while nonsimilar pixels (e.g., pixels across an edge) may not be. Then, a lifting-based transform, in which filterin operations are performed using linked nodes, is applied to this graph, leading to a 3-dimensional (spatio-temporal) directional transform which can be viewed as an extension of wavelet transforms for video. The design of the proposed scheme requires four main steps: (i) graph construction, (ii) graph splitting, (iii) filte design, and (iv) extension of the transform to different levels of decomposition. We focus on the optimization of these steps in order to obtain an effective transform for video coding. Furthermore, based on this scheme, we propose a coefficien reordering method and an entropy coder leading to a complete video encoder that achieves better coding performance than a motion compensated temporal filterin wavelet-based encoder and a simple encoder derived from H.264/AVC that makes use of similar tools as our proposed encoder (reference software JM15.1 configu ed to use 1 reference frame, no subpixel motion estimation, 16 × 16 inter and 4 × 4 intra modes).

show abstract

Section: B Related Workmentioning

confidence: 99%

Directional Transforms for Video Coding Based on Lifting on Graphs

Martinez-Enriquez

Cid-Sueiro

Díaz-de-María

et al. 2018

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

show abstract

“…In general, the output rates provided by (8) are irregularly spaced along the rate axes, as shown in Fig. 5(a) for .…”

Section: B Distortion-rate Function Employing Emdsq Over Packet-lossmentioning

confidence: 99%

“…Since transmission occurs by means of packets of a given size (in bits) , we are only interested in points having output rates evenly distributed with step . Therefore, we need to interpolate the values from (8) to obtain the desired sampling of (9) An example of such a function is given in Fig. 5(b) for and .…”

Section: B Distortion-rate Function Employing Emdsq Over Packet-lossmentioning

confidence: 99%

“…In this context, state-of-the-art SVC techniques [3]- [7] abandoned the classic closed-loop predictive architecture [1], [2] in favor of the open-loop architecture [4], wherein motion compensated temporal filtering (MCTF) [8] and spatial multiresolution decomposition are combined with embedded coding. MCTF-based techniques provide full scalability and deliver compression performances superior to closed-loop SVC [8] and competitive against state-of-the-art nonscalable coding on a wide range of bit rates [9].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Embedded Multiple Description Coding of Video

Verdicchio

Munteanu

Gavrilescu

et al. 2006

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

Abstract-Real-time delivery of video over best-effort errorprone packet networks requires scalable erasure-resilient compression systems in order to 1) meet the users' requirements in terms of quality, resolution, and frame-rate; 2) dynamically adapt the rate to the available channel capacity; and 3) provide robustness to data losses, as retransmission is often impractical. Furthermore, the employed erasure-resilience mechanisms should be scalable in order to adapt the degree of resiliency against transmission errors to the varying channel conditions. Driven by these constraints, we propose in this paper a novel design for scalable erasure-resilient video coding that couples the compression efficiency of the open-loop architecture with the robustness provided by multiple description coding. In our approach, scalability and packet-erasure resilience are jointly provided via embedded multiple description scalar quantization. Furthermore, a novel channel-aware rate-allocation technique is proposed that allows for shaping on-the-fly the output bit rate and the degree of resiliency without resorting to channel coding. As a result, robustness to data losses is traded for better visual quality when transmission occurs over reliable channels, while erasure resilience is introduced when noisy links are involved. Numerical results clearly demonstrate the advantages of the proposed approach over equivalent codec instantiations employing 1) no erasure-resilience mechanisms, 2) erasure-resilience with nonscalable redundancy, or 3) data-partitioning principles.Index Terms-Multiple description coding, packet erasure resilience, scalable video coding.

show abstract

“…Motion-compensated filtering in [2] addresses the problem of double-connected pixels and proposes an ad-hoc method to resolve the ambiguity. [3], [4], [5] choose a lifting implementation for the temporal filter and incorporate motion compensation into the lifting steps. In contrast to previous work, the lifting implementation permits a reversible filter structure, but still, it struggles with unconnected, connected, and multi-connected pixels when performing the update step.…”

Section: Introductionmentioning

confidence: 99%

A Motion-Compensated Orthogonal Transform with Energy-Concentration Constraint

Flierl¹,

Girod²

2006

2006 IEEE Workshop on Multimedia Signal Processing

Self Cite

View full text Add to dashboard Cite

Abstract-This paper discusses a transform for successive pictures of an image sequence which strictly maintains orthogonality while permitting motion compensation between pairs of pictures. The well known motion-compensated lifted Haar wavelet maintains orthogonality only approximately. In the case of zero motion fields, the motion-compensated lifted Haar wavelet is known to be orthogonal. But for complex motion fields with many multi-connected and unconnected pixels, the motioncompensated lifted Haar wavelet cannot accurately maintain its transform property and, hence, suffers a performance degradation. The presented motion-compensated orthogonal transform strictly maintains orthogonality for any motion field. Further, the transform is designed with an energy-concentration constraint. The energy of the input pictures is accumulated in the temporal low-band while the temporal high-band is zero if the input pictures are identical up to a known single-connecting motion field. This constraint makes the transform suitable for coding applications.

show abstract

Video coding with motion-compensated lifted wavelet transforms

Cited by 70 publications

References 55 publications

Directional Transforms for Video Coding Based on Lifting on Graphs

Directional Transforms for Video Coding Based on Lifting on Graphs

Embedded Multiple Description Coding of Video

A Motion-Compensated Orthogonal Transform with Energy-Concentration Constraint

Contact Info

Product

Resources

About