TY - JOUR

T1 - SPC

T2 - Fast and Efficient Scalable Predictive Coding of Animated Meshes

AU - Stefanoski, Nikolče

AU - Ostermann, Jörn

N1 - Funding Information: This work is partly supported by the EC within FP6 underGrant 511568 with the acronym 3DTV. The authors wouldlike to thank Bob Sumner, Jovan Popovi ́c, the MIT CSAILGraphics Lab, Zachi Karni, Igor Guskov and Matthias M ̈ullerfor providing access to the animations used in this paper.Many thanks to Costa Touma and Craig Gotsman for provid-ing an executable of their static mesh compression algorithm.

PY - 2010/2/8

Y1 - 2010/2/8

N2 - Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate.

AB - Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate.

KW - Animation

KW - Low complexity

KW - Mesh compression

KW - Real-time

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=76649097058&partnerID=8YFLogxK

U2 - 10.1111/j.1467-8659.2009.01547.x

DO - 10.1111/j.1467-8659.2009.01547.x

M3 - Article

AN - SCOPUS:76649097058

VL - 29

SP - 101

EP - 116

JO - Computer graphics forum

JF - Computer graphics forum

SN - 0167-7055

IS - 1

ER -