Skip Navigation

IEICE Transactions on Information and Systems 2007 E90-D(5):877-878; doi:10.1093/ietisy/e90-d.5.877
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by LO, C.-C.
Right arrow Articles by LIAO, B.-Y.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2007 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Image Processing and Video Processing

A More Robust Subsampling-Based Image Watermarking

Chih-Cheng LO1, Pao-Tung WANG1, Jeng-Shyang PAN1 and Bin-Yih LIAO1

1 The authors are with the Dept. of Electronic Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan, R.O.C. E-mail: jspan{at}cc.kuas.edu.tw


   Abstract

In this letter, we propose a novel subsampling based image watermark sequentially embedding scheme to reduce the risk of common permutation attack. The image is still perceptual after watermarking, and experimental results also show its effectiveness and robustness.

Key Words: DCT, watermark, subsampling, permutation, ordering


Manuscript received November 15, 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.