Complexity scalable motion-compensated temporal filtering

Tom Clerckx; Fabio Verdicchio; Adrian Munteanu; Yiannis Andreopoulos; Harald Devos; Hendrik Eeckhaut; Mark Christiaens; Dirk Stroobandt; Diederik Verkest; Peter Schelkens

doi:10.1117/12.559534

2 November 2004 Complexity scalable motion-compensated temporal filtering

Tom Clerckx, Fabio Verdicchio, Adrian Munteanu, Yiannis Andreopoulos, Harald Devos, Hendrik Eeckhaut, Mark Christiaens, Dirk Stroobandt, Diederik Verkest, Peter Schelkens

Author Affiliations +

Proceedings Volume 5558, Applications of Digital Image Processing XXVII; (2004) https://doi.org/10.1117/12.559534
Event: Optical Science and Technology, the SPIE 49th Annual Meeting, 2004, Denver, Colorado, United States

Abstract

Computer networks and the internet have taken an important role in modern society. Together with their development, the need for digital video transmission over these networks has grown. To cope with the user demands and limitations of the network, compression of the video material has become an important issue. Additionally, many video-applications require flexibility in terms of scalability and complexity (e.g. HD/SD-TV, video-surveillance). Current ITU-T and ISO/IEC video compression standards (MPEG-x, H.26-x) lack efficient support for these types of scalability. Wavelet-based compression techniques have been proposed to tackle this problem, of which the Motion Compensated Temporal Filtering (MCTF)-based architectures couple state-of-the-art performance with full (quality, resolution, and frame-rate) scalability. However, a significant drawback of these architectures is their high complexity. The computational and memory complexity of both spatial domain (SD) MCTF and in-band (IB) MCTF video codec instantiations are examined in this study. Comparisons in terms of complexity versus performance are presented for both types of codecs. The paper indicates how complexity scalability can be achieved in such video-codecs, and analyses some of the trade-offs between complexity and coding performance. Finally, guidelines on how to implement a fully scalable video-codec that incorporates quality, temporal, resolution and complexity scalability are proposed.

Citation Download Citation

Tom Clerckx, Fabio Verdicchio, Adrian Munteanu, Yiannis Andreopoulos, Harald Devos, Hendrik Eeckhaut, Mark Christiaens, Dirk Stroobandt, Diederik Verkest, and Peter Schelkens "Complexity scalable motion-compensated temporal filtering", Proc. SPIE 5558, Applications of Digital Image Processing XXVII, (2 November 2004); https://doi.org/10.1117/12.559534

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available