DocumentCode
1950683
Title
Explicit bit minimization for motion-compensated video coding
Author
Hoang, Dzung T. ; Long, Philip M. ; Vitter, Jeffrey Scott
Author_Institution
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
fYear
1994
fDate
29-31 Mar 1994
Firstpage
175
Lastpage
184
Abstract
Compares methods for choosing motion vectors for motion-compensated video compression. The primary focus is on videophone and videoconferencing applications, where very low bit rates are necessary, where the motion is usually limited, and where the frames must be coded in the order they are generated. the authors provide evidence, using established benchmark videos of this type, that choosing motion vectors to minimize codelength subject to (implicit) constraints on quality yields substantially better rate-distortion tradeoffs than minimizing notions of prediction error. They illustrate this point using an algorithm within the p×64 standard. They show that using quadtrees to code the motion vectors in conjunction with explicit codelength minimization yields further improvement. They describe a dynamic-programming algorithm for choosing a quadtree to minimize the codelength
Keywords
data compression; dynamic programming; image coding; image sequences; minimisation; motion estimation; parameter estimation; tree data structures; video signals; bit rates; codelength minimisation; dynamic-programming algorithm; motion vectors; motion-compensated video coding; quadtrees; rate-distortion tradeoffs; video compression; videoconferencing; videophone; Application software; Bit rate; Computer science; Discrete cosine transforms; Heuristic algorithms; Minimization methods; Motion estimation; Rate-distortion; Video coding; Video compression;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1994. DCC '94. Proceedings
Conference_Location
Snowbird, UT
Print_ISBN
0-8186-5637-9
Type
conf
DOI
10.1109/DCC.1994.305925
Filename
305925
Link To Document