18 search results - page 2 / 4 » An improved variable-size block-matching algorithm |
ICIP
1994
IEEE
13 years 11 months ago
1994
IEEE
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N
MTA
2007
13 years 6 months ago
2007
In this paper, we proposed an improved “bottom-up” variable-size block matching method. Different from previous work, the proposed method does not need any threshold during th...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
ISCAS
2005
IEEE
14 years 29 days ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
TIP
2002
13 years 7 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...