{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:02:56Z","timestamp":1766311376692},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing: Image Communication"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0923-5965(02)00147-9","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"309-319","source":"Crossref","is-referenced-by-count":50,"title":["Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry"],"prefix":"10.1016","volume":"18","author":[{"given":"F.","family":"Cayre","sequence":"first","affiliation":[]},{"given":"P.","family":"Rondao-Alface","sequence":"additional","affiliation":[]},{"given":"F.","family":"Schmitt","sequence":"additional","affiliation":[]},{"given":"Beno\u0131\u0302t","family":"Macq","sequence":"additional","affiliation":[]},{"given":"H.","family":"Ma\u0131\u0302tre","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0923-5965(02)00147-9_BIB1","doi-asserted-by":"crossref","unstructured":"P. Alliez, M. Desbrun, Progressive compression for lossless transmission of triangle meshes, Proceedings of the SIGGRAPH\u201901, Los Angeles, CA, 2001, pp. 198\u2013205.","DOI":"10.1145\/383259.383281"},{"issue":"6","key":"10.1016\/S0923-5965(02)00147-9_BIB2","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1016\/S0165-1684(01)00041-X","article-title":"Analyses of error correcting strategies for typical communications channels in watermarking","volume":"81","author":"Baudry","year":"2001","journal-title":"Signal Process."},{"key":"10.1016\/S0923-5965(02)00147-9_BIB3","series-title":"Modern Graph Theory","author":"Bollabas","year":"1998"},{"issue":"4","key":"10.1016\/S0923-5965(02)00147-9_BIB4","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1109\/18.923725","article-title":"Quantization Index Modulation","volume":"47","author":"Chen","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/297096.297140"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB7","doi-asserted-by":"crossref","unstructured":"Z. Karni, C. Gotsman, Spectral compression of mesh geometry, Comput. Graphics; Proceedings of the SIGGRAPH, New Orleans, LA, 2000, pp. 279\u2013286.","DOI":"10.1145\/344779.344924"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB8","unstructured":"Z. Karni, C. Gotsman, 3D mesh compression using fixed spectral basis, Proceedings of Graphics Interface, Ottawa, June 2001, pp. 1\u20138."},{"key":"10.1016\/S0923-5965(02)00147-9_BIB9","unstructured":"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."},{"key":"10.1016\/S0923-5965(02)00147-9_BIB10","unstructured":"LAPACK, Linear Algebra PACKage, http:\/\/www.netlib.org\/lapack."},{"key":"10.1016\/S0923-5965(02)00147-9_BIB11","unstructured":"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\u201318."},{"issue":"3","key":"10.1016\/S0923-5965(02)00147-9_BIB12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1111\/1467-8659.t01-1-00597","article-title":"A frequency-domain approach to watermarking 3D shapes","volume":"21","author":"Ohbuchi","year":"2002","journal-title":"Comput. Graphics Forum"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB13","doi-asserted-by":"crossref","unstructured":"G. Taubin, T. Zhang, G. Golub, Optimal surface smoothing as filter design, IBM Technical Report RC-20404, March 1996.","DOI":"10.1007\/BFb0015544"},{"key":"10.1016\/S0923-5965(02)00147-9_BIB14","doi-asserted-by":"crossref","unstructured":"W.T. Tutte, How to draw a graph, in: Proceedings of the London Mathematical Society, Vol. 10, 1960, pp. 304\u2013332.","DOI":"10.1112\/plms\/s3-10.1.304"}],"container-title":["Signal Processing: Image Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0923596502001479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0923596502001479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T07:21:10Z","timestamp":1583997670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0923596502001479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0923596502001479"],"URL":"https:\/\/doi.org\/10.1016\/s0923-5965(02)00147-9","relation":{},"ISSN":["0923-5965"],"issn-type":[{"value":"0923-5965","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}