A Segmentation Method of 3D Teeth Mesh Data Based on Harmonic Field Algorithm

A technology of grid data and teeth, applied in the field of segmentation of three-dimensional tooth grid data, can solve the problem of high learning cost, and achieve the effects of simple interaction, high interaction labor intensity, and strong practicability

Active Publication Date: 2020-04-28
LARGEV INSTR CORP LTD
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, this kind of interaction requires users to have high knowledge of dental anatomy and computer proficiency, and the learning cost is relatively high.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Segmentation Method of 3D Teeth Mesh Data Based on Harmonic Field Algorithm
  • A Segmentation Method of 3D Teeth Mesh Data Based on Harmonic Field Algorithm
  • A Segmentation Method of 3D Teeth Mesh Data Based on Harmonic Field Algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] The present invention will be described in detail below in conjunction with the accompanying drawings and embodiments.

[0028] Such as figure 1 As shown, the process of the present invention mainly includes the determination of the concave surface information of each tooth foreground constraint point FS, background constraint point BS, and three-dimensional tooth grid data vertices to be divided in the three-dimensional tooth grid data; The harmonic field scalar value constructs the Laplacian matrix L of the three-dimensional tooth mesh data, the penalty factor matrix P, the coefficient matrix b, and the unknown coefficient matrix x; the unknown coefficient matrix x is obtained by solving, and each tooth to be segmented is obtained by threshold division The segmented boundary contour of , using cubic B-splines to smooth the boundary contour.

[0029] 1. The foreground constraint point FS and the background constraint point BS of each tooth to be segmented in the three...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for segmenting three-dimensional tooth grid data based on a harmonic field algorithm. The method comprises steps of introducing three-dimensional tooth grid data, sequentially picking two points for each tooth to be segmented in the three-dimensional tooth grid data, and determining the foreground constraint point and the background constraint point of each toothto be segmented; determining whether the vertex in the three-dimensional tooth mesh data is located in the concave surface, and further determining the concave surface information of the vertex; calculating the Gaussian curvature value of the vertex in the three-dimensional tooth grid data; calculating a harmonic field scalar value based on the harmonic field algorithm; calculating an unknown coefficient matrix x; and obtaining the segmentation boundary contour of each tooth to be segmented by the boundary contour threshold division and smoothing the segmentation boundary contour, and finallycompleting segmentation of the three-dimensional tooth grid data. The method solves the phenomenon that the segmentation error is caused by the inconspicuous tooth boundary, can better segment the teeth in the case of teeth missing and high crowding degree, and has high robustness.

Description

technical field [0001] The invention relates to a method for segmenting three-dimensional tooth grid data based on a harmonic field algorithm, and relates to the technical field of three-dimensional grid segmentation. Background technique [0002] Along with the development of economic life, people have great pursuit to the attractive in appearance of tooth. However, about 20%-30% of people in our country have irregular teeth, and people's demand for orthodontics will become higher and higher. Traditional orthodontic solutions, such as steel braces, not only bring inconvenience to patients' diet, but also affect the appearance of patients during treatment. In recent years, 3D printed invisible braces have emerged as the times require, bringing great benefits to patients. In the clinical orthodontic process of medical teeth, accurate tooth segmentation is an extremely crucial step. However, the determination of tooth boundaries in tooth segmentation is not a simple task, b...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06T7/11G06T7/136G06T7/194G06T5/00
CPCG06T5/002G06T7/11G06T7/136G06T7/194G06T2207/30036
Inventor 刘创左飞飞王亚杰吴宏新张文宇杨书
Owner LARGEV INSTR CORP LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products