Peano scanning partial distance search for vector quantization

A new approach to vector median filtering based on space filling curves

“…An image is scanned in a different way, as compared with the raster-scan technique: The result of this new scanning is the generation of a list of image pixels to which the inverse scanning can be applied in the detection phase in order to recover the original image. An image scanning method based on space filling curves has also been employed by Quweider and Salari [11] and by Kamata et al [12] in order to obtain an algorithm for image compression and coding: This method allows one to fully exploit the correlation between adjacent pixels. Image coding algorithms based on space filling curves have been proven to be much better than raster methods.…”

“…For each , the arc length is defined as (11) where exists, whereas the parameter represents the curvilinear abscissa of the curve.…”

Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

“…Previously, Liu and Schrack [27,28] presented efficient encoding and decoding algorithms to map 2-D/3-D images to Hilbert curves. Based on the Hilbert curve representation, many applications [3,4,6,8,10,18,[23][24][25]35,36,39,43,11,9,15,5,29] have been developed. These Hilbert curvebased applications all suffer from the common constraint that the given image must be of size 2 r · 2 r .…”

A new distance measure for vectorial rank-order filters based on space filling curves

“…An image scanning method based on space filling curves has also been employed by Quweider and Salari [5] and by Kamata et al [6] in order to obtain an algorithm for image compression and coding: this method allows one to fully exploit the correlation between adjacent pixels. Image coding based on space filling curve has been proved to be much better than raster methods.…”