Show simple item record

dc.contributor.authorGuenter, Brian K.
dc.contributor.authorYun, Hee Cheol
dc.contributor.authorMersereau, Russell M.
dc.date.accessioned2004-11-12T14:56:47Z
dc.date.available2004-11-12T14:56:47Z
dc.date.issued1993
dc.identifier.urihttp://hdl.handle.net/1853/3610
dc.description.abstractThis paper presents a new lossless compression algorithm for computer animation image sequences. The algorithm uses transformation information available in the animation script and floating point depth and object number information stored at each pixel to perform highly accurate motion prediction with very low computation. The geometric data, i.e., the depth and object number, is very efficiently compressed using motion prediction and a new technique called direction coding, typically to 1 to 2 bits per pixel. The geometric data is also useful in z-buffer image compositing and this new compression algorithm offers a very low storage overhead method for saving the information needed for zbuffer image compositing. The overall compression ratio of the new algorithm, including the geometric data overhead, is compared to conventional spatial linear prediction compression and is shown to be consistently better, by a factor of 1.4 or more, even with large frame-to-frame motion.en
dc.format.extent207432 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technologyen
dc.relation.ispartofseriesGVU Technical Report;GIT-GVU-93-03
dc.subjectCompressionen
dc.subjectComputer animationen
dc.subjectComputer graphicsen
dc.subjectMotion predictionen
dc.titleMotion Compensated Compression of Computer Animation Framesen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record