{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:37:06Z","timestamp":1780411026922,"version":"3.54.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2005,4]]},"abstract":"<jats:p>\n            In this article, we propose an error-resilient transmission method for progressively compressed 3D models. The proposed method is scalable with respect to both channel bandwidth and channel packet-loss rate. We jointly design source and channel coders using a statistical measure that (i) calculates the number of both source and channel coding bits, and (ii) distributes the channel coding bits among the transmitted refinement levels in order to maximize the expected decoded model quality. In order to keep the total number of bits before and after applying error protection the same, we transmit fewer triangles in the latter case to accommodate the channel coding bits. When the proposed method is used to transmit a typical model over a channel with a 10% packet-loss rate, the distortion (measured using the\n            <jats:italic>Hausdorff<\/jats:italic>\n            distance between the original and the decoded models) is reduced by 50% compared to the case when no error protection is applied.\n          <\/jats:p>","DOI":"10.1145\/1061347.1061349","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:30:55Z","timestamp":1123057855000},"page":"182-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Error-resilient transmission of 3D models"],"prefix":"10.1145","volume":"24","author":[{"given":"Ghassan","family":"Alregib","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Savannah, GA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yucel","family":"Altunbasak","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jarek","family":"Rossignac","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"The Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing.","volume":"2","author":"Al-Regib G.","year":"2041","unstructured":"Al-Regib , G. , Altunbasak , Y. , and Rossignac , J . 2002. An unequal error protection method for progressively compressed 3-D models . In The Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing. Vol. 2 . Orlando, FL , 2041 --2044. Al-Regib, G., Altunbasak, Y., and Rossignac, J. 2002. An unequal error protection method for progressively compressed 3-D models. In The Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing. Vol. 2. Orlando, FL, 2041--2044."},{"key":"e_1_2_1_2_1","unstructured":"Bajaj C. L. Cutchin S. Pascucci V. and Zhuang G. 1998. Error resilient transmission of compressed VRML. In Tech. Rep. TICAM The University of Texas at Austin 1998. Austin TX.  Bajaj C. L. Cutchin S. Pascucci V. and Zhuang G. 1998. Error resilient transmission of compressed VRML. In Tech. Rep. TICAM The University of Texas at Austin 1998. Austin TX."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Bischoff S. and Kobbelt L. 2002. Towards robust broadcasting of geometry data. Computers & Graphics 2b 5 665--675.  Bischoff S. and Kobbelt L. 2002. Towards robust broadcasting of geometry data. Computers & Graphics 2b 5 665--675.","DOI":"10.1016\/S0097-8493(02)00122-X"},{"key":"e_1_2_1_4_1","volume-title":"Theory and practice of Error Control Codes","author":"Blahut R. E.","unstructured":"Blahut , R. E. 1983. Theory and practice of Error Control Codes . Addison-Wesley , Reading, MA . Blahut, R. E. 1983. Theory and practice of Error Control Codes. Addison-Wesley, Reading, MA."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/76.825730"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.793002"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of ACM SIGGRAPH'97","author":"Garland M.","unstructured":"Garland , M. and Heckbert , P . 1997. Surface simplification using quadric error metrics . In Proceedings of ACM SIGGRAPH'97 . 209--216. 10.1145\/258734.258849 Garland, M. and Heckbert, P. 1997. Surface simplification using quadric error metrics. In Proceedings of ACM SIGGRAPH'97. 209--216. 10.1145\/258734.258849"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of SPIE Visual Communications and Image Processing","author":"Girod B.","unstructured":"Girod , B. , Stuhlmuller , K. , Link , M. , and Horn , U . 1999. Packet loss resilient internet video streaming . In Proceedings of SPIE Visual Communications and Image Processing . San Jose, CA, 833--844. Girod, B., Stuhlmuller, K., Link, M., and Horn, U. 1999. Packet loss resilient internet video streaming. In Proceedings of SPIE Visual Communications and Image Processing. San Jose, CA, 833--844."},{"key":"e_1_2_1_9_1","volume-title":"Coding Theory: The Essentials","author":"Hoffman D. G.","year":"1991","unstructured":"Hoffman , D. G. , Leonard , D. A. , Lindner , C. C. , Phelps , K. T. , Rodger , C. A. , and Wall , J. R . 1991 . Coding Theory: The Essentials . Marcel Dekker, Inc. , New York . Hoffman, D. G., Leonard, D. A., Lindner, C. C., Phelps, K. T., Rodger, C. A., and Wall, J. R. 1991. Coding Theory: The Essentials. Marcel Dekker, Inc., New York."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings ACM SIGGRAPH'96","author":"Hoppe H.","year":"1996","unstructured":"Hoppe , H. 1996 . Progressive meshes . In Proceedings ACM SIGGRAPH'96 . 99--108. 10.1145\/237170.237216 Hoppe, H. 1996. Progressive meshes. In Proceedings ACM SIGGRAPH'96. 99--108. 10.1145\/237170.237216"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0923-5965(99)00025-9"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.848236"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841122"},{"key":"e_1_2_1_15_1","unstructured":"Peterson L. L. and Davie B. S. 2000. Computer Networks. Academic Press CA.   Peterson L. L. and Davie B. S. 2000. Computer Networks. Academic Press CA."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of Eurographics'96","volume":"3","author":"Ronford R.","unstructured":"Ronford , R. and Rossignac , J . 1996. Full-range approximations of triangulated polyhedra . In Proceedings of Eurographics'96 . Vol. 15- 3 . C--67. Ronford, R. and Rossignac, J. 1996. Full-range approximations of triangulated polyhedra. In Proceedings of Eurographics'96. Vol. 15-3. C--67."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.764870"},{"key":"e_1_2_1_18_1","unstructured":"Rossignac J. 2000. Shape complexity and compression. In Eurographics'00.  Rossignac J. 2000. Shape complexity and compression. In Eurographics'00."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of SIGGRAPH'98","author":"Taubin G.","unstructured":"Taubin , G. , Gueziec , A. , Horn , W. , and Lazarus , F . 1998. Progressive forest split compression . In Proceedings of SIGGRAPH'98 . 123--132. 10.1145\/280814.280834 Taubin, G., Gueziec, A., Horn, W., and Lazarus, F. 1998. Progressive forest split compression. In Proceedings of SIGGRAPH'98. 123--132. 10.1145\/280814.280834"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/274363.274365"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of Graphics Interface","author":"Touma C.","unstructured":"Touma , C. and Gotsman , C . 1998. Triangle mesh compression . In Proceedings of Graphics Interface . Vancouver, Canada. Touma, C. and Gotsman, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface. Vancouver, Canada."},{"key":"e_1_2_1_22_1","volume-title":"-Q","author":"Wang Y.","year":"2002","unstructured":"Wang , Y. , Ostermann , J. , and Zhang , Y . -Q . 2002 . Video processing and Communications. Prentice Hall , NJ. Wang, Y., Ostermann, J., and Zhang, Y.-Q. 2002. Video processing and Communications. Prentice Hall, NJ."},{"key":"e_1_2_1_23_1","volume-title":"-F","author":"Wang Y.","year":"1998","unstructured":"Wang , Y. and Zhu , Q . -F . 1998 . Error control and concealment for video communications: A review. In Proceed. IEEE. 974--997. Wang, Y. and Zhu, Q.-F. 1998. Error control and concealment for video communications: A review. In Proceed. IEEE. 974--997."},{"key":"e_1_2_1_24_1","volume-title":"Error Control Systems for Digital Communication and Storage","author":"Wicker S. B.","unstructured":"Wicker , S. B. 1995. Error Control Systems for Digital Communication and Storage . Prentice Hall , NJ. Wicker, S. B. 1995. Error Control Systems for Digital Communication and Storage. Prentice Hall, NJ."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/76.931112"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS'99.","volume":"4","author":"Yan Z.","unstructured":"Yan , Z. , Kumar , S. , Li , J. , and Kuo , C . -C. 1999. Robust encoding of 3D mesh using data partitioning . In Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS'99. Vol. 4 . 495--498. Yan, Z., Kumar, S., Li, J., and Kuo, C.-C. 1999. Robust encoding of 3D mesh using data partitioning. In Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS'99. Vol. 4. 495--498."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1061347.1061349","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1061347.1061349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:56Z","timestamp":1750282616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1061347.1061349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["10.1145\/1061347.1061349"],"URL":"https:\/\/doi.org\/10.1145\/1061347.1061349","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"2005-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}