Author Search Result

[Author] Masahiro ISHIKAWA(3hit)

1-3hit
  • An Efficient Wavelet-Based ROI Coding for Multiple Regions

    Kazuma SHINODA  Naoki KOBAYASHI  Ayako KATOH  Hideki KOMAGATA  Masahiro ISHIKAWA  Yuri MURAKAMI  Masahiro YAMAGUCHI  Tokiya ABE  Akinori HASHIGUCHI  Michiie SAKAMOTO  

     
    PAPER-Image

      Vol:
    E98-A No:4
      Page(s):
    1006-1020

    Region of interest (ROI) coding is a useful function for many applications. JPEG2000 supports ROI coding and can decode ROIs preferentially regardless of the shape and number of the regions. However, if the number of regions is quite large, the ROI coding performance of JPEG2000 declines because the code-stream includes many useless non-ROI codes. This paper proposes a wavelet-based ROI coding method suited for multiple ROIs. The proposed wavelet transform does not access any non-ROIs when transforming the ROIs. Additionally, the proposed method eliminates the need for unnecessary coding of the bits in the higher bit planes of non-ROI regions by adding an ROI map to the code-stream. The experimental results show that the proposed method achieves a higher peak signal-to-noise ratio than the ROI coding of JPEG2000. The proposed method can be applied to both max-shift and scaling-based ROI coding.

  • Minimal Spanning Tree Construction with MetricMatrix

    Masahiro ISHIKAWA  Kazutaka FURUSE  Hanxiong CHEN  Nobuo OHBO  

     
    PAPER-Databases

      Vol:
    E85-D No:2
      Page(s):
    362-372

    Clustering is one of the most important topics in the field of knowledge discovery from databases. Especially, hierarchical clustering is useful since it gives a hierarchical view of a whole database and can be used to guide users in browsing a huge database. In many cases, clustering can be modeled as a graph partitioning problem. When an appropriate distance function between database objects is given, a database can be viewed as an edge-weighted complete graph, where vertices are database objects and weights of edges are distances between them. Then a process of MST (Minimal Spanning Tree) construction can be viewed as a process of a single-linkage agglomerative clustering process for database objects. In this paper, we propose an efficient MST construction method for a large complete metric graph, which is derived from a database with a metric distance function defined on it. Our method utilizes a metric index to reduce the number of distance calculations. The basic idea is to exclude those edges less probable to be a part of an MST by using the metric postulate. For this purpose, we introduce a new metric index named MetricMatrix. Experimental results show that our method can drastically reduce the number of distance calculations needed for MST construction in comparison with the classical method.

  • Calculation of Thermal Stress Inside Skin Tissue Produced by Laser Acupuncture

    Masahiro ISHIKAWA  Osamu FUJIWARA  Kazuo KATOH  Takashi AZAKAMI  

     
    LETTER-Instrumentation and Electronic Circuits

      Vol:
    E71-E No:4
      Page(s):
    369-371

    For the effectively therapeutic conditions of laser acupuncture, as a first step, this letter examines the thermal stress inside the skin tissue produced by laser acupuncture. A method is presented of calculating the 3-dimensional thermal stress. The numerical results are also shown.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.