期刊
COMPOSITES PART B-ENGINEERING
卷 162, 期 -, 页码 323-330出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.compositesb.2018.10.062
关键词
Branch point; Honeycomb; Vertex identification; Harris
资金
- National Natural Science Foundation of China [51875581, 51505502]
- China Postdoctoral Science Foundation [2017M620358, 2018T110707]
- Innovation-Driven Project of Central South University [2018CX022]
Recently, more and more attentions have been paid to structural defect suppression. In this study, branch point algorithm was first constructed for structural irregularity determination of honeycomb structure, so as to identify the geometric defect of similar cellular structures. Detailed principle and process were presented with key steps as image binarization, smoothing & noise suppression, skeletonization, vertex identification and cell reconstruction. A representative illustration was given. Afterwards, the routine difference has been discussed between the present method and classic Harris algorithm. Some examples in different cases were presented. As the findings turned out that, the branch point algorithm efficiently identifies the vertices of each cell with high precision, even in cases of poor images with low resolution. All these achievements pave a way for high standard honeycomb structure in consistency, reliability and homogeneity.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据