A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane

Liang Zhao, Avishek Adhikari, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Watermarking is one of the most effective techniques for copyright protection and information hiding. It can be applied in many fields of our society. Nowadays, some image scrambling schemes are used as one part of the watermarking algorithm to enhance the security. Therefore, how to select an image scrambling scheme and what kind of the image scrambling scheme may be used for watermarking are the key problems. Evaluation method of the image scrambling schemes can be seen as a useful test tool for showing the property or flaw of the image scrambling method. In this paper, a new scrambling evaluation system based on spatial distribution entropy and centroid difference of bit-plane is presented to obtain the scrambling degree of image scrambling schemes. Our scheme is illustrated and justified through computer simulations. The experimental results show (in Figs. 6 and 7) that for the general gray-scale image, the evaluation degree of the corresponding cipher image for the first 4 significant bit-planes selection is nearly the same as that for the 8 bit-planes selection. That is why, instead of taking 8 bit-planes of a gray-scale image, it is sufficient to take only the first 4 significant bit-planes for the experiment to find the scrambling degree. This 50% reduction in the computational cost makes our scheme efficient.

Original languageEnglish
Title of host publicationDigital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers
EditorsHyoung-Joong Kim, Yun Qing Shi, Mauro Barni
PublisherSpringer Verlag
Pages29-44
Number of pages16
ISBN (Print)9783642184048
DOIs
Publication statusPublished - Jan 1 2011
Event9th International Workshop on Digital Watermarking, IWDW 2010 - Seoul, Korea, Republic of
Duration: Oct 1 2010Oct 3 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6526 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Workshop on Digital Watermarking, IWDW 2010
CountryKorea, Republic of
CitySeoul
Period10/1/1010/3/10

Fingerprint

Centroid
Spatial Distribution
Spatial distribution
Entropy
Watermarking
Evaluation
Copyright Protection
Information Hiding
Defects
Evaluation Method
Computer simulation
Computational Cost
Computer Simulation
Costs
Sufficient
Experiments
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zhao, L., Adhikari, A., & Sakurai, K. (2011). A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane. In H-J. Kim, Y. Q. Shi, & M. Barni (Eds.), Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers (pp. 29-44). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6526 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-18405-5_4

A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane. / Zhao, Liang; Adhikari, Avishek; Sakurai, Kouichi.

Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers. ed. / Hyoung-Joong Kim; Yun Qing Shi; Mauro Barni. Springer Verlag, 2011. p. 29-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6526 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhao, L, Adhikari, A & Sakurai, K 2011, A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane. in H-J Kim, YQ Shi & M Barni (eds), Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6526 LNCS, Springer Verlag, pp. 29-44, 9th International Workshop on Digital Watermarking, IWDW 2010, Seoul, Korea, Republic of, 10/1/10. https://doi.org/10.1007/978-3-642-18405-5_4
Zhao L, Adhikari A, Sakurai K. A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane. In Kim H-J, Shi YQ, Barni M, editors, Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers. Springer Verlag. 2011. p. 29-44. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-18405-5_4
Zhao, Liang ; Adhikari, Avishek ; Sakurai, Kouichi. / A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane. Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers. editor / Hyoung-Joong Kim ; Yun Qing Shi ; Mauro Barni. Springer Verlag, 2011. pp. 29-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1d16c4c4b2d5495784b98124a65dd3ca,
title = "A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane",
abstract = "Watermarking is one of the most effective techniques for copyright protection and information hiding. It can be applied in many fields of our society. Nowadays, some image scrambling schemes are used as one part of the watermarking algorithm to enhance the security. Therefore, how to select an image scrambling scheme and what kind of the image scrambling scheme may be used for watermarking are the key problems. Evaluation method of the image scrambling schemes can be seen as a useful test tool for showing the property or flaw of the image scrambling method. In this paper, a new scrambling evaluation system based on spatial distribution entropy and centroid difference of bit-plane is presented to obtain the scrambling degree of image scrambling schemes. Our scheme is illustrated and justified through computer simulations. The experimental results show (in Figs. 6 and 7) that for the general gray-scale image, the evaluation degree of the corresponding cipher image for the first 4 significant bit-planes selection is nearly the same as that for the 8 bit-planes selection. That is why, instead of taking 8 bit-planes of a gray-scale image, it is sufficient to take only the first 4 significant bit-planes for the experiment to find the scrambling degree. This 50{\%} reduction in the computational cost makes our scheme efficient.",
author = "Liang Zhao and Avishek Adhikari and Kouichi Sakurai",
year = "2011",
month = "1",
day = "1",
doi = "10.1007/978-3-642-18405-5_4",
language = "English",
isbn = "9783642184048",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "29--44",
editor = "Hyoung-Joong Kim and Shi, {Yun Qing} and Mauro Barni",
booktitle = "Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers",
address = "Germany",

}

TY - GEN

T1 - A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane

AU - Zhao, Liang

AU - Adhikari, Avishek

AU - Sakurai, Kouichi

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Watermarking is one of the most effective techniques for copyright protection and information hiding. It can be applied in many fields of our society. Nowadays, some image scrambling schemes are used as one part of the watermarking algorithm to enhance the security. Therefore, how to select an image scrambling scheme and what kind of the image scrambling scheme may be used for watermarking are the key problems. Evaluation method of the image scrambling schemes can be seen as a useful test tool for showing the property or flaw of the image scrambling method. In this paper, a new scrambling evaluation system based on spatial distribution entropy and centroid difference of bit-plane is presented to obtain the scrambling degree of image scrambling schemes. Our scheme is illustrated and justified through computer simulations. The experimental results show (in Figs. 6 and 7) that for the general gray-scale image, the evaluation degree of the corresponding cipher image for the first 4 significant bit-planes selection is nearly the same as that for the 8 bit-planes selection. That is why, instead of taking 8 bit-planes of a gray-scale image, it is sufficient to take only the first 4 significant bit-planes for the experiment to find the scrambling degree. This 50% reduction in the computational cost makes our scheme efficient.

AB - Watermarking is one of the most effective techniques for copyright protection and information hiding. It can be applied in many fields of our society. Nowadays, some image scrambling schemes are used as one part of the watermarking algorithm to enhance the security. Therefore, how to select an image scrambling scheme and what kind of the image scrambling scheme may be used for watermarking are the key problems. Evaluation method of the image scrambling schemes can be seen as a useful test tool for showing the property or flaw of the image scrambling method. In this paper, a new scrambling evaluation system based on spatial distribution entropy and centroid difference of bit-plane is presented to obtain the scrambling degree of image scrambling schemes. Our scheme is illustrated and justified through computer simulations. The experimental results show (in Figs. 6 and 7) that for the general gray-scale image, the evaluation degree of the corresponding cipher image for the first 4 significant bit-planes selection is nearly the same as that for the 8 bit-planes selection. That is why, instead of taking 8 bit-planes of a gray-scale image, it is sufficient to take only the first 4 significant bit-planes for the experiment to find the scrambling degree. This 50% reduction in the computational cost makes our scheme efficient.

UR - http://www.scopus.com/inward/record.url?scp=85036664692&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036664692&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18405-5_4

DO - 10.1007/978-3-642-18405-5_4

M3 - Conference contribution

AN - SCOPUS:85036664692

SN - 9783642184048

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 29

EP - 44

BT - Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers

A2 - Kim, Hyoung-Joong

A2 - Shi, Yun Qing

A2 - Barni, Mauro

PB - Springer Verlag

ER -