earticle

논문검색

A New (n, n)-threshold Reversible Secret Image Sharing Using Histogram Shifting

초록

영어

In this paper, we propose a (n, n)-threshold reversible secret image sharing scheme using histogram shifting. Unlike Shamir’s secret sharing, the proposed scheme does not use a polynomial. In the secret image sharing procedure, a histogram is generated by the difference value between the original and copy images. And, the secret image is embedded into original and copy images by using histogram shifting. Lastly, generated shadow images are distributed to each participant. In the experimental results, we measure embedding capacity of secret image and a distortion ratio between original and shadow images. The experimental results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

목차

Abstract
 1. Introduction
 2. Related Works
  2.1. Histogram Shifting
  2.2. Lin and Chan’s Scheme
 3. The Proposed Scheme
  3.1. Distributing Phase
  3.2. Reconstruct Phase
 4. The Experimental Results
  4.1. The Estimation of Peak Significant Noise Ratio
  4.2. The Estimation of Embedding Capacity
 5. Conclusions
 Acknowledgements
 References

저자정보

  • Gil-Je Lee School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea
  • Dae-Soo Kim School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea
  • Kee-Young Yoo School of Computer Science and Engineering, Kyungpook National University, Daegu, South Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.