A new scrambling evaluation scheme based on spatial distribution entropy and centroid difference of bit-plane

Liang Zhao, Avishek Adhikari, Kouichi Sakurai

研究成果: 著書/レポートタイプへの貢献会議での発言

3 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルDigital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers
ページ29-44
ページ数16
DOI
出版物ステータス出版済み - 2 1 2011
イベント9th International Workshop on Digital Watermarking, IWDW 2010 - Seoul, 大韓民国
継続期間: 10 1 201010 3 2010

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6526 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他9th International Workshop on Digital Watermarking, IWDW 2010
大韓民国
Seoul
期間10/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)

これを引用

Zhao, L., Adhikari, A., & Sakurai, K. (2011). 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 (pp. 29-44). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6526 LNCS). 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. 2011. p. 29-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 6526 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Zhao, L, Adhikari, A & Sakurai, K 2011, 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 6526 LNCS, pp. 29-44, 9th International Workshop on Digital Watermarking, IWDW 2010, Seoul, 大韓民国, 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. : Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers. 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. 2011. pp. 29-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f471f3e740d545a29f089f8bfed48a02,
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 = "2",
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)",
pages = "29--44",
booktitle = "Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers",

}

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/2/1

Y1 - 2011/2/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=79251559689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79251559689&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:79251559689

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

ER -