Combining multiple-candidate search with one-bit transform for motion estimation
|Authors||Wong, Peter H.W.
Au, Oscar C.
|Source||Digest of technical papers - IEEE International Conference on Consumer Electronics, 1998, p. 134-135|
|Summary||Motion estimation using one-bit information (1BT) to represent a pixel or a group of pixels becomes popular in recently years [1-2] as the distortion function between the reference block and the search block can be computed very efficiently. In , each frame is filtered and compared with the original frame to extract the edge information. However, its performance is not good enough as it degrades the predicted image by IdB on the average comparing with full search. In this paper, we improve the performance using the results of one-bit transform as the initial estimate of the motion vector, and use re-examination strategies to find the final motion vector. Experiment results show that the proposed method improves the performance of the one-bit transform by up to 0.9 dB and outperforms many other motion estimation algorithms such as the Three-Step Search (3SS), New Three-Step Search (N3SS) and the Four-Step Search (4SS).|
|Rights||© 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
View full-text via Scopus
Files in this item: