Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry
暂无分享,去创建一个
[1] Craig Gotsman,et al. 3D Mesh Compression Using Fixed Spectral Bases , 2001, Graphics Interface.
[2] A. Volgenant,et al. A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.
[3] Ryutarou Ohbuchi,et al. A Frequency‐Domain Approach to Watermarking 3D Shapes , 2002, Comput. Graph. Forum.
[4] Craig Gotsman,et al. Spectral compression of mesh geometry , 2000, EuroCG.
[5] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[6] Ryutarou Ohbuchi,et al. Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain , 2001, Graphics Interface.
[7] Bülent Sankur,et al. 1 2 3 4 5 6 7 8 , 2000 .
[8] Andrew V. Goldberg,et al. Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms , 1998, JEAL.
[9] Gene H. Golub,et al. Optimal Surface Smoothing as Filter Design , 1996, ECCV.
[10] Gregory W. Wornell,et al. Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.
[11] Pierre Alliez,et al. Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.