2026-09-24T05:24:44Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/97982021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Walter Bender.
Hwang, Raymond W. (Raymond Weihau), 1975-
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-08-19T20:15:08Z
2005-08-19T20:15:08Z
1999
1999
http://hdl.handle.net/1721.1/9798
42919173
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (leaf 52).
A problem inherent in information hiding techniques for digital images is that of alignment during data extraction. This alignment problem can be solved using a search approach where a combination of coarse orientation detection, random search and gradient descent methods are employed. When used in conjunction with the Patch Track algorithm, it is possible to create an information hiding and retrieval system that is robust towards rotation, cropping and noise; successful data extraction can occur with a high degree of certainty from scanned images, rotated images and partial images. An image can be encoded with a desired piece of information (a reference number, URL etc.) with Patch Track by way of pseudo-random, imperceivable alterations of intensity throughout the image. This information can be then be extracted by the intended parties with a decoder. Various applications exist for this watermarking system including photo annotation, verification of image ownership on the Internet and data warehousing.
by Raymond W. Hwang.
M.Eng.
117 leaves
6096657 bytes
6096418 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science
A robust algorithm for information hiding in digital pictures
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2a45d147-dbf6-4c65-ae50-60249698e96b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A robust algorithm for information hiding in digital pictures</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1999</PublicationDate>
<Authors>
<Author>
<DisplayName>Hwang, Raymond W. (Raymond Weihau), 1975-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science</Keyword>
<Abstract>A problem inherent in information hiding techniques for digital images is that of alignment during data extraction. This alignment problem can be solved using a search approach where a combination of coarse orientation detection, random search and gradient descent methods are employed. When used in conjunction with the Patch Track algorithm, it is possible to create an information hiding and retrieval system that is robust towards rotation, cropping and noise; successful data extraction can occur with a high degree of certainty from scanned images, rotated images and partial images. An image can be encoded with a desired piece of information (a reference number, URL etc.) with Patch Track by way of pseudo-random, imperceivable alterations of intensity throughout the image. This information can be then be extracted by the intended parties with a decoder. Various applications exist for this watermarking system including photo annotation, verification of image ownership on the Internet and data warehousing.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>