Taiyou Kikuchi, S. Koka, Koichi Anada, Y. Miyadera, T. Yaku
{"title":"一种多分辨率图像三角形解剖的数据结构","authors":"Taiyou Kikuchi, S. Koka, Koichi Anada, Y. Miyadera, T. Yaku","doi":"10.1109/SNPD.2014.6888732","DOIUrl":null,"url":null,"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.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A data structure for triangular dissection of multi-resolution images\",\"authors\":\"Taiyou Kikuchi, S. Koka, Koichi Anada, Y. Miyadera, T. Yaku\",\"doi\":\"10.1109/SNPD.2014.6888732\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":272932,\"journal\":{\"name\":\"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2014.6888732\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2014.6888732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A data structure for triangular dissection of multi-resolution images
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.