By Topic

A real time generic variable pattern selection algorithm for very low bit-rate video coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
M. Paul ; Gippsland Sch. of Comput. & IT, Monash Univ., Churchill, Vic., Australia ; M. Murshed ; L. Dooley

The selection of an optimal regular-shaped pattern set for very low bit-rate video coding, focusing on moving regions has been the objective of much recent research in order to try and improve bit-rate efficiency. Selecting the optimal pattern set however, is an NP hard problem. This paper presents a generic variable pattern selection (GVPS) algorithm, which introduces a pattern selection parameter that is able to control the performance in terms of computational complexity as well as bit-rate and picture quality. While using a sub-optimal variable pattern set, GVPS obtains a coding performance comparable to near-optimal algorithms, such as the k-change neighbourhood solution, while being much less computationally intensive, so that it is able to process all types of video sequences in real-time, with minimal pre-processing overheads.

Published in:

Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on  (Volume:3 )

Date of Conference:

14-17 Sept. 2003