High quality perceptual steganographic techniques

Kisik Chang, Changho Jung, Sangjin Lee, Wooil Yang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Recently, several steganographic algorithms for two-color binary images have been proposed[16, 1, 14, 2]. In this paper, we propose steganographic algorithms which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m × n blocks, and embeds a r-bit(r = [log 2(mn + 1)] - 1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the sequential substitution schemes [10, 7, 11].

Original languageEnglish
Pages (from-to)518-531
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2939
Publication statusPublished - 2004 Dec 1

Fingerprint

Color
Pixels
Pixel
Binary images
Binary Image
Color Image
Substitution reactions
Divides
Substitution
Degradation
Maximise
Binary
Minimise

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

High quality perceptual steganographic techniques. / Chang, Kisik; Jung, Changho; Lee, Sangjin; Yang, Wooil.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2939, 01.12.2004, p. 518-531.

Research output: Contribution to journalArticle

@article{369938930a4b4df290113d7ec6e6c0d2,
title = "High quality perceptual steganographic techniques",
abstract = "Recently, several steganographic algorithms for two-color binary images have been proposed[16, 1, 14, 2]. In this paper, we propose steganographic algorithms which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m × n blocks, and embeds a r-bit(r = [log 2(mn + 1)] - 1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the sequential substitution schemes [10, 7, 11].",
author = "Kisik Chang and Changho Jung and Sangjin Lee and Wooil Yang",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "2939",
pages = "518--531",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - High quality perceptual steganographic techniques

AU - Chang, Kisik

AU - Jung, Changho

AU - Lee, Sangjin

AU - Yang, Wooil

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Recently, several steganographic algorithms for two-color binary images have been proposed[16, 1, 14, 2]. In this paper, we propose steganographic algorithms which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m × n blocks, and embeds a r-bit(r = [log 2(mn + 1)] - 1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the sequential substitution schemes [10, 7, 11].

AB - Recently, several steganographic algorithms for two-color binary images have been proposed[16, 1, 14, 2]. In this paper, we propose steganographic algorithms which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m × n blocks, and embeds a r-bit(r = [log 2(mn + 1)] - 1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the sequential substitution schemes [10, 7, 11].

UR - http://www.scopus.com/inward/record.url?scp=35048849609&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048849609&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048849609

VL - 2939

SP - 518

EP - 531

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -