Multiresolution motion estimation and compensation for video coding
Discrete Wavelet Transform; motion
estimation; multiresolution domain; video coding.
Recently, the quantity of data has known a big
evolution especially with the emergence of many video
evolution especially with the emergence of many video
applications over networks such as the videophone and the
videoconferencing, and multimedia devices such as the highdefinition
TV and the personal digital assistants. So, it was
crucial to reduce the quantity of data stored or transmitted by
compressing it spatially and temporally. Hence, motion
estimation and compensation are employed in video coding
systems to remove temporal redundancy while keeping a high
visual quality. They are the most important parts of the video
coding process since they require the most computational power
and the biggest consumption in resources and bandwidth.
Therefore, many techniques have been developed to estimate
motion between successive frames. In this paper, we will present
our motion estimation and compensation method applied on the
discrete wavelet transform coefficients and based on the block
matching algorithm which is the simplest, the most efficient and
the most popular technique. Additional techniques are
introduced to accelerate the estimation process and improve the
prediction quality.
4 views
Seen by:How are digital TV programs compressed to allow broadcasting?
Book chapter in "Applied Signal Processing: A MATLAB™-Based Proof of Concept", ed. Thierry Dutoit and Ferran Marques, Springer US, 2009. Co-authored with Ferran Marqués and Javier Ruiz-Hidalgo.
In 1982, the CCIR defined a standard for encoding interlaced analogue video signals in digital form mainly for studio... more In 1982, the CCIR defined a standard for encoding interlaced analogue video signals in digital form mainly for studio applications. The current name of this standard is ITU-R BT.601 (ITU 1983). Following this standard, a video signal sampled at 13.5 MHz with a 4:2:2 sampling format (double the number of samples for the luminance component than for the two chrominance components) and quantized with 8 bits per component produces a raw bit rate of 216 Mbps. This rate can be reduced by removing the blanking intervals present in the interlaced analogue signal leading to a bit rate of 166 Mbps, which is still a figure far above the main capacity of usual transmission channels or storage devices.
Analysis and coding of visual objects: new concepts and new tools
Ph.D. thesis presented to the Instituto Superior Técnico - Universidade Técnica de Lisboa, Lisbon, Portugal, in 1999.
Video coding has been under intense scrutiny during the last years. The published international standards rely on... more
Video coding has been under intense scrutiny during the last years. The published international standards rely on low-level vision concepts, thus being first-generation. Recently standardization started in second-generation video coding, supported on mid-level vision concepts such as objects.
This thesis presents new architectures for second-generation video codecs and some of the required analysis and coding tools.
The graph theoretic foundations of image analysis are presented and algorithms for generalized shortest spanning tree problems are proposed. In this light, it is shown that basic versions of several region-oriented segmentation algorithms address the same problem. Globalization of information is studied and shown to confer different properties to these algorithms, and to transform region merging in recursive shortest spanning tree segmentation (RSST). RSST algorithms attempting to minimize global approximation error and using affine region models are shown to be very effective. A knowledge-based segmentation algorithm for mobile videotelephony is proposed.
A new camera movement estimation algorithm is developed which is effective for image stabilization and scene cut detection. A camera movement compensation technique for first-generation codecs is also proposed.
A systematization of partition types and representations is performed with which partition coding tools are overviewed. A fast approximate closed cubic spline algorithm is developed with applications in partition coding.
27 views
Seen by:
