달력

42025  이전 다음

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
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 may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem (FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

Ubiquitous Multimedia Computing, International Symposium on 13-15 Oct. 2008 Page(s). 210 - 213
Posted by kingjung
|
ICHIT, International Conference on Convergence and Hybrid Information Technology, 2008 pp.262-265
Posted by kingjung
|

A novel data hiding method based on the least significant bit (LSB) substitution and the multi-pixel differencing (MPD) method is presented on the proposed method to improve the capacity of hidden secret data and to provide an imperceptible visual quality. First, a sum of different values for a four-pixel sub-block is calculated. The low value of the sum can be located on a smooth block and the high value is located on an edged block. The secret data are hidden into the cover image by the LSB method in the smooth block, while the MPD method is concealed in the edged block. The experimental results show that the proposed method has a higher capacity and maintains good visual quality.

ICHIT, International Conference on Convergence and Hybrid Information Technology, 2008, pp.355-358

Posted by kingjung
|
This study proposes a new method for data hiding in binary images using optimized bit position to replace a secret bit. This method manipulates blocks, which are sub-divided. The parity bit for a specified block decides whether to change or not, to embed a secret bit. By finding the best position to insert a secret bit for each divided block, the image quality of the resulting stego-image can be improved, while maintaining low computational complexity. The experimental results show that the proposed method has an improvement with respect to a previous work.

Computer Science and Software Engineering, Volume 3, 12-14 Dec. 2008 pp. 931-934
Posted by kingjung
|
Computer Science and Software Engineering, Volume 3, 12-14 Dec. 2008 pp. 876-879
Posted by kingjung
|
This study proposes a data hiding method based on run length encoding. This proposed method uses the location of accumulated run length values, where the cover data run length are compared with the secret data run length. The run length matching (RLM) method uses the run length table which is constructed from the cover and secret data. The experimental results demonstrated that the RLM has advantages with respect to different types of data and run length encoding value match.

Agent and Multi-Agent Systems : Techonologies & Applications, Vol. 4496, 1027-1034, 2007
Posted by kingjung
|