We introduce a new method to increase the reliability of current steganalytic techniques by optimising the sample order. Space filling curves (e. g., Hilbert curve) take advantage of the correlation of adjacent pixels and thus make the detection of steganographic messages with low change densities more reliable. The findings are applicable, but not limited to LSB steganalysis. An experimental c...

A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the PeanoHilbert space filling curve. An efficient algorithm for computing context-...

Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling curves that express how effective different space-filling curves are for this purpose. We give general lower bounds on the bounding-box quality measures and on locality according to Gotsman and Lindenbaum for a large c...

A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve "locality". We quantify "locality" and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality.

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number a such that any ball Q can be covered by a tiles (or curve fragments) with total volume O(volume(Q)). Recursive tilings and space-filling curves with low Arrwwid numbers can be applied to optimize disk, memory or server access patterns when processing sets of points in Rd. This paper pres...

We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permutation which rearranges threedimensional n n n data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing a 3-D Hilbert space-filling curve. Th...

Space filling curves have been used in the design of data structures for multidimensional data since many decades. A fundamental quality metric of a space filling curve is its “clustering number” with respect to a class of queries, which is the average number of contiguous segments on the space filling curve that a query region can be partitioned into. We present a characterization of the clust...