Scholarlink

<p>A size-invariant OR and XOR-based <i>(k</i>,<i> k)</i> and <i>(k</i>,<i> n)</i> visual cryptography scheme based on parity basis matrices was recently introduced by Y. Zhao and F.-W. Fu. The recovered image’s contrast suffers under this technique. In this work, we resolved the contrast problem and produced the <i>(k</i>,<i> k)</i> and <i>(k</i>,<i> n)</i> schemes, which rely on the selection of parity basis matrices. The precise recovery of the black and white pixels from the secret image determines the contrast of the decrypted image. The perfect recovery of the black and white pixels can be defined based on the aggregate number of black and white pixels in the secret image. The selection of parity basis matrices also depends on the black and white pixel count of the secret image. With our strategy, we achieved the same theoretical contrast as reported by Y. Zhao and F.-W. Fu. Experimental evaluations indicate that the proposed scheme outperforms other existing schemes in terms of contrast. Using comparative analysis supported by tables and graphs, we have examined the efficiency of the proposed models. The increased image contrast achieved by the scheme enables more effective use in real-world scenarios, including secure image communication, encrypted archival of sensitive images, and protected dissemination of visual data.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Contrast-enhanced size invariant visual cryptography schemes based on parity basis matrices

  • 期刊论文

  • 发表日期：

    2026年3月19日

查看全文
  • T. E. Jisha,
  • Thomas Monoth

摘要

A size-invariant OR and XOR-based (k, k) and (k, n) visual cryptography scheme based on parity basis matrices was recently introduced by Y. Zhao and F.-W. Fu. The recovered image’s contrast suffers under this technique. In this work, we resolved the contrast problem and produced the (k, k) and (k, n) schemes, which rely on the selection of parity basis matrices. The precise recovery of the black and white pixels from the secret image determines the contrast of the decrypted image. The perfect recovery of the black and white pixels can be defined based on the aggregate number of black and white pixels in the secret image. The selection of parity basis matrices also depends on the black and white pixel count of the secret image. With our strategy, we achieved the same theoretical contrast as reported by Y. Zhao and F.-W. Fu. Experimental evaluations indicate that the proposed scheme outperforms other existing schemes in terms of contrast. Using comparative analysis supported by tables and graphs, we have examined the efficiency of the proposed models. The increased image contrast achieved by the scheme enables more effective use in real-world scenarios, including secure image communication, encrypted archival of sensitive images, and protected dissemination of visual data.