.png){kind=icon}
.png){kind=icon}
Return
An image steganography method based on integer wavelet transform and rook polynomial
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-026-21268-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To enhance image encryption schemes, a careful balance must be struck between factors such as embedding capacity, sensitivity, security, and robustness. This scheme uses rook polynomial and Josephus problem to embed hidden bits in the image. Integer wavelet transform (IWT) is used to accurately extract these hidden bits, and the LL subband is used for rook polynomial and Josephus problem calculations. In addition, the $$HH, HL, and\ LH$$ subbands are used to embed hidden bits. With the help of Josephus problem, the exact embedding and extraction locations can be determined without key exchange between the sender and receiver. Notably, this scheme only changes a few pixels in the cover image after embedding hidden bits, thereby improving image quality. The average PSNR (Peak Signal-to-Noise Ratio) of the proposed scheme reaches 54.01 dB, and the embedding capacity for a $$512 \times 512$$ gray image is up to 941, 931 bits. The method achieves a high SSIM (Structural Similarity Index) of 0.9982 and information entropy of 7.897.
Keywords:
Image steganography
Integer wavelet transform
Rook polynomial
Josephus problem
Embedding capacity
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W