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
Dalam kertas kerja ini, satu kaedah dicadangkan untuk membina an n-daripada-n skim perkongsian rahsia visual untuk imej skala kelabu, secara ringkasnya (n,nSkim )-VSS-GS, yang optimum dalam erti kata kontras dan pengembangan piksel, iaitu, resolusi. Ia ditunjukkan bahawa mana-mana (n,nSkim )-VSS-GS boleh dibina berdasarkan apa yang dipanggil perwakilan polinomial bagi matriks asas yang dirawat dalam [15],[16]. Tambahan pula, terbukti bahawa pembinaan tersebut boleh mencapai tahap optimum (n,n)-Skim VSS-GS.
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.
Salinan
Mitsugu IWAMOTO, Hirosuke YAMAMOTO, "The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 10, pp. 2238-2247, October 2002, doi: .
Abstract: In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_10_2238/_p
Salinan
@ARTICLE{e85-a_10_2238,
author={Mitsugu IWAMOTO, Hirosuke YAMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images},
year={2002},
volume={E85-A},
number={10},
pages={2238-2247},
abstract={In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.},
keywords={},
doi={},
ISSN={},
month={October},}
Salinan
TY - JOUR
TI - The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2238
EP - 2247
AU - Mitsugu IWAMOTO
AU - Hirosuke YAMAMOTO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2002
AB - In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.
ER -