Sohel, Ferdous A.; Karmakar, Gour C.; Dooley, Laurence S. and Bennamoun, Mohammed
Due to copyright restrictions, this file is not available for public download
Click here to request a copy from the OU Author.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1109/TMM.2011.2182507|
|Google Scholar:||Look up in Google Scholar|
Traditionally the sliding window, (SW) has been employed in vertex-based operational rate distortion (ORD) optimal shape coding algorithms to ensure consistent distortion (quality) measurement and improve computational efficiency. It also regulates the memory requirements for an encoder design enabling regular, symmetrical hardware implementations. This paper presents a series of new enhancements to existing techniques for determining the best SW-length within a rate-distortion (RD) framework, and analyses the nexus between SW-length and storage for ORD hardware realisations. In addition, it presents an efficient bit-allocation strategy for managing multiple shapes together with a generalised adaptive SW scheme which integrates localised curvature information (cornerity) on contour points with a bi-directional spatial distance, to afford a superior and more pragmatic SW design compared with existing adaptive SW solutions which are based on only cornerity values. Experimental results consistently corroborate the effectiveness of these new strategies.
|Item Type:||Journal Article|
|Copyright Holders:||2012 IEEE|
|Keywords:||image processing; shape coding; sliding window|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications|
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||23 May 2012 14:29|
|Last Modified:||12 Dec 2012 08:19|
Actions (login may be required)
|Report issue / request change|