• DocumentCode
    1796575
  • Title

    A data structure for triangular dissection of multi-resolution images

  • Author

    Kikuchi, Takashi ; Anada, Koichi ; Koka, Shinji ; Miyadera, Youzou ; Yaku, Takeo

  • Author_Institution
    Dept. of Inf. Sci., Nihon Univ. Tokyo, Tokyo, Japan
  • fYear
    2014
  • fDate
    June 30 2014-July 2 2014
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    In this work, the heterogeneous rectangular dissections that represent multi-resolution images of raster data are considered. Specifically, heterogeneous rectangular dissections are changed to triangular dissections in order to provide more effective feature extraction. We propose a method of generating triangular dissections that maintains “octgrid” properties and have developed a list structure suitable for extracting image features (ridges, valleys, etc.) from terrain maps. We propose a detailed list structure called “H12Code” and present examples of feature extraction using H12Code lists.
  • Keywords
    data structures; feature extraction; image resolution; H12Code lists; data structure; image feature extraction; multiresolution images; octgrid properties; rectangular dissections; triangular dissections; Data mining; Data structures; Educational institutions; Feature extraction; Image recognition; Information science; Mathematics; data structures; feature extraction; multi-resolution images; triangulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2014 15th IEEE/ACIS International Conference on
  • Conference_Location
    Las Vegas, NV
  • Type

    conf

  • DOI
    10.1109/SNPD.2014.6888732
  • Filename
    6888732