A User Study on Quantisation Thresholds of Triangle Meshes

Simple item page
dc.contributor.authorAlmutairi, Aeshahen_US
dc.contributor.authorSaarela, Tonien_US
dc.contributor.authorIvrissimtzis, Ioannisen_US
dc.contributor.editorTao Ruan Wan and Franck Vidalen_US
dc.date.accessioned2017-09-21T07:22:56Z
dc.date.available2017-09-21T07:22:56Z
dc.date.issued2017
dc.description.abstractWe 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.en_US
dc.description.sectionheadersComputer Graphics Applications
dc.description.seriesinformationComputer Graphics and Visual Computing (CGVC)
dc.identifier.doi10.2312/cgvc.20171283
dc.identifier.isbn978-3-03868-050-5
dc.identifier.pages89-94
dc.identifier.urihttps://doi.org/10.2312/cgvc.20171283
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/cgvc20171283
dc.publisherThe Eurographics Associationen_US
dc.subjectComputer Graphics [Computing methodologies]
dc.subjectGraphics systems and interfaces
dc.subjectPerception
dc.titleA User Study on Quantisation Thresholds of Triangle Meshesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
089-094.pdf
Size:
2.5 MB
Format:
Adobe Portable Document Format
Download
Collections
Computer Graphics & Visual Computing (CGVC) 2017