The Open UniversitySkip to content

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

Manoranjan, Paul; Murshed, M. and Dooley, Laurence (2003). A real time generic variable pattern selection algorithm for very low bit-rate video coding. In: IEEE International Conference on Image Processing (ICIP '03),, 14-17 September 2003, Barcelona.

Full text available as:
PDF (Not Set) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (286Kb)
DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Conference Item
ISSN: 1522-4880
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 11481
Depositing User: Laurence Dooley
Date Deposited: 28 Aug 2008 04:18
Last Modified: 25 Feb 2016 07:57
Share this page:


Scopus Citations

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340