The search functionality is under construction.

Author Search Result

[Author] Shoji HIRANO(2hit)

1-2hit
  • A New Sulcus Extraction Algorithm Using MAGNET Principle

    Shoji HIRANO  Naotake KAMIURA  Yutaka HATA  

     
    PAPER-Image Processing,Computer Graphics and Pattern Recognition

      Vol:
    E81-D No:11
      Page(s):
    1253-1260

    This paper presents a feature extraction model MAGNET' to find the deepest point of branched sulcus. Our model demonstrates magnetic principle and consists of four types of ideal magnetic poles: an N-pole and three S-poles. According to attractive or repulsive Coulomb forces between their poles, one of the S-poles is pushed to the deepest point of the sulcus. First, we explain our model on the simple sulcus model. Second, we apply it to the sulcus with implicit branches. Our model can detect the target points in every branch. Then an example to realize the model on a synthetic image is introduced. We apply our model to human brain MR images and human foot CT images. Experimental results on human brain MR images show that our method enable us to successfully detect the points.

  • A Rough Set Based Clustering Method by Knowledge Combination

    Tomohiro OKUZAKI  Shoji HIRANO  Syoji KOBASHI  Yutaka HATA  Yutaka TAKAHASHI  

     
    PAPER-Databases

      Vol:
    E85-D No:12
      Page(s):
    1898-1908

    This paper presents a rough sets-based method for clustering nominal and numerical data. This clustering result is independent of a sequence of handling object because this method lies its basis on a concept of classification of objects. This method defines knowledge as sets that contain similar or dissimilar objects to every object. A number of knowledge are defined for a data set. Combining similar knowledge yields a new set of knowledge as a clustering result. Cluster validity selects the best result from various sets of combined knowledge. In experiments, this method was applied to nominal databases and numerical databases. The results showed that this method could produce good clustering results for both types of data. Moreover, ambiguity of a boundary of clusters is defined using roughness of the clustering result.