Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2008
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2008
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2008
License: CC BY
Data sources: ZENODO
versions View all 2 versions
addClaim

A Nonoblivious Image Watermarking System Based On Singular Value Decomposition And Texture Segmentation

Authors: Soroosh Rezazadeh; Mehran Yazdi;

A Nonoblivious Image Watermarking System Based On Singular Value Decomposition And Texture Segmentation

Abstract

{"references": ["F. Hartung and M. Kutter, \"Multimedia Watermarking Techniques,\"\nProceedings of the IEEE, vol. 87, no. 7, pp. 1079-1107, 1999.", "R. Liu and T. Tan, \"An SVD-Based Watermarking Scheme for\nProtecting Rightful Ownership,\" IEEE Transactions on Multimedia, vol.\n4, no. 1, pp. 121-128, Mar. 2002.", "X.P. Zhang and K. Li, \"Comments on \"An SVD-based watermarking\nscheme for protecting rightful Ownership\",\" IEEE Transactions on\nMultimedia, vol. 7, no. 2, pp. 593-594, April 2005.", "D.V.S. Chandra, \"Digital Image Watermarking Using Singular Value\nDecomposition,\" Proceedings of 45th IEEE Midwest Symposium on\nCircuits and Systems, Tulsa, Oklahoma, USA, vol. 3, pp. 264-267, Aug.\n2002.", "Y.D. Chung and C.H. Kim, \"Robust Image Watermarking Against\nFiltering Attacks,\" SICE Annual Conference, Fukui, Japan, vol. 3, pp.\n3017-3020, Aug. 2003.", "T. Xianghong, Y. Lianjie, and L. Lu, N. Yamei, \"Study on a\nMultifunction Watermarking Algorithm,\" Proceedings of IEEE 7th\nInternational Conference on Signal Precessing, vol. 1, pp. 848-852,\nSept. 2004.", "T. Xianghong, Y. Lianjie, Y. Hengli, and Y. Zhongke, \"A Watermarking\nAlgorithm Based on the SVD and Hadamard Transform,\" Proceedings\nof IEEE International Conference on Communications, Circuits and\nSystems, vol. 2, pp. 874-877, 2005.", "V.I. Gorodetski, L.J. Popyack, V. Samoilov, and V.A. Skormin, \"SVDBased\nApproach to Transparent Embedding Data into Digital Images,\"\nInternational Workshop on Mathematical Methods, Models and\nArchitectures for Computer Network Security, St. Petersburg, Russia,\nvol. 2052, pp. 263-274, May 2001.", "A. B. Watson, R. Borthwick, and M. Taylor, \"Image Quality and\nEntropy Masking,\" Proceedings of SPIE on Human Vision and\nElectronic Imaging, Vol. 3016, pp. 2-12, 1997.\n[10] S. Suthaharan, S. W. Kim, H. K. Lee, and S. Sathananthan,\n\"Perceptually Tuned Robust Watermarking Scheme for Digital Images,\"\nPattern Recognition Letters, vol. 21, no. 2, pp. 145-149, 2000.\n[11] S. W. Kim, S. Suthaharan, \"An Entropy Masking Model for Multimedia\nContent Watermarking,\" IEEE International Conference on System\nSciences, 2004.\n[12] R. C. Gonzalez, R. E. Woods, \"Digital Image processing,\" Second\nEdition, Prentice Hall Inc, 2002.\n[13] I. J.Cox, J. Killian, F. T. Leighton, and T. Shamoon, \"Secure Spread\nSpectrum Watermarking for Multimedia,\" IEEE Transactions on Image\nProcessing,vol. 6, no. 12, pp. 1673-1687, 1997.\n[14] X. G. Xia, C. G. Boncelet, and G. R. Arce, \"Wavelet Transform Based\nWatermark for Digital Images,\" Optics Express, vol. 3, no. 12, pp. 497-\n511, Dec. 1998."]}

In this paper, a robust digital image watermarking scheme for copyright protection applications using the singular value decomposition (SVD) is proposed. In this scheme, an entropy masking model has been applied on the host image for the texture segmentation. Moreover, the local luminance and textures of the host image are considered for watermark embedding procedure to increase the robustness of the watermarking scheme. In contrast to all existing SVD-based watermarking systems that have been designed to embed visual watermarks, our system uses a pseudo-random sequence as a watermark. We have tested the performance of our method using a wide variety of image processing attacks on different test images. A comparison is made between the results of our proposed algorithm with those of a wavelet-based method to demonstrate the superior performance of our algorithm.

Keywords

singular value decomposition, copyright protection, Watermarking, entropy masking, texture segmentation.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 2
    download downloads 5
  • 2
    views
    5
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
2
5
Green