Hall, Peter; Molchanov, Ilya
Consider digitising a binary pattern on a regular lattice, so that each 'face' of pixel of the lattice is given just one of the two colours in the pattern. If the pixelation algorithm is symmetric, meaning that a pixel which straddles the boundary between two colours inherits the colour that predominates in that particular face, then the systematic errors in pixel counts are generally small. However, they can be significant for asymmetric pixelations. In this paper we provide explicit...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.