Lossless data hiding: Fundamentals, algorithms and applications

Yun Q. Shi; Zhicheng Ni; Dekun Zou; Changyin Liang; Guorong Xuan

Lossless data hiding: Fundamentals, algorithms and applications

Yun Q. Shi, Zhicheng Ni, Dekun Zou, Changyin Liang, Guorong Xuan

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

141 Scopus citations

Abstract

Recently, among various data hiding techniques, a new subset called lossless data hiding has drawn tremendous interests. By lossless data hiding, it is meant that the marked media can be reversed to the original cover media without any distortion after the hidden data are retrieved. After a careful study of all lossless data hiding algorithms published up to today, we classify the existing algorithms into three categories: 1) Those developed for fragile authentication; 2) Those developed aiming at large embedding capacity; 3) Those developed for semi-fragile authentication. The mechanisms, merits, drawbacks and applications of these algorithms are analyzed, and some future research issues are addressed in this paper.

Original language	English (US)
Pages (from-to)	II33-II36
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	2
State	Published - 2004
Event	2004 IEEE International Symposium on Cirquits and Systems - Proceedings - Vancouver, BC, Canada Duration: May 23 2004 → May 26 2004

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Keywords

Lossless data hiding
Reversible data hiding
Robust lossless data hiding
Watermarking

Cite this

@article{9488a6fde422402d8b0434f50a932f8f,

title = "Lossless data hiding: Fundamentals, algorithms and applications",

abstract = "Recently, among various data hiding techniques, a new subset called lossless data hiding has drawn tremendous interests. By lossless data hiding, it is meant that the marked media can be reversed to the original cover media without any distortion after the hidden data are retrieved. After a careful study of all lossless data hiding algorithms published up to today, we classify the existing algorithms into three categories: 1) Those developed for fragile authentication; 2) Those developed aiming at large embedding capacity; 3) Those developed for semi-fragile authentication. The mechanisms, merits, drawbacks and applications of these algorithms are analyzed, and some future research issues are addressed in this paper.",

keywords = "Lossless data hiding, Reversible data hiding, Robust lossless data hiding, Watermarking",

author = "Shi, {Yun Q.} and Zhicheng Ni and Dekun Zou and Changyin Liang and Guorong Xuan",

year = "2004",

language = "English (US)",

volume = "2",

pages = "II33--II36",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2004 IEEE International Symposium on Cirquits and Systems - Proceedings ; Conference date: 23-05-2004 Through 26-05-2004",

}

TY - JOUR

T1 - Lossless data hiding

T2 - 2004 IEEE International Symposium on Cirquits and Systems - Proceedings

AU - Shi, Yun Q.

AU - Ni, Zhicheng

AU - Zou, Dekun

AU - Liang, Changyin

AU - Xuan, Guorong

PY - 2004

Y1 - 2004

N2 - Recently, among various data hiding techniques, a new subset called lossless data hiding has drawn tremendous interests. By lossless data hiding, it is meant that the marked media can be reversed to the original cover media without any distortion after the hidden data are retrieved. After a careful study of all lossless data hiding algorithms published up to today, we classify the existing algorithms into three categories: 1) Those developed for fragile authentication; 2) Those developed aiming at large embedding capacity; 3) Those developed for semi-fragile authentication. The mechanisms, merits, drawbacks and applications of these algorithms are analyzed, and some future research issues are addressed in this paper.

AB - Recently, among various data hiding techniques, a new subset called lossless data hiding has drawn tremendous interests. By lossless data hiding, it is meant that the marked media can be reversed to the original cover media without any distortion after the hidden data are retrieved. After a careful study of all lossless data hiding algorithms published up to today, we classify the existing algorithms into three categories: 1) Those developed for fragile authentication; 2) Those developed aiming at large embedding capacity; 3) Those developed for semi-fragile authentication. The mechanisms, merits, drawbacks and applications of these algorithms are analyzed, and some future research issues are addressed in this paper.

KW - Lossless data hiding

KW - Reversible data hiding

KW - Robust lossless data hiding

KW - Watermarking

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

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

M3 - Conference article

AN - SCOPUS:4344700913

SN - 0271-4310

VL - 2

SP - II33-II36

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

Y2 - 23 May 2004 through 26 May 2004

ER -

Lossless data hiding: Fundamentals, algorithms and applications

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Other files and links

Fingerprint

Cite this