Proceedings of the 7th conference on Visualization '96
Compression of time-dependent geometry
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Footskate cleanup for motion capture editing
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
Compressing polygon mesh geometry with parallelogram prediction
Proceedings of the conference on Visualization '02
Compression of dynamic 3D geometry data using iterative closest point algorithm
Computer Vision and Image Understanding - Registration and fusion of range images
JPEG2000 Extensions for Bit Plane Coding of Floating Point Data
DCC '03 Proceedings of the Conference on Data Compression
Dynapack: space-time compression of the 3D animations of triangle meshes with fixed connectivity
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Geometry videos: a new representation for 3D animations
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Clustered principal components for precomputed radiance transfer
ACM SIGGRAPH 2003 Papers
An Efficient Algorithm for Lossless Compression of IEEE Float Audio
DCC '04 Proceedings of the Conference on Data Compression
Octree-based Animated Geometry Compression
DCC '04 Proceedings of the Conference on Data Compression
Wavelet compression of parametrically coherent mesh sequences
SCA '04 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation
Simple and efficient compression of animation sequences
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Fast Lossless Compression of Scientific Floating-Point Data
DCC '06 Proceedings of the Data Compression Conference
Compression of motion capture databases
ACM SIGGRAPH 2006 Papers
Human Motion Capture Data Compression by Model-Based Indexing: A Power Aware Approach
IEEE Transactions on Visualization and Computer Graphics
Fast and Efficient Compression of Floating-Point Data
IEEE Transactions on Visualization and Computer Graphics
Segment-based human motion compression
Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation
High Throughput Compression of Double-Precision Floating-Point Data
DCC '07 Proceedings of the 2007 Data Compression Conference
Adapting wavelet compression to human motion capture clips
GI '07 Proceedings of Graphics Interface 2007
JPEG2000 compatible lossless coding of floating-point data
Journal on Image and Video Processing
FPC: A High-Speed Compressor for Double-Precision Floating-Point Data
IEEE Transactions on Computers
Lossless compression of predicted floating-point geometry
Computer-Aided Design
Compression-unimpaired batch-image encryption combining vector quantization and index compression
Information Sciences: an International Journal
A time-efficient pattern reduction algorithm for k-means clustering
Information Sciences: an International Journal
Adaptive Motion Data Representation with Repeated Motion Analysis
IEEE Transactions on Visualization and Computer Graphics
Semi-regular representation and progressive compression of 3-D dynamic mesh sequences
IEEE Transactions on Image Processing
Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.07 |
Motion capture data in an uncompressed form can be expensive to store, and slow to load and transmit. Current compression methods for motion capture data are primarily lossy and cause distortions in the motion data. In this paper, we present a lossless compression algorithm for motion capture data. First, we propose a novel Alpha Parallelogram Predictor (APP) to estimate the DOF (degree of freedom) of each child joint from those of its immediate neighbors and parents that have already been processed. The prediction parameter of the predictor, which is referred to as the alpha parameter, is adaptively chosen from a carefully designed lookup table. Second, we divide the predicted and actual values into three components: sign, exponent and mantissa. We then compress their corrections separately with context-based arithmetic coding. Compared with other lossless compression methods, our approach can achieve a higher compression ratio with a comparable compression time. It can be used in situations where lossy compression is not preferred.