| Summary: | 碩士 === 國立臺灣科技大學 === 工程技術研究所 === 83 === Motion vector estimation and motion compensation play a key
role in the compression of image sequences. Among all motion
estimation algorithms, full search produces the best image
quality at the expense of very high computation complexity. In
this thesis, we try to reduce the computation complexity
involved in the estimation of motion vectors. We first estimate
the motion vectors of a frame using the subsample search
algorithm. For the succeeding frames,the motion vector of a
block is searched over the neighboring blocks of if in the same
frame or the block in the same location in the previous frame.
In most cases, the motion vector of a block is quickly
determined such that the error between the current block and
the reference block is acceptable. The experiments show that
the proposed image sequence coding scheme produced satisfactory
results. Another noteworthy thing is that the propored scheme
is compatible with MPEG I.
|
|---|
