$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

[국내논문] 가변 길이 자료 은닉이 가능한 이미지 스테가노그래픽 방법 연구
Image Steganographic Method using Variable Length for Data Embedding 원문보기

韓國軍事科學技術學會誌 = Journal of the KIMST, v.11 no.3 = no.34, 2008년, pp.115 - 122  

정기현 (영진전문대학 컴퓨터정보계열)

Abstract AI-Helper 아이콘AI-Helper

Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they m...

주제어

AI 본문요약
AI-Helper 아이콘 AI-Helper

* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.

제안 방법

  • Some techniques are highly resistant to geometric modifications, while others are more resistant to non-geometric modifications, like as filtering. An image quality index and bit capacity are employed to evaluate the proposed method, in which the secret data are stored behind the host image in a way imperceptible to human vision.
  • This paper proposes a scheme that can provide a superior secret data embedding mechanism that is imperceptible to human vision. Moreover, the new method solves the fall off the boundary problem(FOBP).
  • Wu and Tsai's pixel-value differencing is often referenced to embed secret data. In the proposed method, the experiment was based on selecting the range widths of 8, 8, 16, 32, 64 and 128, which partition the total range of [0, 255] into [0, 7], [8, 15], [16, 31], [32, 63], [64, 127], [128, 255]. We will explain the FOBP issue as it affects range width when using Wu and Tsai's method.
  • In Section 2, we described how the FOBP occurred in both Wu and Tsai’s method and Chang and Tseng’s method. This study proposes a new method resolving the FOBP and which therefore improves on the method of Chang and Tseng. The data embedding and extracting processes are included in this paper.
  • However, pixels in the edge areas were subject to the FOBP, and hence could not be used to embed secret data, even though they were more capable of holding secret data bits than those in smooth areas. In this paper, we proposed a new method that could both solve the FOBP and provided a good quality index value that was imperceptible to the human visual system. Moreover, there was no need to reference the cover image when extracting the embedded data from the stego-image.
  • Moreover, there was no need to reference the cover image when extracting the embedded data from the stego-image. Our experimental results have shown that the proposed scheme provides an improved way to hide secret data.

이론/모형

  • The cover data is embedded in raster-scan order except for the pixels of the first row and the first column, as treated in Chang and Tseng’s method.
  • As with the embedding process, the data is extracted in raster-scan order like as Chang and Tseng’s method.
  • The data embedding and extracting processes are included in this paper. Because the FOBP occurs in both methods, the proposed method can also be applied to the method of Wu and Tsai.
  • Because the FOBP arises in both, as mentioned already, the proposed method is compared with Wu and Tsai’s pixel-value differencing method and Chang and Tseng’s two-sided side match scheme.
본문요약 정보가 도움이 되었나요?

참고문헌 (10)

  1. Neil F. Johnson, Sushil Jajodia, Exploring Steganography : Seeing the Unseen, Computer Practices, 26-34, 1998 

  2. J. Zollner, H. Federrath, H. Klimant, A. Pfitzmann, R. Piotraschke, A. Westfeld, G. Wicke, G. Wolf, Modeling the security of steganographic systems, 2nd Workshop on Information Hiding, 345-355, 1998 

  3. W. Bender, N. Morimoto, A. Lu, Techniques for data hiding, IBM Systems Journal, 35(3/4), 313-336, 1996 

  4. D. C. Wu, W. H. Tsai, A steganographic method for images by pixel-differencing, Pattern Recognition Letters 24(9-10), 1613-1626, 2003 

  5. C. C. Chang, H. W. Tseng, A steganographic method for digital images using side-match, Pattern Recognition Letters 25(12), 1431-1437, 2004 

  6. R. C. Gonzalez, R. E. Woods, Digital Image Processing, Prentice Hall, Upper Saddle River, NJ, 2002 

  7. R. J. Anderson, F. A. P. Petitcolas, On the limits of steganography, IEEE Journal on Selected Areas in Communications 16, 474-481, 1998 

  8. F. A. P. Petitcolas, R. J. Anderson, M. G. Kuhn, Information hiding - a survey, Proceedings of the IEEE, special issue on protection of multimedia content, 87(7), 1062-1078, 1999 

  9. K. H. Jung, J. G. Yu, S. M. Kim, K. J. Kim, J. Y. Byun, K. Y. Yoo, The hiding of secret data using the run length matching method, LNCS, 1027-1034, 2007 

  10. Z. Wang, A. C. Bovik, A universal image quality index, IEEE Signal Processing Letters 9, 81-84, 2002 

관련 콘텐츠

오픈액세스(OA) 유형

GOLD

오픈액세스 학술지에 출판된 논문

저작권 관리 안내
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로