Name
Abstract | ||
|---|---|---|
The conventional motion estimation algorithms used in digital television coding can roughly be classified into two categories, namely the block-matching method and the recursive method. Each of them has its own strong points. In this paper, a new type of block-based motion estimation algorithm is presented, which is based on the block-recursive (gradient) method and makes use of some of the merits of the block-matching method. For a moderate translational motion, motion estimation with a subpel precision can conveniently be obtained with only a couple of recursive searches, and for a violent or complicated motion which cannot be estimated by any block-based algorithm, the local minimum of prediction errors can always be found. Our experiments show that the proposed algorithm is efficient and reliable, and obviously superior to the conventional block-recursive algorithms and the fast block-matching algorithms. The performance of the proposed algorithm tends almost to the optimum of the full search algorithm with the same estimation precision, but the computational effort is much less than that of the full search algorithm. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0923-5965(92)90035-E | Sig. Proc.: Image Comm. |
Keywords | Field | DocType |
motion-compensated prediction,motion estimation | Gradient method,Quarter-pixel motion,Search algorithm,Ramer–Douglas–Peucker algorithm,Computer science,Algorithm,Coding (social sciences),Motion estimation,Population-based incremental learning,Recursion | Journal |
Volume | Issue | ISSN |
4 | 6 | Signal Processing: Image Communication |
Citations | PageRank | References |
8 | 2.11 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kan Xie | 1 | 10 | 3.10 |
| Luc Van Eycken | 2 | 36 | 8.87 |
| André Oosterlinck | 3 | 27 | 18.19 |