• 전체
  • 전자/전기
  • 통신
  • 컴퓨터
닫기

사이트맵

Loading..

Please wait....

영문 논문지

홈 홈 > 연구문헌 > 영문 논문지 > TIIS (한국인터넷정보학회)

TIIS (한국인터넷정보학회)

Current Result Document : 4 / 5

한글제목(Korean Title) Data Hiding Using Sequential Hamming + k with m Overlapped Pixels
영문제목(English Title) Data Hiding Using Sequential Hamming + k with m Overlapped Pixels
저자(Author) Cheonshik Kim   Dongkyoo Shin   Ching-Nung Yang   Yi-Cheng Chen   Song-Yu Wu  
원문수록처(Citation) VOL 13 NO. 12 PP. 6159 ~ 6174 (2019. 12)
한글내용
(Korean Abstract)
영문내용
(English Abstract)
Recently, Kim et al. introduced the Hamming 𝑘𝑘 with 𝑚𝑚 overlapped pixels data hiding (Hk_ mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (𝑛𝑛, 𝑛𝑛− 𝑘𝑘) and HC (𝑛𝑛, 𝑛𝑛− 𝑘𝑘) 1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function 𝐶𝐶𝐶𝐶𝐶𝐶(1, 𝑛𝑛=2𝑘𝑘−1, 𝑘𝑘) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.
키워드(Keyword) Data Hiding   Matrix Encoding   Hamming DH (HDH)   Hamming+1 DH (H1DH)   Hk_mDH  
파일첨부 PDF 다운로드