The new generation of high efficiency video coding standard (HEVC), although remarkably improves the compression performance, it increases the computational complexity of coding for Screen Content Coding (SCC). Therefore, how to reduce the coding complexity becomes an important task in HEVC optimization. In this work, the process of quad-tree recursive partitioning has been studied, and the relationship between the coding cost and the mother block and child block has been found in statistics way, and an improved fast early termination coding unit partition based on the cost of the coding unit has been proposed. The experiment results show that the fast algorithm proposed in this paper can save 31.37% of the encoding time at the cost of reduces the coding performance by about 1.02 %.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.