Share Email Print

Proceedings Paper

Fast additive noise steganalysis
Author(s): Jeremiah Joseph Harmsen; Kevin D. Bowers; William A. Pearlman
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This work reduces the computational requirements of the additive noise steganalysis presented by Harmsen and Pearlman. The additive noise model assumes that the stegoimage is created by adding a pseudo-noise to a coverimage. This addition predictably alters the joint histogram of the image. In color images it has been shown that this alteration can be detected using a three-dimensional Fast Fourier Transform (FFT) of the histogram. As the computation of this transform is typically very intensive, a method to reduce the required processing is desirable. By considering the histogram between pairs of channels in RGB images, three separate two-dimensional FFTs are used in place of the original three-dimensional FFT. This method is shown to offer computational savings of approximately two orders of magnitude while only slightly decreasing classification accuracy.

Paper Details

Date Published: 22 June 2004
PDF: 7 pages
Proc. SPIE 5306, Security, Steganography, and Watermarking of Multimedia Contents VI, (22 June 2004); doi: 10.1117/12.526003
Show Author Affiliations
Jeremiah Joseph Harmsen, Rensselaer Polytechnic Institute (United States)
Kevin D. Bowers, Carnegie Mellon Univ. (United States)
William A. Pearlman, Rensselaer Polytechnic Institute (United States)

Published in SPIE Proceedings Vol. 5306:
Security, Steganography, and Watermarking of Multimedia Contents VI
Edward J. Delp III; Ping W. Wong, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?