EFFICACY OF PIXEL SWAP-BASED STEGANOGRAPHIC ALGORITHMS IN GRAYSCALE IMAGES
ประสิทธิภาพการอําพรางข้อมูลบนภาพระดับสีเทาด้วยวิธีการสลับค่าสีของพิกเซล
by SAITULAA NARANONG; SAITULAA NARANONG; Surapong Auwatanamongkol; สุรพงค์ เอื้อวัฒนามงคล
Title: | EFFICACY OF PIXEL SWAP-BASED STEGANOGRAPHIC ALGORITHMS IN GRAYSCALE IMAGES ประสิทธิภาพการอําพรางข้อมูลบนภาพระดับสีเทาด้วยวิธีการสลับค่าสีของพิกเซล |
Advisor: | Surapong Auwatanamongkol
สุรพงค์ เอื้อวัฒนามงคล |
Issued date: | 3/6/2022 |
Publisher: | National Institute of Development Administration |
Abstract: |
The field of steganography deals with the encoding of hidden messages into other data, called the cover, in a manner that makes it non-obvious that a hidden message exists. Though steganography does not necessarily, on its own, encrypt the hidden data beyond deciphering, it can be used as a supplement to encryption, avoiding unnecessary attention from adversaries who may otherwise take additional measures if aware of the secret message. Many types of cover media may be used, ranging from text and formatted text documents, to audio and video, and images. Our study focuses on grayscale images as the choice of cover media.
Many kinds of image steganography already exist. The most common, Least Significant Bit (LSB) steganography, efficiently hides data within pixels’ intensity values, in a manner unnoticeable to the naked eye. Because LSB alters the cover image’s first-order statistics, however, it is often detectable through steganalysis methods such as Sample Pair Analysis. While less-detectable variants of LSB, as well as other methods, have been separately introduced, we focus on permutationbased methods that avoid this disadvantage through not alternating the first-order statistics to begin with.
Several pixel-swapping algorithms have already been introduced in the literature. We generalize upon those methods by allowing general permutations within larger sets of pixels and intensities, called permissible sets. By design, these permissible sets are an invariant, ensuring that both encoder and decoder read the same ones, even post-permutation. To serve as support for this technique, a supporting theory of multiset permutation is devised and applied.
The wider range of possible permutations increases the bit-per-pixel embedding rate over swap-based methods, in a manner that also reduces detectability. Direct implementation and comparison shows our method to improve upon previous swap-based steganography for the Microsoft Research Cambridge dataset of general images, for fixed bit-per-pixel rates. It also shows a larger improvement for the NoisyOffice dataset of scanned images. |
Keyword(s): | grayscale images
image steganography permutation-based steganography scanned images swap-based steganography |
Type: | Text |
Language: | eng |
URI: | https://repository.nida.ac.th/handle/662723737/5849 |
Files in this item (CONTENT) |
|
View ทรัพยากรสารสนเทศทั้งหมดในคลังปัญญา ใช้เพื่อประโยชน์ทางการเรียนการสอนและการค้นคว้าเท่านั้น และต้องมีการอ้างอิงแหล่งที่มาทุกครั้งที่นำไปใช้ ห้ามดัดแปลงเนื้อหา และทำสำเนาต่อ รวมถึงไม่ให้อนุญาตนำไปใช้ประโยชน์เพื่อการค้า ไม่ว่ากรณีใด ๆ ทั้งสิ้น
|
This item appears in the following Collection(s) |
|