Name
Abstract | ||
|---|---|---|
Although many fast motion estimation algorithms for video coding such as H.261/3 and MPEG1 have been proposed, coding algorithms such as MPEG2 involve much larger search windows due to larger picture size and different coding structures. In this paper, we propose a novel fast motion estimation algorithm using ripple-shaped search. In the proposed algorithm, an initial, search point is determined using motion vector information of neighboring macroblocks, then a ripple-shaped search and four-step search (4SS) are used for macro and micro search, respectively. In addition, a break line method is employed to reduce the number of the mean absolute difference (MAD) calculations within a macroblock. Although 4SS can achieve almost the same speed up factors as the proposed algorithm, the PSNR performance of video coding at 4 and 10 Mbit/s by our algorithm is much better than that of a 4SS and is very close to that of full search |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/ISCAS.1999.779978 | Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium |
Keywords | Field | DocType |
computational complexity,motion estimation,video coding,MPEG2 video,PSNR performance,break line method,coding structures,four-step search,macroblocks,mean absolute difference,motion estimation algorithm,picture size,ripple-shaped search,search windows,video coding | Macroblock,Computer vision,Block-matching algorithm,Quarter-pixel motion,Coding tree unit,Computer science,Motion compensation,Artificial intelligence,Motion estimation,Rate–distortion optimization,Motion vector | Conference |
Volume | ISBN | Citations |
4 | 0-7803-5471-0 | 1 |
PageRank | References | Authors |
0.48 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuyuki Nakajima | 1 | 147 | 23.31 |
| Akio Yoneyama | 2 | 117 | 17.49 |
| Masaru Sugano | 3 | 43 | 9.24 |
| Hiromasa Yanagihara | 4 | 33 | 7.26 |