The search functionality is under construction.

Author Search Result

[Author] Yoshimitsu KUROKI(4hit)

1-4hit
  • A Linear Manifold Color Descriptor for Medicine Package Recognition

    Kenjiro SUGIMOTO  Koji INOUE  Yoshimitsu KUROKI  Sei-ichiro KAMATA  

     
    PAPER-Image Processing

      Vol:
    E95-D No:5
      Page(s):
    1264-1271

    This paper presents a color-based method for medicine package recognition, called a linear manifold color descriptor (LMCD). It describes a color distribution (a set of color pixels) of a color package image as a linear manifold (an affine subspace) in the color space, and recognizes an anonymous package by linear manifold matching. Mainly due to low dimensionality of color spaces, LMCD can provide more compact description and faster computation than description styles based on histogram and dominant-color. This paper also proposes distance-based dissimilarities for linear manifold matching. Specially designed for color distribution matching, the proposed dissimilarities are theoretically appropriate more than J-divergence and canonical angles. Experiments on medicine package recognition validates that LMCD outperforms competitors including MPEG-7 color descriptors in terms of description size, computational cost and recognition rate.

  • A CUDA Implementation of DWT for JPEG 2000 Codec

    Masayuki KUROSAKI  Masateru MATSUO  Yoshimitsu KUROKI  Yuhei NAGAO  Baiko SAI  Hiroshi OCHI  

     
    LETTER-Image Processing

      Vol:
    E94-A No:11
      Page(s):
    2358-2360

    In this paper, we propose a CUDA implementation of DWT for JPEG 2000 codec. We show that the performance of JPEG 2000 codec implemented by CUDA is better than CPU based implementation. The performance of the DWT implemented by CUDA is achieved 27.7 frame/second in 4K digital cinema.

  • A Fast Implementation of PCA-L1 Using Gram-Schmidt Orthogonalization

    Mariko HIROKAWA  Yoshimitsu KUROKI  

     
    LETTER-Face Perception and Recognition

      Vol:
    E96-D No:3
      Page(s):
    559-561

    PCA-L1 (principal component analysis based on L1-norm maximization) is an approximate solution of L1-PCA (PCA based on the L1-norm), and has robustness against outliers compared with traditional PCA. However, the more dimensions the feature space has, the more calculation time PCA-L1 consumes. This paper focuses on an initialization procedure of PCA-L1 algorithm, and proposes a fast method of PCA-L1 using Gram-Schmidt orthogonalization. Experimental results on face recognition show that the proposed method works faster than conventional PCA-L1 without decrease of recognition accuracy.

  • An Inter-Prediction Method Using Sparse Representation for High Efficiency Video Coding

    Koji INOUE  Kohei ISECHI  Hironobu SAITO  Yoshimitsu KUROKI  

     
    LETTER-Image Processing

      Vol:
    E96-A No:11
      Page(s):
    2191-2193

    This paper proposes an inter-prediction method for the upcoming video coding standard named HEVC (High Efficiency Video Coding). The HEVC offers an inter-prediction framework called local intensity compensation which represents a current block by a linear combination of some reference blocks. The proposed method calculates weight coefficients of the linear combination by using sparse representation. Experimental results show that the proposed method increases prediction accuracy in comparison with other methods.