Space filling curves in steganalysis

نویسنده

  • Andreas Westfeld
چکیده

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 comparison of five different sampling paths reveals that recursive principles achieve by far the best performance. All measures, such as mean distance, median autocorrelation, and the ability to detect even tiny modifications show substantial improvements compared to conventional methods. We elaborate the relationship between those parameters and quantify the effectiveness with a large test database of small images, which are usually hard to detect. Apart from quantitative advances, visualisation of steganalytic measures can also gain from the application of reverse space filling curves.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recurrence for Pandimensional Space-Filling Functions

A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while welldefined, is not continuous. Space-filling curves, the finite approximations to space-filling functions, have found application in global optimization, database indexing, and dimension reduction among oth...

متن کامل

Time Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves

This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...

متن کامل

Optimizing image steganography by combining the GA and ICA

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

متن کامل

On the metric properties of discrete space-filling curves

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.

متن کامل

Drawing Space-filling Curves in Logo

Several space-filling and related curves are described by means of ”simultaneous grammars”. From these descriptions it is very easy to obtain short procedures in logo for drawing the curves.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005