Gain-shape optimized dictionary for matching pursuit video coding
Signal Processing
Efficient image representation by anisotropic refinement in matching pursuit
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Harmonic decomposition of audio signals with matching pursuit
IEEE Transactions on Signal Processing
Uncertainty principles and ideal atomic decomposition
IEEE Transactions on Information Theory
A generalized uncertainty principle and sparse representation in pairs of bases
IEEE Transactions on Information Theory
On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
IEEE Transactions on Information Theory
In-loop atom modulus quantization for matching pursuit and its application to video coding
IEEE Transactions on Image Processing
Video compression using matching pursuits
IEEE Transactions on Circuits and Systems for Video Technology
Matching pursuit video coding .I. Dictionary approximation
IEEE Transactions on Circuits and Systems for Video Technology
Matching-pursuit video coding .II. Operational models for rate and distortion
IEEE Transactions on Circuits and Systems for Video Technology
Overview of the H.264/AVC video coding standard
IEEE Transactions on Circuits and Systems for Video Technology
Low-complexity transform and quantization in H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Circuits and Systems for Video Technology
Image compression using an edge adapted redundant dictionary and wavelets
Signal Processing - Sparse approximations in signal and image processing
Sparse representations for spatial prediction and texture refinement
Journal of Visual Communication and Image Representation
MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
Hi-index | 0.00 |
Hybrid video coding combines together two stages: first, motion estimation and compensation predict each frame from the neighboring frames, then the prediction error is coded, reducing the correlation in the spatial domain. In this work, we focus on the latter stage, presenting a scheme that profits from some of the features introduced by the standard H.264/AVC for motion estimation and replaces the transform in the spatial domain. The prediction error is so coded using the matching pursuit algorithm which decomposes the signal over an appositely designed bidimensional, anisotropic, redundant dictionary. Comparisons are made among the proposed technique, H.264, and a DCT-based coding scheme. Moreover, we introduce fast techniques for atom selection, which exploit the spatial localization of the atoms. An adaptive coding scheme aimed at optimizing the resource allocation is also presented, together with a rate-distortion study for the matching pursuit algorithm. Results show that the proposed scheme outperforms the standard DCT, especially at very low bit rates.