Discrete Fourier Transform-Based Steganography

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, discrete Fourier transform (DFT)-based steganographic process has been discussed in details. The generalized DFT and IDFT equation pair is given from where sub-image-based (small nonoverlapping window) reversible computations using DFT and IDFT is done. Numerical examples are given for both 1D and 2D DFT and IDFT transform computation for confirmation of reversibility. LSB encoding on 8 x 4 sub-image is also given completely with flow diagram. A complete algorithm of DFT-based steganography is given with a capacity of embedding payload of 0.75bpB along with its implementation results and analysis.

Cite

CITATION STYLE

APA

Mandal, J. K. (2020). Discrete Fourier Transform-Based Steganography. In Studies in Computational Intelligence (Vol. 901, pp. 63–98). Springer. https://doi.org/10.1007/978-981-15-4397-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free