New fast and efficient two-step search algorithm for block motion estimation
| Autor: | Fang-Hsuan Cheng, San-Nan Sun |
|---|---|
| Rok vydání: | 1999 |
| Předmět: |
Decimation
Mean squared error Computational complexity theory business.industry ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Motion vector Quarter-pixel motion Search algorithm Motion estimation Media Technology Computer vision Artificial intelligence Electrical and Electronic Engineering business Mathematics Block (data storage) |
| Zdroj: | IEEE Transactions on Circuits and Systems for Video Technology. 9:977-983 |
| ISSN: | 1051-8215 |
| DOI: | 10.1109/76.795049 |
| Popis: | Block motion estimation using full search is computationally intensive. Previously proposed fast algorithms reduce the computation by limiting the number of searching locations. This is accomplished at the expense of less accuracy of motion estimation and gives rise to an appreciably higher mean squared error (MSE) for motion compensated images. We present a new fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS) algorithm. The proposed algorithms are based on the ideas of the dithering pattern for pixel decimation, multiple-candidate for pixel-decimation-based full search, and center-based distribution of the motion vector. From the experimental results, the proposed algorithm is superior to the TSS in both quality performance (about 0.2 dB) and computational complexity (about half). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|