Feature extraction for margin lines using region growing with a dynamic weight function in a one-point bidirectional path search

Author:

Shin Hyoung-Sub1,Li Zhi1,Kim Jay J1

Affiliation:

1. Department of Mechanical Convergence Engineering, Hanyang University , Seoul, Republic of Korea

Abstract

Abstract A margin line, defined as the boundary curve of the contact area between a prepared tooth and a dental restoration, considerably influences the end shape of the dental restoration design. Most studies that have extracted margin lines from mesh models representing prepared teeth have faced convergence problems in the path search and therefore pose the inconvenience of specifying multiple input points as intermediate goal points. To overcome these problems, in this study, we propose a bidirectional path-search algorithm using a single input point. First, the algorithm classifies all nodes in a mesh model into a margin or fuzzy region to increase search efficiency. Then, the search starts from one point and proceeds on two paths in opposite directions, using the current node of the opposite path as the temporary goal of the currently searched path. During the search, a dynamic evaluation function that varies weights according to the region type is employed to improve the path convergence. Finally, to increase the practicality of the algorithm, the jagged initial margin line is converted into a smooth spline curve using an energy-minimization function specialized for margin lines. To evaluate the proposed algorithm, margin lines extracted from various types of prepared teeth are demonstrated and compared with those created using some relevant previous works and a commercial dental computer-aided design (CAD) system. The comparison verified that accurate margin lines could be calculated with only one input point using the proposed algorithm. Moreover, the proposed algorithm showed better performance for crown and inlay/only experimental models compared with a commercial dental CAD system under the same conditions.

Funder

National Research Foundation of Korea

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Engineering (miscellaneous),Modeling and Simulation,Computational Mechanics

Reference33 articles.

1. Seeded region growing;Adams;IEEE Transactions on Pattern Analysis and Machine Intelligence,1994

2. Admissible heuristic search in and/or graphs;Bagchi;Theoretical Computer Science,1983

3. Mesh repairing using topology graphs;Charton;Journal of Computational Design and Engineering,2021

4. Dynamic weighted anytime bounded cost search algorithm;Che,2021

5. Necessary and sufficient conditions for avoiding reopenings in best first suboptimal search with general bounding functions;Chen;Proceedings of the AAAI Conference on Artificial Intelligence,2021

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3