Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
An examination of block motion compensation algorithms for MPEG-2 and prediction of bit rates from video sequence measurements
This dissertation examines the following two problems: • Finding a block motion compensation algorithm which is optimum in performance and speed. • Predicting the performance, for complex sequences, of an MPEG-2 encoder. An optimum motion compensation algorithm can lead to optimum temporal compressi...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Electrical Engineering
2016
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | This dissertation examines the following two problems: • Finding a block motion compensation algorithm which is optimum in performance and speed. • Predicting the performance, for complex sequences, of an MPEG-2 encoder. An optimum motion compensation algorithm can lead to optimum temporal compression. For fixed bit-rate encoders finding methods to predict the bit-rate from properties of the video sequence can lead to an optimum use of the transmission bandwidth. The examination of motion compensation algorithms involved examining previous algorithms. Historically, one of three functions are used to evaluate a candidate motion vector, namely, Mean Square Error (MSE), Minimum Absolute Difference (MAD) and cross correlation. The ideal motion vector being the one that minimises MAD and MSE, and maximises cross-correlation. Sub-sampling, hierarchical and feature domain methods were examined. Finally some new algorithms are proposed and further areas of research suggested. The new algorithms suggested perform close to optimum, particularly those algorithms searching feature space. |
|---|