A Framework of Complexity Optimally Scalable Algorithms for HEVC

Different from conventional profiles in the state-of-the-art video coding standard HEVC and related optimization methods, we focus on building the optimally scalable algorithms under constrained and varying computational capacity to take full advantages of HEVC as far as possible in order to meet the growing demands of computational capacity adaptive applications such as real-time video communication and video coding on different mobile devices. We propose a video coding framework based on priority order for a special profile and give the general thoughts of designing algorithms by utilizing cost-performance as priority. For the framework, we invent a feasible solution by introducing a three-level coding structure and some novel features that express the relationship between video contents and their priorities. Experimental results partially prove our framework may nearly achieve the optimal coding efficiency under the continuously changeable computing limitations at every time with negligible extra time consuming.