Quasi-Hamming distances: An overarching concept for measuring glyph similarity

No Altmetrics are currently available for this publication.

Legg, P. A. , Maguire, E. , Walton, S. and Chen, M. (2015) Quasi-Hamming distances: An overarching concept for measuring glyph similarity. In: EGUK Computer Graphics and Visual Computing 2015, UCL, London, UK, 16-17 September 2015. Available from: http://eprints.uwe.ac.uk/26243


Download (1MB) | Preview
Publisher's URL: http://cgvc15.cs.ucl.ac.uk/


In many applications of spatial or temporal visualization, glyphs provide an effective means for encoding mul- tivariate data objects. However, because glyphs are typically small, they are vulnerable to various perceptual errors. In data communication, the concept of Hamming distance underpins the study of codes that support error detection and correction by the receiver without the need for corroboration from the sender. In this extended abstract, we outline a novel concept of quasi-Hamming distance in the context of glyph design. We discuss the feasibility of estimating quasi-Hamming distance between a pair of glyphs, and the minimal Hamming distance for a glyph set. This measurement enables glyph designers to determine the differentiability between glyphs, facilitating design optimization by maximizing distances between glyphs under various constraints (e.g., the available number of visual channels and their encoding bandwidth).

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: quasi-Hamming distances, glyph similarity
Faculty/Department: Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
Depositing User: Dr P. Legg
Date Deposited: 13 Aug 2015 12:40
Last Modified: 27 Jan 2017 21:49
URI: http://eprints.uwe.ac.uk/id/eprint/26243


Activity Overview
Origin of downloads

Additional statistics for this repository are available via IRStats2

Actions (login required)

View Item View Item