Share Email Print
cover

Proceedings Paper

Steganography using the minimax eigenvalue decomposition
Author(s): Chaka A. Allen; Jennifer L. Davidson
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper presents result of applying the minimax eigenvalue decomposition (MED), a morphology type transform, that hides data within digital images as part of a flexible, computationally robust algorithm. This new algorithm presents a general method for hiding information within an image, although the strength of this algorithm lies in authentication. Authentication is the establishment of ownership of digital information, and is a type of watermarking. While no self-authenticating techniques are currently known, the algorithm presented here provides a certain level of self-authentication regardless of the particular information embedded in the data. The algorithm is applied to ten different images acquired over the internet, three of which are included in this document. Information in the form of a binary bit stream is inserted into each image data. A measure is created to determine how close an image containing message data is to its original image. A visual comparison is also performed. Keys, or information separate from the message data that is generated by the embedding techniques, are used to establish authenticity of the image data. This is different from most current steganography techniques that rely on embedded data integrity to establish authenticity. An analysis of the results is presented.

Paper Details

Date Published: 6 November 1998
PDF: 12 pages
Proc. SPIE 3456, Mathematics of Data/Image Coding, Compression, and Encryption, (6 November 1998); doi: 10.1117/12.330365
Show Author Affiliations
Chaka A. Allen, Teradyne Inc. (United States)
Jennifer L. Davidson, Iowa State Univ. (United States)


Published in SPIE Proceedings Vol. 3456:
Mathematics of Data/Image Coding, Compression, and Encryption
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top