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)-esquema visual de compartilhamento de segredos ((k,n)-VSSS) é um método para dividir uma imagem secreta em n imagens chamadas partes que nos permitem restaurar a imagem original empilhando apenas pelo menos k deles sem quaisquer cálculos complicados. Neste artigo, consideramos (2,2)-VSSS o compartilhamento de duas imagens secretas ao mesmo tempo apenas por dois compartilhamentos e investigamos métodos para melhorar a qualidade das imagens decodificadas. Mais precisamente, consideramos (2,2)-VSSS em que a primeira imagem secreta é decodificada empilhando esses dois compartilhamentos da maneira usual, enquanto a segunda é feita empilhando esses dois compartilhamentos da maneira como um deles é usado. reversivelmente. Como os compartilhamentos devem ter alguns subpixels que correspondem inconsistentemente aos pixels das imagens secretas, os pixels decodificados não coincidem com os pixels correspondentes das imagens secretas, o que causa séria degradação da qualidade das imagens decodificadas. Para reduzir tal degradação, propomos vários métodos para construir ações que utilizam Filtro Laplaciano de 8 vizinhos e meio-tom. Em seguida, mostramos que os métodos propostos podem efetivamente melhorar a qualidade das imagens decodificadas. Além disso, demonstramos que os métodos propostos podem ser estendidos naturalmente para (2,2)-VSSS para imagens RGB.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -