Fast binary partition tree based variable-size block-matching for video coding

In this work, we develop a fast binary partition tree based variable size video coding system. New adaptive algorithms proposed herein are applied to a video encoder with binary partition trees. First, to reduce the computation for block-matching, an adaptive search area method is described which adjusts the searching region according to the size of each block. Second, an early termination method is introduced which terminates the binary partitioning process adaptively according to the statistics of the peak-signal-to-noise-ratio values during each step of block splitting. Third, we put forward a new model for fast rate-distortion (RD) estimation to decrease the computation of matching pursuit (MP) transform coding. Simulation results show that the proposed techniques provide significant gain in computation speed with little or no sacrifice of RD performance, when compared with non-adaptive binary partitioning scheme.