A user study on quantisation thresholds of triangle meshes

Almutairi, Aeshah; Saarela, Toni; Ivrissimtzis, Ioannis; Wan, Tao Ruan; Vidal, Franck

Abstract

We present the results of a user study on estimating a quantisation threshold above which the quantised triangle mesh is perceived as indistinguishable from its unquantised original. The design of the experiment and the analysis of the results focus on the comparison between two different quantisation methods: rounding, in which all bits above the threshold are put to zero; and dithering, in which all bits above the threshold are randomised. The results show that dithered meshes require more bits per vertex coordinate in order to reach the indistinguishability threshold, and while the difference between the two methods is small, around one bit per vertex coordinate, it is nevertheless statistically significant.

Citation

Almutairi, A., Saarela, T., Ivrissimtzis, I., Wan, T. R., & Vidal, F. (2017). A user study on quantisation thresholds of triangle meshes. In Computer Graphics & Visual Computing (CGVC) 2017. Eurographics UK Chapter Proceedings, anchester Metropolitan University, United Kingdom, 14 – 15 September 2017. https://doi.org/10.2312/cgvc.20171283

• Conference Name: Computer Graphics and Visual Computing (CGVC) 2017.
• Conference Location: Manchester, England
• Start Date: Sep 14, 2017
• End Date: Sep 15, 2017
• Acceptance Date: Jul 25, 2017
• Publication Date: 2017
• Deposit Date: Aug 15, 2017
• Publicly Available Date: Aug 16, 2017
• Book Title: Computer Graphics & Visual Computing (CGVC) 2017. Eurographics UK Chapter Proceedings, anchester Metropolitan University, United Kingdom, 14 – 15 September 2017.
• DOI: https://doi.org/10.2312/cgvc.20171283