FAST OVERLAPPED BLOCK MOTION COMPENSATION WITH CHECKERBOARD BLOCK PARTITIONING

The overlapped block motion compensation (OBMC) scheme provides an eff ective way to reduce blocking artifacts in video coding. However, in c omparison with the traditional block motion compensation (BMC), its co mplexity of motion estimation increases significantly due to the inter dependency of motion vectors. In this work, a new fast motion estimati on algorithm is proposed for OBMC based on the checkerboard block part itioning and grouping in encoding. This algorithm, called the grouped OBMC (GOBMC), effectively decorrelates dependency among OBMC motion ve ctors and facilitates the search process, In comparison with tradition al iterative OBMC motion search, GOBMC performs motion estimation only once per macroblock at the encoder, and reaches a local optimal solut ion with degradation of 0.05-0.1 dB, At the decoding end, we also prop ose a fast OBMC reconstruction scheme which reduces the complexity of multiplication to 38% of that of traditional OBMC reconstruction while preserving the same visual quality as obtained via BMC search with OB MC reconstruction.