检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yuta Yamauchi Tatsuya Yatagawa Yutaka Ohtake Hiromasa Suzuki
机构地区:[1]School of Engineering,The University of Tokyo,7–3–1,Hongo,Bunkyo-ku,Tokyo,Japan
出 处:《Computational Visual Media》2023年第2期319-333,共15页计算可视媒体(英文版)
摘 要:X-ray CT scanners,due to the transmissive nature of X-rays,have enabled the non-destructive evaluation of industrial products,even inside their bodies.In light of its effectiveness,this study introduces a new approach to accelerate the inspection of many mechanical parts with the same shape in a bin.The input to this problem is a volumetric image(i.e.,CT volume)of many parts obtained by a single CT scan.We need to segment the parts in the volume to inspect each of them;however,random postures and dense contacts of the parts prohibit part segmentation using traditional template matching.To address this problem,we convert both the scanned volumetric images of the template and the binned parts to simpler graph structures and solve a subgraph matching problem to segment the parts.We perform a distance transform to convert the CT volume into a distance field.Then,we construct a graph based on Morse theory,in which graph nodes are located at the extremum points of the distance field.The experimental evaluation demonstrates that our fully automatic approach can detect target parts appropriately,even for a heap of 50 parts.Moreover,the overall computation can be performed in approximately 30 min for a large CT volume of approximately 2000×2000×1000 voxels.
关 键 词:X-ray computed tomography(CT) volume segmentation graph matching non-destructive inspection
分 类 号:R739.41[医药卫生—肿瘤] R445.2[医药卫生—临床医学] TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49