Regular ArticleCompression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm
References (21)
- et al.
Object modelling by registration of multiple range views
Image Vision Comput
(1992) - et al.
Simultaneous registration of multiple range views for use in reverse engineering of cad models
Comput. Vision Image Understanding
(1998) - G. Taubin and J. Rossignac, Geometry compression through topological surgery, ACM Transactions on Graphics, 1998, pp....
- M. Chow, Optimized geometry compression for real-time rendering, in Proceedings of the IEEE Visualization, 1997, pp....
- S. Gumhold, Real time compression of triangle mesh connectivity, SIGGRAPH, 1998, pp....
- J. Neumann and Y. Aloimonos, Talking heads: Introducing the tool of 3d motion fields in the study of action, in IEEE...
- ...
- M. Deering, Geometry compression, in SIGGRAPH, 1995,...
- Z. Karni and C. Gotsman, Spectral coding of mesh geometry, in SIGGRAPH, 2000, pp....
- J. Lengyel, Compression of time dependent geometry, in Symposium on Interactive 3D Graphics, 1999, pp....
Cited by (37)
Volumetric video streaming: Current approaches and implementations
2023, Immersive Video TechnologiesCoding of dynamic 3D meshes
2023, Immersive Video TechnologiesPoint cloud coding: A privileged view driven by a classification taxonomy
2020, Signal Processing: Image CommunicationCitation Excerpt :After, the classes for each taxonomy classification dimension will be described. The classification dimensions and the classes within each dimension have been defined based on tens of PC coding solutions available in the literature so that a robust taxonomy could be defined [19–112]. While it may happen that future technical developments require the creation of new classes within a classification dimension, the same is unlikely to happen for the classification dimensions themselves.
The alpha parallelogram predictor: A lossless compression method for motion capture data
2013, Information SciencesCitation Excerpt :Guskov and Khodakovsky [12] use wavelet coding techniques for compression. Gupta et al. [11] and Lengyel [19] detect parts of the mesh with rigid motion to encode only the transformation and the residuals. Yang et al. [34] encode non-isomorphic animated mesh sequences.
Automatic point correspondence using an artificial immune system optimization technique for medical image registration
2011, Computerized Medical Imaging and GraphicsCitation Excerpt :In order to compare the effectiveness of the proposed algorithm relative to other well established in the literature, a variation of the ICP algorithm was used. The ICP method has been often employed for feature correspondence between pairs of images and subsequent image registration [26] or compression [27], as well as between pairs of objects [28]. Although the classic ICP algorithm was applied using the Euclidean distance metric, other metrics have been reported in the literature, such as Hausdorff distance [29] and spectral characteristics of the matrix of the point set distances [30].
Impact of vertex clustering on registration-based 3D dynamic mesh coding
2008, Image and Vision ComputingCitation Excerpt :The mesh motion can be completely described using a few affine transformations and residual errors and this compact representation leads to compression. An efficient dynamic geometry compression algorithm [10] that performs systematic motion estimation is discussed in this section. In addition, we also look at associated performance measures used for comparing various compression schemes.