The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
(k,n)-시각적 비밀 공유 방식((k,n)-VSSS)는 비밀영상을 분할하는 방식이다. n 라는 이미지 주식 최소한 쌓아두기만 하면 원본 이미지를 복원할 수 있습니다. k 복잡한 계산 없이 말이죠. 본 논문에서는 (2,2)-VSSS가 2,2개의 비밀 이미지를 XNUMX개의 공유만으로 동시에 공유하는 것을 고려하고, 디코딩된 이미지의 품질을 향상시키는 방법을 조사합니다. 보다 정확하게는 첫 번째 비밀 이미지가 일반적인 방식으로 두 공유를 쌓아서 디코딩되는 반면, 두 번째 비밀 이미지는 두 공유 중 하나가 사용되는 방식으로 쌓아서 수행되는 (XNUMX)-VSSS를 고려합니다. 가역적으로. 공유에는 비밀 이미지의 픽셀과 일치하지 않는 일부 하위 픽셀이 있어야 하기 때문에 디코딩된 픽셀은 비밀 이미지의 해당 픽셀과 일치하지 않으며 이는 디코딩된 이미지의 품질을 심각하게 저하시킵니다. 이러한 저하를 줄이기 위해 우리는 다음을 활용하는 지분을 구성하는 몇 가지 방법을 제안합니다. 8개 이웃 라플라시안 필터 and 하프톤. 그런 다음 제안된 방법이 디코딩된 이미지의 품질을 효과적으로 향상시킬 수 있음을 보여줍니다. 또한 제안된 방법이 RGB 이미지의 (2,2)-VSSS로 자연스럽게 확장될 수 있음을 보여줍니다.
Mariko FUJII
Sophia University
Tomoharu SHIBUYA
Sophia University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Mariko FUJII, Tomoharu SHIBUYA, "Improvement of the Quality of Visual Secret Sharing Schemes with Constraints on the Usage of Shares" in IEICE TRANSACTIONS on Information,
vol. E103-D, no. 1, pp. 11-24, January 2020, doi: 10.1587/transinf.2019MUP0005.
Abstract: (k,n)-visual secret sharing scheme ((k,n)-VSSS) is a method to divide a secret image into n images called shares that enable us to restore the original image by only stacking at least k of them without any complicated computations. In this paper, we consider (2,2)-VSSS to share two secret images at the same time only by two shares, and investigate the methods to improve the quality of decoded images. More precisely, we consider (2,2)-VSSS in which the first secret image is decoded by stacking those two shares in the usual way, while the second one is done by stacking those two shares in the way that one of them is used reversibly. Since the shares must have some subpixels that inconsistently correspond to pixels of the secret images, the decoded pixels do not agree with the corresponding pixels of the secret images, which causes serious degradation of the quality of decoded images. To reduce such degradation, we propose several methods to construct shares that utilize 8-neighbor Laplacian filter and halftoning. Then we show that the proposed methods can effectively improve the quality of decoded images. Moreover, we demonstrate that the proposed methods can be naturally extended to (2,2)-VSSS for RGB images.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019MUP0005/_p
부
@ARTICLE{e103-d_1_11,
author={Mariko FUJII, Tomoharu SHIBUYA, },
journal={IEICE TRANSACTIONS on Information},
title={Improvement of the Quality of Visual Secret Sharing Schemes with Constraints on the Usage of Shares},
year={2020},
volume={E103-D},
number={1},
pages={11-24},
abstract={(k,n)-visual secret sharing scheme ((k,n)-VSSS) is a method to divide a secret image into n images called shares that enable us to restore the original image by only stacking at least k of them without any complicated computations. In this paper, we consider (2,2)-VSSS to share two secret images at the same time only by two shares, and investigate the methods to improve the quality of decoded images. More precisely, we consider (2,2)-VSSS in which the first secret image is decoded by stacking those two shares in the usual way, while the second one is done by stacking those two shares in the way that one of them is used reversibly. Since the shares must have some subpixels that inconsistently correspond to pixels of the secret images, the decoded pixels do not agree with the corresponding pixels of the secret images, which causes serious degradation of the quality of decoded images. To reduce such degradation, we propose several methods to construct shares that utilize 8-neighbor Laplacian filter and halftoning. Then we show that the proposed methods can effectively improve the quality of decoded images. Moreover, we demonstrate that the proposed methods can be naturally extended to (2,2)-VSSS for RGB images.},
keywords={},
doi={10.1587/transinf.2019MUP0005},
ISSN={1745-1361},
month={January},}
부
TY - JOUR
TI - Improvement of the Quality of Visual Secret Sharing Schemes with Constraints on the Usage of Shares
T2 - IEICE TRANSACTIONS on Information
SP - 11
EP - 24
AU - Mariko FUJII
AU - Tomoharu SHIBUYA
PY - 2020
DO - 10.1587/transinf.2019MUP0005
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E103-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2020
AB - (k,n)-visual secret sharing scheme ((k,n)-VSSS) is a method to divide a secret image into n images called shares that enable us to restore the original image by only stacking at least k of them without any complicated computations. In this paper, we consider (2,2)-VSSS to share two secret images at the same time only by two shares, and investigate the methods to improve the quality of decoded images. More precisely, we consider (2,2)-VSSS in which the first secret image is decoded by stacking those two shares in the usual way, while the second one is done by stacking those two shares in the way that one of them is used reversibly. Since the shares must have some subpixels that inconsistently correspond to pixels of the secret images, the decoded pixels do not agree with the corresponding pixels of the secret images, which causes serious degradation of the quality of decoded images. To reduce such degradation, we propose several methods to construct shares that utilize 8-neighbor Laplacian filter and halftoning. Then we show that the proposed methods can effectively improve the quality of decoded images. Moreover, we demonstrate that the proposed methods can be naturally extended to (2,2)-VSSS for RGB images.
ER -