A Low-Complexity Up-Sampling Technique for H.264
Date Issued
2010
Date
2010
Author(s)
Chen, Wei-Chi
Abstract
High resolution image/video techniques are developed rapidly, it means they need more accuracy sensors to acquire images/videos and more capacity to store the data. They are usually expensive and not everyone can afford them. So the technique which can enhance the low resolution image(s) to higher one called “super-resolution” is quite important and many researches and algorithms were proposed in recent decades.
Now, the popular video specification H.264/AVC which developed by Joint Video Team (JVT, organized by ISO and ITU-T) at 2003 was used to many applications. H.264/AVC is not like the traditional block-based video CODEC using fixed block size, it use the variable block size to make motion prediction and compensation more accuracy to reduce the coding redundancy and enhance compression rate. In this paper, we propose an approach “Variable block size super resolution” which focus the variable block size and predicted mode of H.264/AVC can base on different content into block to choose corresponding super-resolution algorithms. It can decrease whole complexity and make the up-sampling more efficient. This work first categorizes each block into several types: key blocks, complex motion vector blocks and constant blocks, then enhances more quality for the areas are interesting by human vision. This content adaptive strategy can reduce computational time and preserve acceptable visual quality. Experimental results are given to the efficiency of the proposed approach.
Subjects
Super-resolution
up-sampling
Variable block size
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-99-R97944006-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):9a75807f00367fe83310d48311cc5eed