A recursive full search algorithm based on temporal correlation (Q5958664)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A recursive full search algorithm based on temporal correlation |
scientific article; zbMATH DE number 1715705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A recursive full search algorithm based on temporal correlation |
scientific article; zbMATH DE number 1715705 |
Statements
A recursive full search algorithm based on temporal correlation (English)
0 references
3 March 2002
0 references
Although many fast searching algorithms for motion estimations aim at reducing the computational complexity, the optimal accuracy is hardly achieved. Hence these methods are not suitable for bit-rate constrained environments. Due to a lack of regularity, VLSI implementation of these algorithms is not easy. In this study, we propose a new adaptive full search algorithm using the temporal correlation method and iterative layer process. Our algorithm is useful for decreasing the computational complexity and achieves an optimal level of accuracy. Simulations demonstrate that our method can at least halve the computational complexity for full search estimation.
0 references
full search
0 references
motion estimation
0 references
temporal correlation
0 references
accuracy
0 references
regularity
0 references
bit-rate constrained environments
0 references
computational complexity
0 references
0.8165955
0 references
0.8100449
0 references
0.8083669
0 references
0.8005808
0 references
0.8004106
0 references
0.79778785
0 references