Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm

DOI10.1006/CVIU.2002.0987MaRDI QIDQ4806635zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sumit Gupta, Kuntal Sengupta, Ashraf A. Kassim

Publication date 14 May 2003

Published in Computer Vision and Image Understanding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/cviu.2002.0987

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Time-Varying Volume Geometry Compression with 4D Lifting Wavelet Transform
• A novel 3D mesh compression using mesh segmentation with multiple principal plane analysis
• Compression of motion capture databases
• Dynamically restricted codebook-based vector quantisation scheme for mesh geometry compression
• An efficient algorithm for compression of motion capture signal using multidimensional quadratic Bézier curve break-and-fit method

Cited in

(5)

• Motion-Compensated Compression of Dynamic Voxelized Point Clouds
• An efficient algorithm for compression of motion capture signal using multidimensional quadratic Bézier curve break-and-fit method
• Low-latency compression of mocap data using learned spatial decorrelation transform
• Compression of motion capture databases
• Time-Varying Volume Geometry Compression with 4D Lifting Wavelet Transform

This page was built for publication: Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806635)