Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry

Signal Processing: Image Communication

Volumn 18, Issue 4, 2003, Pages 309-319

  Cayre, F ^a   Rondao Alface, P ^b   Schmitt, F ^a   Macq, Benoît ^b   Maitre H ^a  

^a CNRS   (France)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Geometry compression; Geometry watermarking; Mesh spectral decomposition

Indexed keywords

ALGORITHMS; COPYRIGHTS; IMAGE COMPRESSION; PRINCIPAL COMPONENT ANALYSIS;

MESH SPECTRAL DECOMPOSITION;

DIGITAL WATERMARKING;

EID: 0037399648     PISSN: 09235965     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0923-5965(02)00147-9     Document Type: Conference Paper

References (14)

1. P. Alliez, M. Desbrun, Progressive compression for lossless transmission of triangle meshes, Proceedings of the SIGGRAPH'01, Los Angeles, CA, 2001, pp. 198-205.
2. Baudry S., Delaigle J.F., Sankur B., Macq B., Maître H. Analyses of error correcting strategies for typical communications channels in watermarking. Signal Process. 81(6):June 2001;1239-1250.
3. Bollabas B. Modern Graph Theory. 1998;Springer, Berlin.
4. Chen B., Wornell G.W. Quantization Index Modulation. a class of provably good methods for digital watermarking and information embedding IEEE Trans. Inform. Theory. 47(4):June 2001;1423-1443.
5. B.V. Cherkassky, A.V. Goldberg, J.C. Setubal, Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms, NEC Research Institute TR # 98-036R, 1998.
6. Jonker R., Volgenant A. A shortest augmenting path for dense and sparse linear assignment problems. Computing. 38:1987;325-340.
7. Karni, C. Gotsman, Spectral compression of mesh geometry, Comput. Graphics; Proceedings of the SIGGRAPH, New Orleans, LA, 2000, pp. 279-286.
8. Z. Karni, C. Gotsman, 3D mesh compression using fixed spectral basis, Proceedings of Graphics Interface, Ottawa, June 2001, pp. 1-8.
9. G. Karypis, V. Kumar, MeTiS: a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4.0, http://www-users.cs.umn.edu/karypis/metis , University of Minnesota, Department of Computer Science, 1998.
10. LAPACK, Linear Algebra PACKage, http://www.netlib.org/lapack.
11. R. Ohbuchi, S. Takahashi, T. Miyazawa, A. Mukaiyama, Watermarking 3D polygonal meshes in the mesh spectral domain, Proceedings of the Graphics Interface, Ottawa, June 2001, pp. 9-18.
12. Ohbuchi R., Mukaiyama A., Takahashi S. A frequency-domain approach to watermarking 3D shapes. Comput. Graphics Forum. 21(3):2002;373-382.
13. G. Taubin, T. Zhang, G. Golub, Optimal surface smoothing as filter design, IBM Technical Report RC-20404, March 1996.
14. W.T. Tutte, How to draw a graph, in: Proceedings of the London Mathematical Society, Vol. 10, 1960, pp. 304-332.