Multi-framc motion compensation improves the rate-distortion performancc substantially but introduces much higher loading to the system. Without considering temporal correlations, convcntional singlc-frame block-matching algorithms can bc used to search multiple frames in a rather inefficient frame-by-framc way. In order to exploit the motion characteristic in long-term memory, a multi-frame extension of the wcll-known cross-diamond scarch algorithm is proposcd. Unlike thosc algorithms that evenly scarch each reference frame, our algorithm adopts a novel recent-biased spiral-cross search pattem to sub-sample the 3-dimensional mcmory space as a whole. This approach significantly boosts the efficiency ofthe block-matching process. Two new tcc...
Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated vi...
: A new fast search algorithm for block matching motion estimation is presented in this paper. The n...
Block motion estimation using full search is computationally intensive, many fast algorithm have pro...
Abstract-A fast block matching algorithm for motion estimation is presented. It is based on a logari...
We present an adaptive algorithm that finds the best block-matching results in a computationally con...
In this paper, we propose a kite-cross-diamond search (KCDS) algorithm, which is an improved version...
Abstract—Two new fast full search (FFS) methods are proposed which can improve the performance of th...
2006 49th Midwest Symposium on Circuits and Systems, MWSCAS'06, San Juan, 6-9 August 2007Two new fas...
Full search block matching algorithm (FSBMA) for motion estimation requires a high level of computat...
Estimation itself consumes more than half of the coding time to encode. To reduce the computational ...
Abstract- Motion estimation is one of the most computational- where fr(i,j) = sample of the referen...
xiv, 103 leaves : ill. (some col.) ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M EIE 2007 KamBlo...
The block-matching motion estimation (BME) is one of the most commonly used techniques for digital v...
Abstract—This paper proposes an efficient block-matching motion estimation algorithm, called cross d...
Multi-frame motion estimation introduced in recent video standards such as H.264/AVC, helps to impro...
Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated vi...
: A new fast search algorithm for block matching motion estimation is presented in this paper. The n...
Block motion estimation using full search is computationally intensive, many fast algorithm have pro...
Abstract-A fast block matching algorithm for motion estimation is presented. It is based on a logari...
We present an adaptive algorithm that finds the best block-matching results in a computationally con...
In this paper, we propose a kite-cross-diamond search (KCDS) algorithm, which is an improved version...
Abstract—Two new fast full search (FFS) methods are proposed which can improve the performance of th...
2006 49th Midwest Symposium on Circuits and Systems, MWSCAS'06, San Juan, 6-9 August 2007Two new fas...
Full search block matching algorithm (FSBMA) for motion estimation requires a high level of computat...
Estimation itself consumes more than half of the coding time to encode. To reduce the computational ...
Abstract- Motion estimation is one of the most computational- where fr(i,j) = sample of the referen...
xiv, 103 leaves : ill. (some col.) ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M EIE 2007 KamBlo...
The block-matching motion estimation (BME) is one of the most commonly used techniques for digital v...
Abstract—This paper proposes an efficient block-matching motion estimation algorithm, called cross d...
Multi-frame motion estimation introduced in recent video standards such as H.264/AVC, helps to impro...
Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated vi...
: A new fast search algorithm for block matching motion estimation is presented in this paper. The n...
Block motion estimation using full search is computationally intensive, many fast algorithm have pro...