Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/146395
DC Field | Value | |
---|---|---|
dc.title | Correlation based search algorithms for motion estimation | |
dc.contributor.author | Alkanhal M. | |
dc.contributor.author | Turaga D. | |
dc.contributor.author | Chen T. | |
dc.date.accessioned | 2018-08-21T05:12:18Z | |
dc.date.available | 2018-08-21T05:12:18Z | |
dc.date.issued | 1999 | |
dc.identifier.citation | Alkanhal M., Turaga D., Chen T. (1999). Correlation based search algorithms for motion estimation. Picture Coding Symposium 1999 : 99-102. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/146395 | |
dc.description.abstract | The measure of the 'goodness' of a motion estimation algorithm is governed by it's speed, the quality of motion compensation it provides, and the size of the resulting bitstream. Hence, algorithms should be evaluated based on this 'speed-quality-bitrate' tradeoff. Previously introduced fast motion estimation algorithms focus mainly on the speed vs. quality of motion compensation. In this paper, we introduce several new algorithms and evaluate them based on all three parameters. All these new algorithms exploit spatial correlation of motion vectors. These algorithms include a MAD (Mean Absolute Distortion) based spiral search, an Adaptive Window Size algorithm and two Majority Voting schemes. The algorithms are evaluated on several test sequences in the H.263 framework and the results obtained are very encouraging. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | OFFICE OF THE PROVOST | |
dc.contributor.department | DEPARTMENT OF COMPUTER SCIENCE | |
dc.description.sourcetitle | Picture Coding Symposium 1999 | |
dc.description.page | 99-102 | |
dc.published.state | published | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.