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

被引:54
作者
Cayre, F
Rondao-Alface, P
Schmitt, F
Macq, B
Maître, H
机构
[1] Ecole Natl Super Telecommun Bretagne, Dept TSI, CNRS, URA 820, F-75634 Paris 13, France
[2] Catholic Univ Louvain, Lab Telecommun & Teledetect, B-1348 Louvain, Belgium
关键词
mesh spectral decomposition; geometry compression; geometry watermarking;
D O I
10.1016/S0923-5965(02)00147-9
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Spectral decomposition of mesh geometry has been introduced by Taubin for geometry processing purposes. It has been extended to address transmission issues by Karni and Gotsman. Such a decomposition gives rise to pseudo-frequential information of the geometry defined over the mesh connectivity. For large meshes a piecewise decomposition has to be applied in order to restrict the complexity of the transform. In this paper, we propose to introduce overlap for its spectral representation. We show gains obtained in compression, progressive transmission and watermarking of mesh geometry. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:309 / 319
页数:11
相关论文
共 13 条
[1]  
Alliez P, 2001, COMP GRAPH, P195, DOI 10.1145/383259.383281
[2]   Analyses of error correction strategies for typical communication channels in watermarking [J].
Baudry, S ;
Delaigle, JF ;
Sankur, B ;
Macq, B ;
Maître, H .
SIGNAL PROCESSING, 2001, 81 (06) :1239-1250
[3]  
BOLLABAS B, 1998, MODERN GRAPH THEORY
[4]   Quantization index modulation: A class of provably good methods for digital watermarking and information embedding [J].
Chen, B ;
Wornell, GW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1423-1443
[5]  
CHERKASSKY BV, 1998, TR98036R NEC RES I
[6]   A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].
JONKER, R ;
VOLGENANT, A .
COMPUTING, 1987, 38 (04) :325-340
[7]  
Karni Z, 2000, COMP GRAPH, P279, DOI 10.1145/344779.344924
[8]  
KARNI Z, 2001, P GRAPH INT, P1
[9]  
Karypis G., 1997, Technical report
[10]  
Ohbuchi R, 2002, COMPUT GRAPH FORUM, V21, P373, DOI 10.1111/1467-8659.t01-1-00597