Dongqing Chen, Bin Li, Zhengrong Liang, M. Wan, A. Kaufman, M. Wax
{"title":"虚拟内窥镜的树杈搜索多分辨率骨架化方法","authors":"Dongqing Chen, Bin Li, Zhengrong Liang, M. Wan, A. Kaufman, M. Wax","doi":"10.1117/12.387735","DOIUrl":null,"url":null,"abstract":"One of the most important tasks for virtual endoscopy is path planning for viewing the lumen of hollow organs. For geometry complex objects, for example the lungs, it remains an unsolved problem. While alternative visualization modes have been proposed, for example, cutting and flattening the hollow wall, a skeleton of the lumen is still necessary as a reference for the cutting. A general-purpose skeletonization algorithm often generates redundant skeletons because of the local shape variation. In this study, a multistage skeletonization method for tree-like volumes, such as airway system, blood vessels, and colon, was presented. By appropriately defining the distance between voxels, the distance to the root from each voxel in the volume can be effectively determined with means of region growing techniques. The end points of all branches and the shortest path from each end point to the root can be extracted based on this distance map. A post-processing algorithm is applied to the shortest paths to remove redundant ones and to centralize the remained ones. The skeleton generated is one-voxel wide, along which every branch of the 'tree' can be viewed. For effectively processing volume of large size, a modified multiresolution analysis was also developed to scale down the binary segmented volume. Tests on airway, vessel, and colon dataset were promising.","PeriodicalId":417187,"journal":{"name":"Storage and Retrieval for Image and Video Databases","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Tree-branch-searching multiresolution approach to skeletonization for virtual endoscopy\",\"authors\":\"Dongqing Chen, Bin Li, Zhengrong Liang, M. Wan, A. Kaufman, M. Wax\",\"doi\":\"10.1117/12.387735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most important tasks for virtual endoscopy is path planning for viewing the lumen of hollow organs. For geometry complex objects, for example the lungs, it remains an unsolved problem. While alternative visualization modes have been proposed, for example, cutting and flattening the hollow wall, a skeleton of the lumen is still necessary as a reference for the cutting. A general-purpose skeletonization algorithm often generates redundant skeletons because of the local shape variation. In this study, a multistage skeletonization method for tree-like volumes, such as airway system, blood vessels, and colon, was presented. By appropriately defining the distance between voxels, the distance to the root from each voxel in the volume can be effectively determined with means of region growing techniques. The end points of all branches and the shortest path from each end point to the root can be extracted based on this distance map. A post-processing algorithm is applied to the shortest paths to remove redundant ones and to centralize the remained ones. The skeleton generated is one-voxel wide, along which every branch of the 'tree' can be viewed. For effectively processing volume of large size, a modified multiresolution analysis was also developed to scale down the binary segmented volume. Tests on airway, vessel, and colon dataset were promising.\",\"PeriodicalId\":417187,\"journal\":{\"name\":\"Storage and Retrieval for Image and Video Databases\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Storage and Retrieval for Image and Video Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.387735\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Storage and Retrieval for Image and Video Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.387735","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tree-branch-searching multiresolution approach to skeletonization for virtual endoscopy
One of the most important tasks for virtual endoscopy is path planning for viewing the lumen of hollow organs. For geometry complex objects, for example the lungs, it remains an unsolved problem. While alternative visualization modes have been proposed, for example, cutting and flattening the hollow wall, a skeleton of the lumen is still necessary as a reference for the cutting. A general-purpose skeletonization algorithm often generates redundant skeletons because of the local shape variation. In this study, a multistage skeletonization method for tree-like volumes, such as airway system, blood vessels, and colon, was presented. By appropriately defining the distance between voxels, the distance to the root from each voxel in the volume can be effectively determined with means of region growing techniques. The end points of all branches and the shortest path from each end point to the root can be extracted based on this distance map. A post-processing algorithm is applied to the shortest paths to remove redundant ones and to centralize the remained ones. The skeleton generated is one-voxel wide, along which every branch of the 'tree' can be viewed. For effectively processing volume of large size, a modified multiresolution analysis was also developed to scale down the binary segmented volume. Tests on airway, vessel, and colon dataset were promising.