Embedding gray level images

Jiwu Huang; Yun Q. Shi

doi:10.1109/iscas.2001.922029

Embedding gray level images

Jiwu Huang, Yun Q. Shi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

25 Scopus citations

Abstract

Hiding a gray scale image encounters some difficulties. In this paper, a DCT-based image hiding algorithm is proposed. The bit rate of the hidden image is reduced by applying an image compression technique. To extract the hidden data from the corrupted watermarked image, BCH coding and matched filtering are applied. With the proposed algorithm, we hide a gray scale image of 64×64×8 in an image of 512×512×8. The experimental results demonstrated that the embedded image can be extracted reliably from noisy watermarked images.

Original language	English (US)
Title of host publication	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Publisher	IEEE Computer Society
Pages	239-242
Number of pages	4
ISBN (Print)	0780366859, 9780780366855
DOIs	https://doi.org/10.1109/iscas.2001.922029
State	Published - 2001
Event	2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 - Sydney, NSW, Australia Duration: May 6 2001 → May 9 2001

Publication series

Name	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Volume	5

Other

Other	2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001
Country/Territory	Australia
City	Sydney, NSW
Period	5/6/01 → 5/9/01

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Electrical and Electronic Engineering
Hardware and Architecture

Keywords

2-D watermark
BCH-Matched Filtering
Hiding Image
Information Hiding

Access to Document

10.1109/iscas.2001.922029

Cite this

@inproceedings{ab92c817a7c34583b29b7e073c6b9feb,

title = "Embedding gray level images",

abstract = "Hiding a gray scale image encounters some difficulties. In this paper, a DCT-based image hiding algorithm is proposed. The bit rate of the hidden image is reduced by applying an image compression technique. To extract the hidden data from the corrupted watermarked image, BCH coding and matched filtering are applied. With the proposed algorithm, we hide a gray scale image of 64×64×8 in an image of 512×512×8. The experimental results demonstrated that the embedded image can be extracted reliably from noisy watermarked images.",

keywords = "2-D watermark, BCH-Matched Filtering, Hiding Image, Information Hiding",

author = "Jiwu Huang and Shi, {Yun Q.}",

year = "2001",

doi = "10.1109/iscas.2001.922029",

language = "English (US)",

isbn = "0780366859",

series = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

publisher = "IEEE Computer Society",

pages = "239--242",

booktitle = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

address = "United States",

note = "2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 ; Conference date: 06-05-2001 Through 09-05-2001",

}

Huang, J & Shi, YQ 2001, Embedding gray level images. in ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings., 922029, ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings, vol. 5, IEEE Computer Society, pp. 239-242, 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001, Sydney, NSW, Australia, 5/6/01. https://doi.org/10.1109/iscas.2001.922029

Embedding gray level images. / Huang, Jiwu; Shi, Yun Q.
ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings. IEEE Computer Society, 2001. p. 239-242 922029 (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 5).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Embedding gray level images

AU - Huang, Jiwu

AU - Shi, Yun Q.

PY - 2001

Y1 - 2001

N2 - Hiding a gray scale image encounters some difficulties. In this paper, a DCT-based image hiding algorithm is proposed. The bit rate of the hidden image is reduced by applying an image compression technique. To extract the hidden data from the corrupted watermarked image, BCH coding and matched filtering are applied. With the proposed algorithm, we hide a gray scale image of 64×64×8 in an image of 512×512×8. The experimental results demonstrated that the embedded image can be extracted reliably from noisy watermarked images.

AB - Hiding a gray scale image encounters some difficulties. In this paper, a DCT-based image hiding algorithm is proposed. The bit rate of the hidden image is reduced by applying an image compression technique. To extract the hidden data from the corrupted watermarked image, BCH coding and matched filtering are applied. With the proposed algorithm, we hide a gray scale image of 64×64×8 in an image of 512×512×8. The experimental results demonstrated that the embedded image can be extracted reliably from noisy watermarked images.

KW - 2-D watermark

KW - BCH-Matched Filtering

KW - Hiding Image

KW - Information Hiding

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

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

U2 - 10.1109/iscas.2001.922029

DO - 10.1109/iscas.2001.922029

M3 - Conference contribution

AN - SCOPUS:0034997692

SN - 0780366859

SN - 9780780366855

T3 - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

SP - 239

EP - 242

BT - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

PB - IEEE Computer Society

T2 - 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001

Y2 - 6 May 2001 through 9 May 2001

ER -

Embedding gray level images

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this