Document Type


Date of Award

Fall 10-31-1996

Degree Name

Doctor of Philosophy in Electrical Engineering - (Ph.D.)


Electrical and Computer Engineering

First Advisor

Yun Q. Shi

Second Advisor

Joseph Frank

Third Advisor

Edwin Hou

Fourth Advisor

Zoran Siveski

Fifth Advisor

Daochuan Hung


Over the last ten years. research on the analysis of visual motion has come to play a key role in the fields of data compression for visual communication as well as computer vision. Enormous efforts have been made on the design of various motion estimation algorithms.

One of the fundamental tasks in motion estimation is the accurate measurement of 2-D dense motion fields. For this purpose. we devise and present in this dissertation a multiattribute feedback computational framework. In this framework for each pixel in an image. instead of a single image intensity. multiple image attributes are computed as conservation information. To enhance the estimation accuracy. feedback technique is applied. Besides. the proposed algorithm needs less differentiation and thus is more robust to various noises. With these features. the estimation accuracy is improved considerably. Experiments have demonstrated that the proposed algorithm outperforms most of the existing techniques that compute 2-D dense motion fields in terms of accuracy.

The estimation of 2-D block motion vector fields has been dominant among techniques in exploiting the temporal redundancy in video coding owing to its straightforward implementation and reasonable performance. But block matching is still a computational burden in real time video compression. Hence. efficient block matching techniques remain in demand. Existing block matching methods including full search and multiresolution techniques treat every region in an image domain indiscriminately no matter whether the region contains complicated motion or not. Motivated from this observation. we have developed two thresholding techniques for block matching in video coding. in which regions experiencing relatively uniform motion are withheld from further processing via thresholfing. thus saving compu­tation drastically. One is a thresholding multiresolution block matching. Extensive experiments show that the proposed algorithm has a consistent performance for sequences with different motion complexities. It reduces the processing time ranging from 14% to 20% while maintaining almost the same quality of the reconstructed image (only about 0.1 dB loss in PSNR). compared with the fastest existing multiresolution technique. The other is a thresholding hierarchical block matching where no pyramid is actually formed. Experiments indicate that for sequences with less motion such as videoconferencing sequences. this algorithm works faster and has much less motion vectors than the thresholding multiresolution block matching method.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.