A good tooth cusp extraction is helpful in evaluating the effect of cosmetic dental work in virtual tooth surgery. We propose a new tooth cusp extraction, which integrates the DBSCAN (density-based spatial clustering of applications with noise) clustering algorithm with the neighborhood search algorithm to extract tooth cusp from a three-dimensional cloud-point tooth model. This method used the point cloud height and curvature to screen out the dented point set. Then we employ the DBSCAN clustering algorithm to segment different feature regions of the tooth surface and generate the candidate point set. Finally, the candidate point set was accurately located at the tooth apex through the neighborhood search algorithm and the traversal search method of non-maximum suppression. The experimental results show that the proposed method is superior to the traditional watershed algorithm-based methods by calculating the recall rate and accuracy rate, and also has higher extraction speed and extraction precision than manual extraction methods.

Download full-text PDF

Source
http://dx.doi.org/10.1615/CritRevBiomedEng.2023050386DOI Listing

Publication Analysis

Top Keywords

neighborhood search
12
search algorithm
12
tooth cusp
12
point set
12
cusp extraction
8
clustering algorithm
8
candidate point
8
tooth
7
extraction
6
algorithm
5

Similar Publications

Basic Science and Pathogenesis.

Alzheimers Dement

December 2024

Institute of Computational Biology, Helmholtz Zentrum München, German Research Center for Environmental Health, Neuherberg, Bavaria, Germany, Department of Psychiatry and Behavioral Sciences, Duke University, Durham, NC, USA.

Background: Despite recent breakthroughs, Alzheimer's disease (AD) remains untreatable. In addition, we are still lacking robust biomarkers for early diagnosis and promising novel targets for therapeutic intervention. To enable utilizing the entirety of molecular evidence in the discovery and prioritization of potential novel biomarkers and targets, we have developed the AD Atlas, a network-based multi-omics data integration platform.

View Article and Find Full Text PDF

In practical supply chain operations, efficient order allocation significantly enhances the overall efficiency of the supply chain. Real production environments are plagued by numerous uncertainties, such as unpredictable customer orders, which greatly amplify the complexity of solving practical allocation problems. This study focuses on the problem of allocating orders to parallel machines with varying efficiencies under uncertain and high-dimensional conditions.

View Article and Find Full Text PDF

Background: Adverse birth outcomes are unfavorable outcomes of pregnancy that are particularly common in low- and middle-income countries. At least one ultrasound is recommended to predict adverse birth outcomes in early pregnancy. However, in low-income countries, imaging equipment and trained manpower are scarce.

View Article and Find Full Text PDF

Feature selection (FS) is a significant dimensionality reduction technique, which can effectively remove redundant features. Metaheuristic algorithms have been widely employed in FS, and have obtained satisfactory performance, among them, grey wolf optimizer (GWO) has received widespread attention. However, the GWO and its variants suffer from limited adaptability, poor diversity, and low accuracy when faced with high-dimensional data.

View Article and Find Full Text PDF

A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies.

Biomimetics (Basel)

November 2024

National Astronomical Observatories, Chinese Academy of Sciences, Beijing 100012, China.

With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!