Steganographic Capacity of Images, based on Image Equivalence Classes

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Steganographic Capacity of Images, based on Image Equivalence Classes. / Hansen, Klaus; Hammer, Christian; Andersen, Jens Damgaard; Randleff, Lars R.

Proceedings ACM Multimedia '01: Workshop on Multimedia and Security. Association for Computing Machinery, 2001. p. 36-39.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Hansen, K, Hammer, C, Andersen, JD & Randleff, LR 2001, Steganographic Capacity of Images, based on Image Equivalence Classes. in Proceedings ACM Multimedia '01: Workshop on Multimedia and Security. Association for Computing Machinery, pp. 36-39, ACM Multimedia '01, Workshop on Multimedia and Security, Ottawa, Canada, 30/09/2001.

APA

Hansen, K., Hammer, C., Andersen, J. D., & Randleff, L. R. (2001). Steganographic Capacity of Images, based on Image Equivalence Classes. In Proceedings ACM Multimedia '01: Workshop on Multimedia and Security (pp. 36-39). Association for Computing Machinery.

Vancouver

Hansen K, Hammer C, Andersen JD, Randleff LR. Steganographic Capacity of Images, based on Image Equivalence Classes. In Proceedings ACM Multimedia '01: Workshop on Multimedia and Security. Association for Computing Machinery. 2001. p. 36-39

Author

Hansen, Klaus ; Hammer, Christian ; Andersen, Jens Damgaard ; Randleff, Lars R. / Steganographic Capacity of Images, based on Image Equivalence Classes. Proceedings ACM Multimedia '01: Workshop on Multimedia and Security. Association for Computing Machinery, 2001. pp. 36-39

Bibtex

@inproceedings{7ae6f100ee0711ddbf70000ea68e967b,
title = "Steganographic Capacity of Images, based on Image Equivalence Classes",
abstract = "The problem of hiding information imperceptibly can be formulated as the problem of determining if a given image is a member of a sufficiently large equivalence class of images which to the Human Visual System appears to be the same image. This makes it possible to replace the given image with a modified image similar in appearance but carrying imperceptibly coded information. This paper presents a framework and an experimental algorithm to estimate upper bounds for the size of an equivalence class.",
keywords = "Faculty of Science, datalogi, billedbehandling, kodning og informationsteori, vandm{\ae}rkning, computer science, image processing and computer vision, coding and information Theory, digital watermarking, information hiding, image equivalence classes, perceptual tolerance",
author = "Klaus Hansen and Christian Hammer and Andersen, {Jens Damgaard} and Randleff, {Lars R.}",
year = "2001",
language = "English",
isbn = "1-58113-393-6",
pages = "36--39",
booktitle = "Proceedings ACM Multimedia '01",
publisher = "Association for Computing Machinery",
note = "null ; Conference date: 30-09-2001 Through 05-10-2001",

}

RIS

TY - GEN

T1 - Steganographic Capacity of Images, based on Image Equivalence Classes

AU - Hansen, Klaus

AU - Hammer, Christian

AU - Andersen, Jens Damgaard

AU - Randleff, Lars R.

PY - 2001

Y1 - 2001

N2 - The problem of hiding information imperceptibly can be formulated as the problem of determining if a given image is a member of a sufficiently large equivalence class of images which to the Human Visual System appears to be the same image. This makes it possible to replace the given image with a modified image similar in appearance but carrying imperceptibly coded information. This paper presents a framework and an experimental algorithm to estimate upper bounds for the size of an equivalence class.

AB - The problem of hiding information imperceptibly can be formulated as the problem of determining if a given image is a member of a sufficiently large equivalence class of images which to the Human Visual System appears to be the same image. This makes it possible to replace the given image with a modified image similar in appearance but carrying imperceptibly coded information. This paper presents a framework and an experimental algorithm to estimate upper bounds for the size of an equivalence class.

KW - Faculty of Science

KW - datalogi

KW - billedbehandling

KW - kodning og informationsteori

KW - vandmærkning

KW - computer science

KW - image processing and computer vision

KW - coding and information Theory

KW - digital watermarking

KW - information hiding

KW - image equivalence classes

KW - perceptual tolerance

M3 - Article in proceedings

SN - 1-58113-393-6

SP - 36

EP - 39

BT - Proceedings ACM Multimedia '01

PB - Association for Computing Machinery

Y2 - 30 September 2001 through 5 October 2001

ER -

ID: 9998982