Abstract
An efficient partition search termination strategy suitable for high-quality encoding is proposed, which largely speeds up the encoder without sacrificing the quality. This is achieved using a partition search system. The partition search system constructs a partition search tree of an NxN encoding unit comprising multiple partition nodes to conduct a partition search. The system evaluates a partition node from the multiple partition nodes of the partition search tree. After a partition node is evaluated, the early termination checking is conducted by the system based on the information gathered during the partition evaluation. If the early termination criteria are met, the current partition size is decided as the final best choice, and all its child nodes are not searched and are removed from the search tree. Consequently, the system terminates the partition search in the current branch. However, if the early termination criteria are not met, the system goes back to evaluating the next partition node from the multiple partition nodes of the partition search tree until the early termination criteria is met or all nodes are checked.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Wang, Yunqing, "Early Termination In Partition Search for Encoding", Technical Disclosure Commons, (March 11, 2015)
https://www.tdcommons.org/dpubs_series/29