{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T12:10:14Z","timestamp":1708603814933},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,2,19]],"date-time":"2008-02-19T00:00:00Z","timestamp":1203379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s11760-008-0053-8","type":"journal-article","created":{"date-parts":[[2008,2,18]],"date-time":"2008-02-18T07:56:28Z","timestamp":1203321388000},"page":"251-260","source":"Crossref","is-referenced-by-count":4,"title":["Dynamically restricted codebook-based vector quantisation scheme for mesh geometry compression"],"prefix":"10.1007","volume":"2","author":[{"given":"Zhe-Ming","family":"Lu","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,19]]},"reference":[{"issue":"1","key":"53_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/2945.764870","volume":"5","author":"J. Rossignac","year":"1999","unstructured":"Rossignac, J.: Edgebreaker: connectivity compression for triangle meshes. IEEE Trans. Visual. Comput. Graph. 5(1), 47\u201361 (1999)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"53_CR2","unstructured":"King, D., Rossignac, J.: Guaranteed 3.67\u00a0 V bit encoding of planar triangle graphs. In: 11th Canadian Conference on Computational Geometry, pp. 146\u2013149 (1999)"},{"key":"53_CR3","unstructured":"Gumhold, S.: New bounds on the encoding of planar triangulations. Technical Report WSI-2000-1, University of Tubingen (2000)"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Cohen-Or, D., Levin, D., Remez, O.: Progressive compression of arbitrary triangular meshes. In: Proc. IEEE Visualization \u201999, pp. 67\u201372 (1999)","DOI":"10.1109\/VISUAL.1999.10189410"},{"issue":"1\u20132","key":"53_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0925-7721(01)00035-9","volume":"20","author":"A. Szymczak","year":"2001","unstructured":"Szymczak, A., King, D., Rossignac, J.: An edgebreaker-based efficient compression scheme for regular meshes. Comput. Geom. 20(1\u20132), 53\u201368 (2001)","journal-title":"Comput. Geom."},{"key":"53_CR6","unstructured":"Isenburg, M., Snoeyink, J.: Spirale reversi: reverse decoding of the edgebreaker encoding. In: Proceedings of 12th Canadian Conference on Computational Geometry, pp. 247\u2013256 (2000)"},{"key":"53_CR7","unstructured":"Touma, C., Gotsman, C.: Triangle mesh compression. In: Graphics Interface 98 Conference Proceedings, pp. 26\u201334 (1998)"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Bajaj, C., Pascucci, V., Zhuang, G.: Single-resolution compression of arbitrary triangular meshes with properties. In: Proc. Data Compression Conf. (DCC\u201999), pp. 247\u2013256 (1999)","DOI":"10.1109\/DCC.1999.755674"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Gumhold, S., Stra\u00dfer, W.: Real time compression of triangle mesh connectivity. In: Proc. ACM SIGGRAPH\u201998, pp. 133\u2013140 (1998)","DOI":"10.1145\/280814.280836"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Isenburg, M., Snoeyink, J.: Mesh collapse compression. In: Proceedings of SIBGRAPI\u201999, Campinas, pp. 27\u201328 (1999)","DOI":"10.1145\/304893.305000"},{"key":"53_CR11","unstructured":"Cohen, R., Cohen-Or, D., Ironi, T.: Multi-way geometry encoding. Technical report (2002)"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Evans, F., Skiena, S., Varshney, A.: Optimizing triangle strips for fast rendering. In: Proc. IEEE Visualization\u201996, pp. 319\u2013326 (1996)","DOI":"10.1109\/VISUAL.1996.568125"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Hoppe, H.: Optimization of mesh locality for transparent vertex caching. In: Proc. ACM SIGGRAPH\u201999, pp. 269\u2013276 (1999)","DOI":"10.1145\/311535.311565"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Deering, M.F.: Geometry compression. In: Proc. ACM SIGGRAPH\u201995, pp. 13\u201320 (1995)","DOI":"10.1145\/218380.218391"},{"key":"53_CR15","unstructured":"Chow, M.M.: Optimized geometry compression for real-time rendering. In: Proc. IEEE Visualization\u201997, pp. 346\u2013354 (1997)"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Gray, R.M.: Vector quantization. IEEE ASSP MAGAZINE (1984)","DOI":"10.1109\/MASSP.1984.1162229"},{"key":"53_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3626-0","volume-title":"Vector Quantization and Signal Compression","author":"A. Gersho","year":"1992","unstructured":"Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Kluwer, Norwell (1992)"},{"key":"53_CR18","unstructured":"Sun Microsystems: The Java3D API Specification. http:\/\/java.sun.com\/products\/java-media\/3D\/index.html (1999)"},{"issue":"2","key":"53_CR19","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/274363.274365","volume":"17","author":"G. Taubin","year":"1998","unstructured":"Taubin, G., Rossignac, J.: Geometric compression through topological surgery. ACM Trans. Graph. 17(2), 84\u2013115 (1998)","journal-title":"ACM Trans. Graph."},{"issue":"6","key":"53_CR20","first-page":"1228","volume":"86","author":"G. Taubin","year":"1998","unstructured":"Taubin, G., Horn, W., Rossignac, J., Lazarus, F.: Geometry coding and VRML. In: Proc. IEEE 86(6), 1228\u20131243 (1998)","journal-title":"In: Proc. IEEE"},{"key":"53_CR21","unstructured":"Lee, E., Ko, H.: Vertex data compression for triangular meshes. In: Proceedings of Pacific Graphics, pp. 225\u2013234 (2000)"},{"issue":"4","key":"53_CR22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/TVCG.2002.1044522","volume":"8","author":"P.H. Chou","year":"2002","unstructured":"Chou, P.H., Meng, T.H.: Vertex data compression through vector quantization. IEEE Trans. Visual. Comput. Graph. 8(4), 373\u2013382 (2002)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"53_CR23","doi-asserted-by":"crossref","unstructured":"Karni, Z., Gotsman, C.: Spectral compression of mesh geometry. In: ACM SIGGRAPH Conference Proceedings, pp. 279\u2013286 (2000)","DOI":"10.1145\/344779.344924"},{"key":"53_CR24","unstructured":"Karni, Z., Gotsman, C.: 3D mesh compression using fixed spectral bases. In: Proceedings of Graphics Interface, Ottawa, pp. 1\u20138 (2001)"},{"key":"53_CR25","unstructured":"Sorkine, O., Cohen-Or, D., Toldeo, S.: High-pass quantization for mesh encoding. In: Proceedings of Eurographics Symposium on Geometry Processing (2003)"},{"key":"53_CR26","doi-asserted-by":"crossref","unstructured":"Khodakovsky, A., Schroder, P., Sweldens, W.: Progressive geometry compression. In: Proc. SIGGRAPH\u201900, pp. 271\u2013278 (2000)","DOI":"10.1145\/344779.344922"},{"issue":"3","key":"53_CR27","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/566654.566591","volume":"21","author":"P.M. Gandoin","year":"2002","unstructured":"Gandoin, P.M., Devillers, O.: Progressive lossless compression of arbitrary simplicial complexes. ACM Trans. Graph. 21(3), 372\u2013379 (2002)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"53_CR28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/TVCG.2004.1260764","volume":"10","author":"S. Valette","year":"2004","unstructured":"Valette, S., Prost, R.: Wavelet-based progressive compression scheme for triangle meshes: wavemesh. IEEE Trans. Visual. Comput. Graph. 10(2), 123\u2013129 (2004)","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"key":"53_CR29","doi-asserted-by":"crossref","unstructured":"Isenburg, M., Alliez, P.: Compressing polygon mesh geometry with parallelogram prediction. In: IEEE Visualization Conference Proceedings, pp. 141\u2013146 (2002)","DOI":"10.1109\/VISUAL.2002.1183768"},{"key":"53_CR30","unstructured":"Isenburg, M.: Compressing polygon mesh connectivity with degree duality prediction. In: Graphics Interface Conference Proc., pp. 161\u2013170 (2002)"},{"key":"53_CR31","doi-asserted-by":"crossref","unstructured":"Khodakovsky, A., Alliez, P., Desbrun, M., Schroder, P.: Near- optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models, special issue (2002)","DOI":"10.1006\/gmod.2002.0575"},{"key":"53_CR32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0925-7721(99)00026-7","volume":"14","author":"C.L. Bajaj","year":"1999","unstructured":"Bajaj, C.L., Pascucci, V., Zhuang, G.: Single resolution compression of arbitrary triangular meshes with properties. Comput. Geom. Theor. Appl. 14, 167\u2013186 (1999)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"53_CR33","doi-asserted-by":"crossref","unstructured":"Kronrod, B., Gotsman, C.: Optimized compression of triangle mesh geometry using prediction trees. In: Proceedings of 1st International Symposium on 3D Data Processing, Visualization and Transmission, pp. 602\u2013608 (2002)","DOI":"10.1109\/TDPVT.2002.1024124"},{"issue":"2","key":"53_CR34","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TCSVT.2005.861945","volume":"16","author":"J.-H. Ahn","year":"2006","unstructured":"Ahn, J.-H., Kim, C.-S., Ho, Y.-S.: Predictive compression of geometry, color and normal data of 3-D mesh models. IEEE Trans. Circuits Systems Video Technol 16(2), 291\u2013299 (2006)","journal-title":"IEEE Trans. Circuits Systems Video Technol"},{"issue":"4","key":"53_CR35","first-page":"225","volume":"129","author":"Y.S. Feng","year":"1991","unstructured":"Feng, Y.S., Nasrabadi, N.M.: Dynamic address-vector quantisation of RGB colour images. Commun. Speech Vis. 129(4), 225\u2013231 (1991)","journal-title":"Commun. Speech Vis."},{"key":"53_CR36","first-page":"1755","volume":"3","author":"Y.S. Feng","year":"1989","unstructured":"Feng, Y.S., Nasrabadi, N.M.: Dynamic address-vector quantization algorithm based on inter-block and inter-color correlation for color image coding. Proc.\u2014ICASSP, IEEE Int. Conf. Acoust. Speech Signal Process. 3, 1755\u20131758 (1989)","journal-title":"Proc.\u2014ICASSP, IEEE Int. Conf. Acoust. Speech Signal Process."},{"issue":"10","key":"53_CR37","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1109\/83.718481","volume":"7","author":"C. Zhu","year":"1998","unstructured":"Zhu, C., Po, L.M.: Minimax partial distortion competitive learning for optimal codebook design. IEEE Trans. Image Process. 7(10), 1400\u20131409 (1998)","journal-title":"IEEE Trans. Image Process."},{"key":"53_CR38","unstructured":"Princeton University. 3D model search engine. http:\/\/shape.cs.princeton.edu"},{"issue":"9","key":"53_CR39","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1109\/82.257335","volume":"40","author":"S.W. Ra","year":"1993","unstructured":"Ra, S.W., Kim, J.K.: Fast mean-distance-ordered partial codebook search algorithm for image vector quantization. IEEE. Trans. Circuits Systems-II. 40(9), 576\u2013579 (1993)","journal-title":"IEEE. Trans. Circuits Systems-II."},{"key":"53_CR40","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TCOM.1985.1096214","volume":"COMM-33","author":"C.D. Bei","year":"1985","unstructured":"Bei, C.D., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Commun. COMM-33, 1132\u20131133 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"53_CR41","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/ICME.2002.1035879","volume":"I","author":"N. Aspert","year":"2002","unstructured":"Aspert, N., Santa-Cruz, D., Ebrahimi, T.: MESH: Measuring error between surfaces using the Hausdorff distance. Proc. IEEE Int. Conf. Multimedia Expo 2002 (ICME) I, 705\u2013708 (2002)","journal-title":"Proc. IEEE Int. Conf. Multimedia Expo 2002 (ICME)"},{"issue":"3","key":"53_CR42","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1111\/1467-8659.00541","volume":"20","author":"P. Alliez","year":"2001","unstructured":"Alliez, P., Desbrun, M.: Valence-driven connectivity encoding for 3D meshes. Comput. Graph. Forum. 20(3), 480\u2013489 (2001)","journal-title":"Comput. Graph. Forum."}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-008-0053-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11760-008-0053-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-008-0053-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T11:50:17Z","timestamp":1708602617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11760-008-0053-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,19]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s11760-008-0053-8","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"value":"1863-1703","type":"print"},{"value":"1863-1711","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,19]]}}}