Tae-Su Kim

Kyungpook National University, Daikyū, Daegu, South Korea

Are you Tae-Su Kim?

Claim your profile

Publications (11)0 Total impact

  • Tae-Su Kim, Seung-Jin Kim, Kuhn-Il Lee
    [Show abstract] [Hide abstract]
    ABSTRACT: A new method of content-based image retrieval is presented that uses the color co-occurrence matrix that is adaptive to the classification characteristics of the image blocks. In the proposed method, the color feature vectors are extracted according to the characteristics of the block classification after dividing the image into blocks with a fixed size. The divided blocks are then classified as either luminance or color blocks depending on the average saturation of the block in the HSI (hue, saturation, and intensity) domain. Thereafter, the color feature vectors are extracted by calculating the co-occurrence matrix of a block average intensity for the luminance blocks and the co-occurrence matrix of a block average hue and saturation for the color blocks. In addition, block directional pattern feature vectors are extracted by calculating histograms after directional gradient classification of the intensity. Experimental results show that the proposed method can outperform conventional methods as regards a precision and a feature vector dimension.
    Advances in Multimedia Information Processing - PCM 2005, 6th Pacific-Rim Conference on Multimedia, Jeju Island, Korea, November 13-16, 2005, Proceedings, Part I; 01/2005
  • Tae-Su Kim, Seung-Jin Kim, Kuhn-Il Lee
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a new content-based image retrieval method using the color and pattern histogram that is adaptive to the block classification characteristics. In the proposed method, the color and pattern feature vectors are extracted according to the characteristics of the block classification after dividing an image into the blocks with a fixed size. Specifically, the adaptive representative color histograms are calculated according to the statistical characteristics of the classified block and the directional pattern histograms are extracted by performing the directional pattern classification. Experimental results show that the proposed method can outperform the conventional methods as regards the precision.
    Computer Analysis of Images and Patterns, 11th International Conference, CAIP 2005, Versailles, France, September 5-8, 2005, Proceedings; 01/2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the increment of digital media, multimedia technology and copyright protection have been the important issue. In this paper, an effective watermarking algorithm is proposed to protect copyright of video data. In the watermark embedding step, a three-dimensional discrete wavelet transform (3D DWT) is used to decompose original video data, because a pirate can easily extract the watermark by statistically comparing successive frames in case that the watermark is embedded in spatial doamin. The binary image is used as the watermark. It is changed into the video watermark by a two-dimensional (2D) pseudorandom permutation and the spread spectrum technique. The video watermark is embedded into the 3D DWT coefficients of the selected subbands. In the watermark extracting step, the embedded video watermark is detected by the similarity of the unit of subband and the final watermark image is extracted by a watermark decision rule and a reverse permutation. Experimental results show that the watermarked frames are subjectively indistinguishable from the original frames, plus the proposed video watermarking algorithm is sufficiently robust against various attacks.
    Advances in Multimedia Information Processing - PCM 2005, 6th Pacific-Rim Conference on Multimedia, Jeju Island, Korea, November 13-16, 2005, Proceedings, Part II; 01/2005
  • Proceedings of The 2005 International Conference on Imaging Science, Systems, and Technology: Computer Graphics, CISST 2005, Las Vegas, Nevada, USA, June 27-30, 2005; 01/2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: The current paper proposes 3D mesh watermarking using projection onto convex sets. As such, a 3D mesh is iteratively projected onto two constraint convex sets until the convergence condition is satisfied. The sets consist of a robustness set and invisibility set designed to embed the watermark. The watermark can be extracted without the original mesh using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh is both robust to mesh simplification, cropping, affine transformations, and vertex randomization and invisible.
    Image Processing, 2004. ICIP '04. 2004 International Conference on; 11/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: An effective video watermarking algorithm is proposed to protect the copyright. Two perceptual binary images are used as the watermark and the watermarking procedure is based on a three-dimensional discrete wavelet transform (3-D DWT) and two spread spectrum sequences. Two perceptual watermarks are preprocessed using mixing and pseudorandom permutation. After dividing the video sequence into video shots, the 3-D DWT is performed, then the preprocessed watermarks are embedded into the 3-D DWT coefficients, while considering robustness and invisibility, using two spread spectrum sequences defined as the user key. Experimental results show that the watermarked frames are subjectively indistinguishable from the original frames, plus the proposed video watermarking algorithm is sufficiently robust against such attacks as low pass filtering, frame dropping, frame average, and MPEG coding.
    Digital Watermarking, Third InternationalWorkshop, IWDW 2004, Seoul, SouthKorea, October 30 - November 1, 2004, Revised Selected Papers; 01/2004
  • Proceedings of the International Conference on Imaging Science, Systems and Technology, CISST '04, June 21-24, 2004, Las Vegas, Nevada, USA; 01/2004
  • Proceedings of the International Conference on Imaging Science, Systems and Technology, CISST '04, June 21-24, 2004, Las Vegas, Nevada, USA; 01/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we proposed a watermarking for 3D polygonal meshes using normal vector distribution of each patch. The distribution of norm vector for 3D polygonal mesh is a consistent factor to be robust against various attacks such as affine transform and mesh connectivity altering. Therefore, the proposed algorithm embedded watermark into these consistent normal vectors and equal watermark bit was embedded into each patch of subdivided mesh to have robustness against the partial geometric deformation. Experiment results exhibited the proposed algorithm is robust by extracting watermark bit for various attacked models.
    Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on; 10/2003
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We proposed 3D polygonal meshes watermarking using normal vector distribution to robust against various attacks. The norm vector distribution of mesh is a consistent factor that is robust against various attacks. After calculating these distributions of 6 patches respectively, the same watermark bits are embedded into the same ordered bins in the distributions of 6 patches. The experiment shows that the watermark is imperceptible and robust against various attacks.
    Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on; 08/2003
  • 01/2003