參考文獻 |
[1] Alliez, P. and M. Desbrun, “Progressive compression for lossless transmission of triangle meshes,” in ACM SIGGRAPH, Los Angeles, CA, Aug. 12-17, 2001, pp.198-205.
[2] Alliez, P. and M. Desbrun, “Valence-driven connectivity encoding for 3D meshes,” in EUROGRAPHICS, Manchester, UK, Sep. 5-7, 2001, pp.480-489.
[3] Alliez, P. and C. Gotsman, “Recent advances in compression of 3D meshes,” in Advances in Multiresolution for Geometric Modelling, N. A. Dodgson, M. S. Floater, and M. A. Sabin, eds., Springer-Verlag, Heidelberg, 2005, pp. 3-26.
[4] Bajaj, C. L., E. J. Coyle, and K.-N. Lin, “Arbitrary topology shape reconstruction from planar cross sections,” Graphical Models and Image Processing, Vol.58, No.6, pp.524-543, 1996.
[5] Bajaj, C. L., V. Pascucci, and G. Zhuang, Compression and Coding of Large CAD Models, Technical Report, University of Texas, TX, 1998.
[6] Bajaj, C. L., V. Pascucci, and G. Zhuang, “Progressive compression and transmission of arbitrary triangular meshes,” in Proc. IEEE Visualization, San Francisco, CA, Oct. 24-29, 1999, pp.307-316.
[7] Bajaj, C. L., V. Pascucci, and G. Zhuang, “Single resolution compression of arbitrary triangular meshes with properties,” Computational Geometry, Vol.14, Issues 1-3, pp.167-186, 1999.
[8] Barni, M., F. Bartolini, and A. Piva, “Improved wavelet-based watermarking through pixel-wise masking,” IEEE Trans. Image Processing, Vol.10, No.5, pp.783-791, 2001.
[9] Benedens, O., “Geometry-based watermarking of 3-D models,” IEEE Computer Graphics and Applications, Vol.19, No.1, pp.46-55, 1999.
[10] Benedens, O., “Affine invariant watermarks for 3-D polygonal and NURBS based models,” in Proc. Information Security Workshop, Wollongon, Australia, Dec. 20-21, 2000, pp.15-29.
[11] Benedens, O. and C. Busch, “Towards blind detection of robust watermarks in polygonal models,” Computer Graphics Forum, Vol.19, No.3, pp.C199-208, 2000.
[12] Benedens, O., “Robust watermarking and affine registration of 3-D meshes,” Lecture Notes in Computer Science (LNCS), Vol.2578, pp.177-195, 2003.
[13] Beth, T. and D. Gollman, “Algorithm engineering for public key algorithms,” IEEE Journal on Selected Areas in Communications, Vol.7, Issue 4, pp.458-466, 1989.
[14] Cayre, F., P. Rondao-Alface, F. Schmitt, B. Macq, and H. Maître, “Application of spectral decomposition to compression and watermarking of 3-D triangle mesh geometry,” Signal Processing: Image Communication, Vol.18, No.44, pp.309-319, 2003.
[15] Cayre, F. and B. Macq, “Data hiding on 3-D triangle meshes,” IEEE Trans. Signal Processing, Vol.51, No.4, pp.939-949, 2003.
[16] Cho, N.-I. and S.-U. Lee, "Fast algorithm and implementation of 2-D discrete cosine transform," IEEE Trans. Circuits and Systems, Vol.38, No.3, pp.297-305, 1991.
[17] Choi, J.-S., Y.-H. Kim, H.-J. Lee, I. S. Park, M.-H. Lee, and C. Ahn, “Geometry compression of 3-D mesh models using predictive two-stage quantization,” IEEE Trans. Circuits and Systems for Video Technology, Vol.10, No.2, pp.312-322, 2000.
[18] Chou, C.-M. and D.-C. Tseng, “A geometry-driven hierarchical compression technique for triangle meshes,” Lecture Notes in Computer Science (LNCS), Vol.4319, pp.919-928, 2006.
[19] Chou, C.-M. and D.-C. Tseng, “A public fragile watermarking scheme for 3D model authentication,” Computer-Aided Design, Vol.38, No.11, pp.1154-1165, 2006.
[20] Chou, P.-H. and T.-H. Meng, “Vertex data compression through vector quantization,” IEEE Trans. Visualization and Computer Graphics, Vol.8, No.4, pp.373-382, 2002.
[21] Chow, M., “Optimized geometry compression for real-time rendering,” in Proc. IEEE Visualization, Phoenix, AZ, Oct. 19-24, 1997, pp. 347-354.
[22] Cignoni, P., C. Montani, and R. Scopigno, “A comparison of mesh simplification algorithms,” Computers & Graphics, Vol.22, No.1, pp.37-54, 1998.
[23] Cohen-Or, D., D. Levin, and O. Remez, “Progressive compression of arbitrary triangular meshes,” in Proc. IEEE Visualization, San Francisco, CA, Oct. 24-29, 1999, pp. 67-72.
[24] Deering, M., “Geometry compression,” in ACM SIGGRAPH, Los Angeles, CA, Aug. 6-11, 1995, pp.13-20.
[25] Devillers, O. and P. Gandoin, “Geometric compression for interactive transmission,” in Proc. IEEE Visualization, Salt Lake City, Utah, Oct. 8-13, 2000, pp.319-326.
[26] Diffie, W. and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Information Theory, Vol.22, Issue 6, pp.644-654, 1976.
[27] Diffie, W. and M. E. Hellman, “Privacy and authentication: An introduction to cryptography,” Proceedings of the IEEE, Vol.67, Issue 3, pp. 397-427, 1979.
[28] Dyn, N., D. Levin, and J. A. Gregory, “A butterfly subdivision scheme for surface interpolation with tension control,” ACM Trans. Graphics, Vol.9, No.2, pp.160-169, 1990.
[29] Evans, F., S. S. Skiena, and A. Varshney, “Optimizing triangle strips for fast rendering,” in IEEE Visualization, Hyatt Regency, San Francisco, CA, Oct. 28-29, 1996, pp.319-326.
[30] Fornaro, C. and A. Sanna, “Public key watermarking for authentication of CSG models,” Computer-Aided Design, Vol.32, No.12, pp.727-735, 2000.
[31] Gallager, R. G., “Variations on a theme by Huffman,” IEEE Trans. Information Theory, Vol.24, Issue 6, pp. 668-674, 1978.
[32] Gandoin, P. M. and O. Devillers, “Progressive lossless compression of arbitrary simplicial complexes,” ACM Trans. Graphics, Vol.21, No.3, pp.372-379, 2002.
[33] Gieng, T. S., B. Hamann, K. I. Joy, G. L. Schussman, and I. J. Trotts, “Constructing hierarchies for triangle meshes,” IEEE Trans. Visualization and Computer Graphics, Vol.4, No.2, pp.145-161, 1998.
[34] Gotsman, C., S. Gumhold, and L. Kobbelt, “Simplification and compression of 3D meshes,” in Tutorials on Multiresolution in Geometric Modelling, A. Iske, E. Quak, and M. S. Floater, eds., Springer-Verlag, Heidelberg, 2002, pp.319-362.
[35] Gu, X., S. J. Gortler, and H. Hoppe, “Geometry images,” in ACM SIGGRAPH, San Antonio, TX, July 22-25, 2002, pp.355-361.
[36] Gumhold, S. and W. Straßer, “Real time compression of triangle mesh connectivity,” in ACM SIGGRAPH, Orlando, FL, July 19-24, 1998, pp.133-140.
[37] Guskov, I., K. Vidimce, W. Sweldens, and P. Schro¨der, “Normal meshes,“ in ACM SIGGRAPH, New Orleans, LA, July 23-28, 2000, pp. 95-102.
[38] Heckbert, P. and M. Garland, “Survey of polygonal surface simplification algorithms,” in Multiresolution Surface Modeling Course Notes of SIGGRAPH 97, Los Angeles, CA, Aug. 3-8, 1997.
[39] Heideman, M. T., D. H. Johnson, and C. S. Burrus, “Gauss and the history of the fast Fourier transform,” Archive for History of Exact Sciences, Vol.34, No.3, pp.265-277, 1985.
[40] Hoppe, H., T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh optimization,” in ACM SIGGRAPH, Anaheim, CA, Aug. 1-6, 1993, pp.19-25.
[41] Hoppe, H., “Progressive meshes,” in ACM SIGGRAPH, New Orleans, LA, Aug. 4-9, 1996, pp.99-108.
[42] Hoppe, H., “Efficient implementation of progressive meshes,” Computers & Graphics, Vol.22, No.1, pp.27-36, 1998.
[43] Hsieh, M.-S., D.-C. Tseng, and Y.-H. Huang, “Hiding digital watermarks using multiresolution wavelet transform,” IEEE Trans. Industrial Electronics, Vol.48, No.5, pp.875-882, 2001.
[44] Hsieh, M.-S. and D.-C. Tseng, “Perceptual digital watermarking for image authentication in electronic commerce,” Journal of Electronic Commerce Research, Vol.4, pp.157-170, 2004.
[45] Huffman, D. A., “A method for the construction of minimum redundancy codes,” in Proc. IRE 40, 1951, pp.1098-1101.
[46] Kanai, S., H. Date, and T. Kishinami, “Digital watermarking for 3-D polygons using multiresolution wavelet decomposition,” in Proc. 6th IFIP WG 5.2 GEO-6, Tokyo, Japan, Dec. 1-4, 1998, pp.296-307.
[47] Karni, Z. and C. Gotsman, “Spectral compression of mesh geometry,” in ACM SIGGRAPH, New Orleans, LA, July 23-28, 2000, pp.279-286.
[48] Karni, Z. and C. Gotsman, “3D mesh compression using fixed spectral bases,” in Proc. of the Graphics Interface, Ottawa, Ontario, Canada, June 7-9, 2001, pp.1-8.
[49] Khodakovsky, A., P. Schro¨der, and W. Sweldens, “Progressive geometry compression,” in ACM SIGGRAPH, New Orleans, LA, July 23-28, 2000, pp. 271-278.
[50] Khodakovsky, A. and I. Guskov, “Compression of normal meshes,” in Geometric Modeling for Scientific Visualization, G. Brunnett, B. Hamann, H. Muller, and L. Linsen, eds., Springer-Verlag, Heidelberg, 2004, pp.189-206.
[51] Lee, A. W. F., W. Sweldens, P. Schro¨der, L. Cowsar, and D. Dobkin, “MAPS: multiresolution adaptive parametrization of surfaces,” in ACM SIGGRAPH, Orlando, FL, July 19-24, 1998, pp.95-104.
[52] Lee, E.-S. and H.-S. Ko, “Vertex data compression for triangular meshes,” in Proc. Pacific Graphics, Hong Kong, Oct. 3-5, 2000, pp.225-234.
[53] Li, J. and C.-C. J. Kuo, “Progressive coding of 3-D graphic models,” Proceedings of the IEEE, Vol.86, No.6, pp.1052-1063, 1998.
[54] Lin, H.-Y., H.-Y. Liao, C.-S. Lu, and J.-C. Lin, “Fragile watermarking for authenticating 3-D polygonal meshes,” IEEE Trans. Multimedia, Vol.7, No.6, pp.997-1006, 2005.
[55] Luebke, D. P., “A developer’s survey of polygonal simplification algorithms,” IEEE Computer Graphics and Applications, Vol.21, No.3, pp.24-35, 2001.
[56] Mason, S., “Digital signatures: is that really you?” Engineering Management Journal, Vol.15, Issue 1, pp.11-13, 2005.
[57] Maurer, U., “New approaches to digital evidence,” Proceedings of the IEEE, Vol.92, Issue 6, pp.933-947, 2004.
[58] Moffat, A., R. M. Neal, and I. H. Witten, “Arithmetic coding revisited,” ACM Trans. Information Systems, Vol.16, No.3, pp.256-294, 1998.
[59] Ohbuchi, R., H. Masuda, and M. Aono, “Data embedding algorithms for geometrical and non-geometrical targets in three-dimensional polygonal models ,” Computer Communications, Vol.21, Issue 15, pp.1344-1354, 1998.
[60] Ohbuchi, R., H. Masuda, and M. Aono, “Watermarking three-dimensional polygonal models through geometric and topological modifications,” IEEE Journal on Selected Areas in Communication, Vol.16, No.4, pp.551-560, 1998.
[61] Ohbuchi, R., H. Masuda, and M. Aono, “A shape-preserving data embedding algorithm for NURBS curves and surfaces,” IPSJ Journal, Vol.41, No.3, pp.559-569, 2000.
[62] Ohbuchi, R., S. Takahashi, T. Miyazawa, and A. Mukaiyama, “Watermarking 3D polygonal meshes in the mesh spectral domain,” in Proc. The Graphics Interface, Ottawa, Ontario, June 7-9, 2001, pp.9-17.
[63] Ohbuchi, R., A. Mukaiyama, and S. Takahashi, “A frequency-domain approach to watermarking 3D shapes,” Computer Graphics Forum, Vol.21, No.3, pp.373-382, 2002.
[64] Pajarola, R. and J. Rossignac, “Compressed progressive meshes,” IEEE Trans. Visualization and Computer Graphics, Vol.6, No.1, pp.79-93, 2000.
[65] Pajarola, R. and J. Rossignac, “Squeeze: fast and progressive decompression of triangle meshes,” in Proc. of Computer Graphics International Conference, Geneva, Switzerland, June 19-23, 2000, pp.173-182.
[66] Peng, J. and C.-C. J. Kuo, “Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition,” in ACM SIGGRAPH, Los Angeles, CA, July 31 - Aug. 4, 2005.
[67] Peng, J., C.-S. Kim, and C.-C. J. Kuo, “Technologies for 3D mesh compression: a survey,” Journal of Visual Communication and Image Representation, Vol.16, No.6, pp.688-733, 2005.
[68] Popovic, J. and H. Hoppe, “Progressive simplicial complexes,” in ACM SIGGRAPH, Los Angeles, CA, Aug. 3-8, 1997, pp.217-224.
[69] Praun, E., H. Hoppe, and A. Finkelstein, “Robust mesh watermarking,” in ACM SIGGRAPH, Los Angeles, CA, Aug. 8-13, 1999, pp.49-56.
[70] Praun, E. and H. Hoppe, “Spherical parametrization and remeshing,” ACM Trans. Graphics, Vol.22, No.3, pp.340-349, 2003.
[71] Rossignac, J., “Edgebreaker: connectivity compression for triangle meshes,” IEEE Trans. Visualization and Computer Graphics, Vol.5, No.1, pp.47-61, 1999.
[72] Schindler, M., “A fast renormalization for arithmetic coding,” in Proc. of IEEE Data Compression Conference, Snowbird, UT, Mar. 30 - April 1, 1998, p.572.
[73] Schroeder, W. J., J. A. Zarge, and W. E. Lorensen, “Decimation of triangle meshes,” in ACM SIGGRAPH, Chicago, IL, July 26-31, 1992, pp. 65-70.
[74] Shapiro, J., “Embedded image-coding using zerotrees of wavelet coefficients,” IEEE Trans. Signal Processing, Vol.41, No.12, pp.3445-3462, 1993.
[75] Shikhare, D., State of The Art in Geometry Compression, Technical Report, National Centre for Software Technology, India, 2000.
[76] Soucy, M. and D. Laurendeau, “Multiresolution surface modeling based on hierarchical triangulation,” Computer Vision and Image Understanding, Vol.63, No.1, pp.1-14, 1996.
[77] Speckmann, B. and J. Snoeyink, “Easy triangle strips for tin terrain models,” in Proc. of 9th Canadian Conference on Computational Geometry, Kingston, Ontario, Canada, Aug. 11-14, 1997, pp.239-244.
[78] Taubin, G., “A signal processing approach to fair surface design,” in ACM SIGGRAPH, Los Angeles, CA, Aug.6-11, 1995, pp.351-358.
[79] Taubin, G. and J. Rossignac, “Geometric compression through topological surgery,” ACM Trans. Graphics, Vol.17, No.2, pp.84-115, 1998.
[80] Taubin, G., W. Horn, F. Lazarus, and J. Rossignac, “Geometry coding and VRML,” Proceedings of the IEEE, Vol.96, No.6, pp.1228-1243, 1998.
[81] Taubin, G., A. Gueziec, W. Horn, and F. Lazarus, “Progressive forest split compression,” in ACM SIGGRAPH, Orlando, FL, July 19-24, 1998, pp.123-132.
[82] Taubin, G., “3D geometry compression and progressive transmission,” in EUROGRAPHICS - State of The Art Report, Milan, Italy, Sep. 7-11, 1999, pp.81-96.
[83] The Virtual Reality Modeling Language (VRML), ISO/IEC 14772-1, 1997.
[84] Touma, C. and C. Gotsman, “Triangle mesh compression,” in Proc. of Graphics Interface, Vancouver, Canada, June 18-20, 1998, pp.26-34.
[85] Valette, S. and R. Prost, “A wavelet-based progressive compression scheme for triangle meshes: wavemesh,” IEEE Visualization and Computer Graphics, Vol.10, No.2, pp.123-129, 2004.
[86] Vitter, J. S., “Design and analysis of dynamic Huffman codes,” Journal of the ACM, Vol.34, No.4, pp.825-845, 1987.
[87] Watson, A. B., “Image compression using the discrete cosine transform,” The Mathematica Journal, Vol.4, Issue 1, pp.81-88, 1994.
[88] Wells, T. O., “Electronic and digital signatures: in search of a standard,” IT Professional, Vol.2, Issue 3, pp.24-30, 2000.
[89] Witten, I. H., R. M. Neal, and J. G. Cleary, “Arithmetic coding for data compression,” Communications of the ACM, Vol.30, No.6, pp.520-540, 1987.
[90] Wu, H.-T. and Y.-M. Cheung, “A fragile watermarking scheme for 3D meshes,” in Proc. The 7th Workshop on Multimedia and Security, New York, Aug. 1-2, 2005, pp.117-124.
[91] Xiang, X., M. Held, and J. Mitchell, “Fast and efficient stripification of polygonal surface models,” in ACM 1999 Symposium on Interactive 3D Graphics, Atlanta, GA, Apr. 26-28, 1999, pp.71-78.
[92] Xie, L. and G. R. Arce, “A class of authentication digital watermarks for secure multimedia communication,” IEEE Trans. Image Processing, Vol.10, No.11, pp.1754-1764, 2001.
[93] Yeo, B.-L. and M.-M. Yeung, “Watermarking 3D objects for verification,” IEEE Computer Graphics and Applications, Vol.19, No.1, pp.36-45, 1999.
[94] Yeung, M.-M. and F. Mintzer, “An invisible watermarking technique for image verification,” in Proc. Int. Conf. Image Processing, Santa Barbara, CA, Oct. 26-29, 1997, Vol.2, pp.680-683.
[95] Yin, K., Z. Pan, S. Jiaoying, and D. Zhang, “Robust mesh watermarking based on multiresolution processing,” Computer and Graphics, Vol. 25, No.3, pp.409-420, 2001.
[96] Zafeiriou S., A. Tefas, and I. Pitas, “Blind robust watermarking schemes for copyright protection of 3D mesh objects,” IEEE Trans. Visualization and Computer Graphics, Vol.11, Issue 5, pp.596-607, 2005.
[97] Zorin, D., P. Schro¨ der, and W. Sweldens, “Interpolating subdivision for meshes with arbitrary topology,” in ACM SIGGRAPH, New Orleans, LA, Aug. 4-9, 1996, pp.189-192. |