Abstract
We define sequential steganography as those class of embedding algorithms that hide messages in consecutive (time, spatial, or frequency domain) features of a host signal. This work presents a steganalysis method that estimates the secret key used in sequential embedding. Steganalysis is posed as the detection of abrupt jumps in the statistics of a stego signal. Stationary and nonstationary host signals with low, medium, and high signal-to-noise ratio (SNR) embedding are considered. A locally most powerful steganalysis detector for the low SNR case is also derived. Several techniques to make the steganalysis algorithm work for nonstationary digital image steganalysis are also presented. Extensive experimental results are shown to illustrate the strengths and weaknesses of the proposed steganalysis algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
