Compression of dynamic 3D geometry data using iterative closest point algorithm

Computer Vision and Image Understanding

Volumn 87, Issue 1-3, 2002, Pages 116-130

  Gupta, Sumit ^a   Sengupta, Kuntal ^a   Kassim, Ashraf A ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; IMAGE COMPRESSION; ITERATIVE METHODS; MATHEMATICAL MODELS; MOTION ESTIMATION; THREE DIMENSIONAL;

ITERATIVE CLOSEST POINT; MOTION COMPRESSION;

IMAGE UNDERSTANDING;

EID: 0042530112     PISSN: 10773142     EISSN: None     Source Type: Journal    
DOI: 10.1006/cviu.2002.0987     Document Type: Article

References (20)

1. G. Taubin and J. Rossignac, Geometry compression through topological surgery. ACM Transactions on Graphics, 1998, pp. 84-115.
2. M. Chow, Optimized geometry compression for real-time rendering, in Proceedings of the IEEE Visualization, 1997, pp. 346-354.
3. S. Gumhold, Real time compression of triangle mesh connectivity, SIGGRAPH, 1998, pp. 133-140.
4. J. Neumann and Y. Aloimonos, Talking heads: Introducing the tool of 3d motion fields in the study of action, in IEEE Proceedings of Workshop on Human Motion, 2000, pp. 25-32.
5. www.ptgrey.com/products/digiclops/.
6. M. Deering, Geometry compression, in SIGGRAPH, 1995, 13-20.
7. Z. Karni and C. Gotsman, Spectral coding of mesh geometry, in SIGGRAPH, 2000, pp. 279-286.
8. J. Lengyel, Compression of time dependent geometry, in Symposium on Interactive 3D Graphics, 1999, pp. 89-95.
9. M. Alexa and W. Muller, Representing animations by principal components, EUROGRAPHICS 19, 2000, 411-418.
10. S. Varakliotis, J. Ostermann, and V. Hardman, Coding of animated 3-d wireframe models for internet streaming applications, ICME, 2001, pp. 353-356.
11. A. Shamir, V. Pascucci, and C. Bajaj, Multi-resolution dynamic meshes with arbitrary deformations, in Proceedings of the Conference on Visualization, 2000, 423-430.
12. C. Kambhamettu and D. B. Goldgof, Point correspondence recovery in non-rigid motion, in IEEE Conference on Computer Vision and Pattern Recognition, 1992, 222-227.
13. G. Turk and M. Levoy, Zippered polygon meshes from range images, SIGGRAPH, 1994, pp. 311-318.
14. A. D. Brett, A. Hill, and C. J. Taylor, A method of 3d surface correspondence for automated landmark generation, in 8th British Machine Vision Conference, 1997, pp. 709-718.
15. B. Hendrickson and R. Leland, A Multilevel Algorithm for Partitioning Graphs, Technical Report SAND93-1301.
16. J. Feldmar and N. Ayache, Rigid, affine and locally affine registration of free-form surfaces, Internat. J. Comput. Vision 18, 1996, 99-119.
17. P. Besl and N. McKay, A method of registration of 3d shapes, IEEE Trans. Pattern Anal. Mach. Intell. 14, 1992, 239-256.
18. Y. Chen and G. Meodini, Object modelling by registration of multiple range views, Image Vision Comput. 10, 1992, 145-155.
19. D. Eggert, A. W. Fitzgibbon, and R. B. Fisher, Simultaneous registration of multiple range views for use in reverse engineering of cad models, Comput. Vision Image Understanding 69, 1998, 253-272.
20. A. P. Ashbrook and R. B. Fisher, Constructing models of articulating objects: Range data partitioning, in Proceedings of International Conference on Recent Advances in 3-D Digital Imaging and Modeling, 1997, pp. 164-172.