Fast motion estimation using semi-hierarchical approach for the Dirac video codec
MUSP'08 Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing
Semi-hierarchical based motion estimation algorithm for the Dirac video encoder
WSEAS Transactions on Signal Processing
A search patterns switching algorithm for block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
A content-motion-aware motion estimation for quality-stationary video coding
EURASIP Journal on Advances in Signal Processing
Expert Systems with Applications: An International Journal
Block motion estimation using modified two-bit transform
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Block-based motion vector smoothing for periodic pattern region
ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
| Hi-index | 0.00 |
In this paper, a simple and effective fast block matching algorithm (BMA) is proposed, called adaptive irregular pattern search with matching prejudgment (AIPS-MP). In the AIPS-MP, a dynamic search pattern, adaptive irregular pattern (AIP), is constructed for each block based on its spatial and temporal neighboring motion vectors (MVs). The AIP is used to quickly identify the best center point for the follow-up refined search to effectively reduce unnecessary intermediate searches and avoid the search trapping at local-minimum matching error position. The construction of the AIP jointly takes the tradeoff of rate and distortion into consideration and favors the differential coding of MVs. The matching prejudgment (MP) is imbedded in the AIPS and exploits an adaptive threshold determined for each block based on the prediction error of the temporal neighboring block. The simulation results show that the proposed AIPS-MP consistently achieves very close, and sometimes even higher, peak signal-to-noise ratio (PSNR) than the full search, while achieving 167.6-871.5 times of speed-up or computational gain, measured in terms of the average number of search points per MV generation. It also greatly outperforms two well-referenced fast BMAs, the diamond search and the motion vector field adaptive search technique (MVFAST), adopted in the MPEG-4 Verification Model and the Optimization Model, respectively, on the average PSNR and the search speed.