Sepsirisuk, Kasemsuk

Loading...
Thumbnail Image
Preferred name
Sepsirisuk, Kasemsuk
Main Affiliation
Email
kasemsuk.se@kmitl.ac.th

Settings

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A new correlation-based watermarking method using wavelet tree and mathematical morphology
    (2009-01-01)
    Sepsirisuk, Kasemsuk
    ;
    Hamamoto, Kazuhiko
    ;
    Atsuta, Kiyoaki
    ;
    Kondo, Shozo
    This paper proposes a new correlation-based watermarking method using the wavelet tree and the mathematical morphology. In this method a watermark is a two-dimensional pseudorandom array of {-1, 1} with the same size as a host image to be watermarked. The watermark is embedded into a Resilient Tree Structure (RTS) which is created by applying the mathematical morphology, the dilation operation, to the wavelet tree. The dilation operation improves the reliability of the proposed method by increasing the number of coefficients involved in watermarking. Furthermore an improved perceptual weighting function of the Human Visual System is used for preserving the image quality. In a watermark detection process the linear correlation between the watermark and the coefficients of the RTS of a tested image is computed to judge the presence of the watermark. The experimental results show that the proposed method outperforms current correlation-based watermarking methods. © 2009 The Institute of Electrical Engineers of Japan.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Accelerating ray-casting for semitransparent image using Bi-directional skipped distance transforms
    (2002-01-01)
    Sepsirisuk, Kasemsuk
    ;
    Ungpinitpong, Phittaya
    ;
    Lertprasert, Polsart
    ;
    Sangworasil, Manas
    This paper shows a method for speeding up the ray-traversal process of volume viewing. The algorithm acceleration is achieved by skipping empty regions defined for each background voxel of the volume in pre-processing step. Background voxels are labeled by a value, which is equal to the voxel distance to the nearest foreground voxel. The algorithm starts by backward traverse of the volume to find an existing point of the foreground and follows by forward traverse of the volume from an entry point of volume until it meets the existing point. This method enables a faster Tay-traversal time than traditional distance transforms.