Paul, M.; Murshed, M. and Dooley, L. S.
|Google Scholar:||Look up in Google Scholar|
Research into pattern representation of moving regions in blocked-based motion estimation and compensation in video sequences has focused mainly upon using a fixed number of regular shaped patterns. Recently we presented the Variable Pattern Selection (VPS) algorithm, which selects a preset number of best-matched patterns from a pattern codebook of regular shaped patterns. The pattern elimination technique in the selection process of the VPS algorithm however, was to be computationally expensive, especially when the preset number is low. In this paper, the concept is extended to develop the Extended Variable Pattern Selection (EVPS) algorithm where the pattern elimination technique is replaced with a fast solution. The complexity analysis confirms that this algorithm can be as much as 8.5 times faster than the VPS algorithm. In order to take advantage of this computational speed-up in eliminating patterns, the pattern codebook size of the EVPS algorithm has also been increased to 32.
|Item Type:||Conference Item|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||13 Aug 2009 10:57|
|Last Modified:||15 Jan 2016 11:26|
|Share this page:|