A Fast Binary Pyramid Motion estiamtion (FBPME0 algorithm is presented in this paper. The proposed FBPME shceme is based on the representation of set of binary features in terms of multiresolution layers, XOR Boolean block matching and N-scale tiling search sechee. Each video frame is converted into a pyramid structure of K-1 binary layers with resolution decimation plus one integer layer at the lowest resolution. At the lowest resolution layer, the N-scale tiling search is performed to select initial motion vector candidates. Motion vector fields are gradually refined with the XOR Boolean block matching criterion and the N-scale tiling search schemes in higher binary layers. FBPME performs several thousands times faster than the conventional full search block matching scheme at the same PSNR performance and visual quality. It also dramatically reduces the bus bandwidth and on-chip memory requirement. Moreover, hardware complexity is low due to its binary nature.
展开▼
