video compression – new motion

estimation algorithm
Implementation of new Motion
Estimation Algorithm
Alex Serebriany
Gil Peshes
Dr Shlomo Greenberg
 Video Compression I
* Video compression is vital for efficient
storage and transmission of digital signal
* uncompressed video sizes example:
1920x1080 1280x720 640x480 320x240
1 sec 0.19 0.08 0.03 0.01
1 min 11.20 4.98 1.66 0.41
1 hour 671.85 298.60 99.53 24.88
1000 hours 671,846.40 298,598.40 99,532.80 24,883.20
 Video compression II
* General purpose compressions :Huffman ,
Run Length Encoding
* Intraframe Compression :Sub-sampling ,
Vector quantization , Transform coding
* Interframe Compression :motion estimation
60% of the total computational time !
Motion Estimation
 DEFINITIONS
* PSNR - pick signal to noise ratio
* SAD – sum off absolute difference
* TIME PREDICTIVE ME
* SPATIAL PREDICTIVE ME
 A new motion estimation
algorithm - Predictive Quadrant
Propagating Algorithm “PQPA”
based on two previous algorithms
apdzs & acbsa was developed in
order to get a more efficient
encoding.
 The previous algorithms :

Apdzs-advanced Acbsa-advanced
predictive center biased
diamond zonal search
search algorithm
 APDZS
This algorithm is based on two main stages:
* Predictive determination of the block
search area according to neighboring
motion vectors & previous frame motion
vectors and adaptive threshold calculation.
* Diamond zonal search around the predicted
motion vector and around zero(0,0)
location.
 ACBSA
A center biased algorithm which implement a
reduced search around the block center,the
search is quadrant oriented and uses
decreasing amount of search point until it
converge.
Acbsa search pattern
Search pattern corresponding to
the selected quadrant
 APDZS STAGE 1
Predicting the search starting location by the
neighboring motion vectors & the previous
frame motion vectors.
In this stage there is also a half stop criterion
according to the adaptive threshold.
Apdzs stage 2 - Performing a
diamond zonal search
The predictive quadrant propagating
algorithm
* In the first stage we use the same predictive
determination of the block search area as in
the apdzs algorithm.
* In the second stage we perform a quadrant
propagating search which resembles the
acbsa search pattern.
Search pattern corresponding to
the selected quadrant

blue – first step

Choosing Quadrant by 3 points:
 Next Step(red)

If I quadrant was selected If other quadrant was selected

 The results
* From the table below we can see that the pqpa
algorithm is superior to the acbsa both in PSNR (1
db in avg)& in steps (1/3 of the steps (number of
SAD calculations) in avg).
*Relative to the pqp Apdzs have the same PSNR in
avg but has 50% more steps .
* The results were checked both for sif & qcif for
number of sequences in an 8x8 window search.
 Sequence FS ACBSA APDZS PQP
coastguard PSNR 29.56 24.59 29.50 29.52

steps 262.7 11.20 6.21 3.98

foreman PSNR 33.84 31.19 33.24 33.29
steps 262.1 11.72 5.96 3.84
monitor PSNR 35.81 35.35 35.76 35.75
steps 262.1 11.16 3.48 2.887
table PSNR 31.44 29.17 30.45 30.20
steps 262.1 11.41 4.89 3.470
 QCIF sequences (range +-8)
Sequence FS ACBSA APDZS PQP

grandma PSNR 40.1 39.33 40.09 40.08

steps 236.6 9.87 2.35 1.66

foreman PSNR 30.00 26.94 29.03 29.33

steps 236.6 10.46 7.65 4.42

PSNR
 Conclusions
* We presented here a new motion estimation
algorithm which yields a high quality
compressed sequences with low
complexity.
* This algorithm is yet to be examined in real
time conditions – c,dsp .
The end