IP Library Granted Patent US 12,579,656
Granted Patent B2
US 12,579,656 · App. 17/671,406 · Granted Mar 17, 2026

Machine learning dental segmentation system and methods using graph-based approaches

Inventors: Christopher E. Cramer (Durham, NC); Pavel Agniashvili (Moscow, RU); Chad Clayton Brown (Cary, NC)
Assignee: Align Technology, Inc.
G06T7/162A61C13/34G06N3/08G06T7/11G06T17/205G06V10/774G06V10/82G06T2207/20081G06T2207/20084G06T2207/30036G06V2201/03
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,579,656
App. No.
17/671,406
Granted
Mar 17, 2026
Kind
B2
Abstract

Provided herein are systems and methods for automatically segmenting a 3D model of a patient's teeth. A patient's dentition may be scanned. The scan data may be converted into a 3D model, including a graph-based representation of the 3D model. The graph-based representation can be input into a machine learning model to train the machine learning model to segment the 3D model into individual dental components. Trained machine learning models can also be used to segment graph-based representations of a 3D model of a patient's teeth.

Claims (43)

1 . A method of training a machine learning model to segment a 3D dental model, the method comprising:

receiving, in a computing device, a three-dimensional (3D) mesh of a patient's dentition;

extracting mesh features from the 3D mesh, wherein the mesh features include face adjacency matrices describing adjacent and non-adjacent faces with respect to the 3D mesh;

creating a graph-based representation of the 3D mesh with the extracted mesh features wherein the face adjacency matrices of the extracted mesh features are edges of the graph-based representation; and

applying the mesh features and/or the graph-based representation to train a machine learning model of the computing device to recognize graph-based segmentation elements corresponding to segmentation of the patient's dentition.

2 . The method of claim 1 , wherein the mesh features further include mesh faces of the 3D mesh.

3 . The method of claim 1 , wherein creating the graph-based representation further comprises using mesh faces as nodes of the graph-based representation.

4 . The method of claim 3 , further comprising storing the graph-based representation in a memory of the computing device.

5 . The method of claim 1 , wherein the mesh features can be one or more of a face center position, a face normal vector, a local curvature, and a face area.

6 . The method of claim 1 , further comprising segmenting the graph-based representation into individual dental components with the machine learning model.

7 . The method of claim 1 , wherein the 3D mesh comprises a scan of the patient's dentition.

8 . The method of claim 1 , further comprising repeating the receiving, extracting, creating, and applying steps for a plurality of 3D meshes of patients' dentitions.

9 . The method of claim 1 , wherein the machine learning model is trained to construct a semantic segmentation network in which multiple objects of the same class are treated as a single entity.

10 . The method of claim 1 , wherein the machine learning model is trained to construct an instance segmentation network in which multiple objects of the same class are treated as distinct individual objects or instances.

11 . A method of training a machine learning model to segment a 3D dental model, the method comprising:

receiving, in a computing device, a three-dimensional (3D) mesh of a patient's dentition;

creating, in the computing device, a graph-based representation of the 3 D mesh that represents the patient's dentition;

receiving, in the computing device, a ground truth input comprising a manual segmentation of the 3D mesh, wherein the ground truth input identifies individual teeth, gingiva, and interproximal spaces; and

training a machine learning model of the computing device to produce a segmentation output that attempts to achieve the ground truth input.

12 . The method of claim 11 , further comprising segmenting the graph-based representation into individual dental components with the trained machine learning model.

13 . The method of claim 11 , further comprising identifying interproximal spaces between teeth with the trained machine learning model.

14 . The method of claim 11 , further comprising identifying individual teeth with the trained machine learning model.

15 . The method of claim 11 , further comprising repeating the receiving, creating, receiving, and training steps for a plurality of 3D meshes of patients' dentitions.

16 . The method of claim 11 , wherein training the machine learning model comprises adjusting weights of the machine learning model to minimize an error between the ground truth input and the segmentation output.

17 . A method of segmenting a 3D dental model, the method comprising:

receiving, in a computing device, a three-dimensional (3D) mesh of a patient's dentition;

creating a graph-based representation of the 3D mesh;

applying the graph-based representation to a trained machine learning model of the computing device to recognize segmentation elements corresponding to segmentation of the patient's dentition, wherein the graph-based representation includes mesh features with face adjacency matrices describing adjacent and non-adjacent faces with respect to the 3D mesh as edges of the graph-based representation; and

outputting a segmented 3D model of the patient's dentition.

18 . A method of training a machine learning model to segment a 3D dental model, the method comprising:

receiving, in a computing device, a three-dimensional (3D) mesh of a patient's dentition;

extracting mesh features from the 3D mesh, wherein the mesh features include face adjacency matrices describing adjacent and non-adjacent faces with respect to the 3D mesh;

coarsening the 3D mesh to reduce a size of the mesh;

creating a graph-based representation of the coarsened 3D mesh with the extracted mesh features using face adjacency matrices as edges of the graph-based representation; and

applying the mesh features and/or the graph-based representation to train a machine learning model of the computing device to recognize graph-based segmentation elements corresponding to segmentation of the patient's dentition.

19 . The method of claim 18 , wherein coarsening the 3D mesh comprises:

computing a cosine similarity of the mesh features;

eliminating mesh features with a cosine similarity below a first threshold; and

applying pooling to remaining mesh features.

20 . The method of claim 19 , wherein the pooling comprises Graclus pooling.

21 . The method of claim 19 , wherein the pooling is repeated until a number of remaining nodes in the 3D mesh is less than or equal to a second threshold.

22 . The method of claim 19 , wherein the first threshold comprises 0.995.

23 . The method of claim 21 , wherein the second threshold comprises 200,000.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 11, 2022
From: CRAMER, CHRISTOPHER E.; AGNIASHVILI, PAVEL; BROWN, CHAD CLAYTON
To: ALIGN TECHNOLOGY, INC.
Reel/Frame 059239/0252 →
Continuity (2)
Provisional Application 63149194 · Feb 12, 2021
Related Publication 20220262007A1 · Aug 18, 2022
References Cited (156)
US 5975893A · Chishti et al. · 1999 [cited by applicant]
US 6227850B1 · Chishti et al. · 2001 [cited by applicant]
US 6227851B1 · Chishti et al. · 2001 [cited by applicant]
US 6299440B1 · Phan et al. · 2001 [cited by applicant]
US 6318994B1 · Chishti et al. · 2001 [cited by applicant]
US 6371761B1 · Cheang et al. · 2002 [cited by applicant]
US 6386878B1 · Pavlovskaia et al. · 2002 [cited by applicant]
US 6406292B1 · Chishti et al. · 2002 [cited by applicant]
US 6409504B1 · Jones et al. · 2002 [cited by applicant]
US 6457972B1 · Chishti et al. · 2002 [cited by applicant]
US 6488499B1 · Miller · 2002 [cited by applicant]
US 6514074B1 · Chishti et al. · 2003 [cited by applicant]
US 6554611B2 · Chishti et al. · 2003 [cited by applicant]
US 6582229B1 · Miller et al. · 2003 [cited by applicant]
US 6602070B2 · Miller et al. · 2003 [cited by applicant]
US 6621491B1 · Baumrind et al. · 2003 [cited by applicant]
US 6688886B2 · Hughes et al. · 2004 [cited by applicant]
US 6726478B1 · Isiderio et al. · 2004 [cited by applicant]
US 6729876B2 · Chishti et al. · 2004 [cited by applicant]
US 6739869B1 · Taub et al. · 2004 [cited by applicant]
US 6767208B2 · Kaza · 2004 [cited by applicant]
US 6783360B2 · Chishti · 2004 [cited by applicant]
US 7040896B2 · Pavlovskaia et al. · 2006 [cited by applicant]
US 7063532B1 · Jones et al. · 2006 [cited by applicant]
US 7074038B1 · Miller · 2006 [cited by applicant]
US 7074039B2 · Kopelman et al. · 2006 [cited by applicant]
US 7077647B2 · Choi et al. · 2006 [cited by applicant]
US 7108508B2 · Hedge et al. · 2006 [cited by applicant]
US 7134874B2 · Chishti et al. · 2006 [cited by applicant]
US 7156661B2 · Choi et al. · 2007 [cited by applicant]
US 7160107B2 · Kopelman et al. · 2007 [cited by applicant]
US 7241142B2 · Abolfathi et al. · 2007 [cited by applicant]
US 7293988B2 · Wen · 2007 [cited by applicant]
US 7309230B2 · Wen · 2007 [cited by applicant]
US 7357634B2 · Knopp · 2008 [cited by applicant]
US 7555403B2 · Kopelman et al. · 2009 [cited by applicant]
US 7637740B2 · Knopp · 2009 [cited by applicant]
US 7689398B2 · Cheng et al. · 2010 [cited by applicant]
US 7736147B2 · Kaza et al. · 2010 [cited by applicant]
US 7746339B2 · Matov et al. · 2010 [cited by applicant]
US 7844356B2 · Matov et al. · 2010 [cited by applicant]
US 7844429B2 · Matov et al. · 2010 [cited by applicant]
US 7865259B2 · Kuo et al. · 2011 [cited by applicant]
US 7878804B2 · Korytov et al. · 2011 [cited by applicant]
US 7880751B2 · Kuo et al. · 2011 [cited by applicant]
US 7904308B2 · Arnone et al. · 2011 [cited by applicant]
US 7930189B2 · Kuo · 2011 [cited by applicant]
US 7942672B2 · Kuo · 2011 [cited by applicant]
US 7970627B2 · Kuo et al. · 2011 [cited by applicant]
US 7970628B2 · Kuo et al. · 2011 [cited by applicant]
US 8038444B2 · Kitching et al. · 2011 [cited by applicant]
US 8044954B2 · Kitching et al. · 2011 [cited by applicant]
US 8075306B2 · Kitching et al. · 2011 [cited by applicant]
US 8092215B2 · Stone-Collonge et al. · 2012 [cited by applicant]
US 8099268B2 · Kitching et al. · 2012 [cited by applicant]
US 8108189B2 · Chelnokov et al. · 2012 [cited by applicant]
US 8126726B2 · Matov et al. · 2012 [cited by applicant]
US 8260591B2 · Kass et al. · 2012 [cited by applicant]
US 8275180B2 · Kuo · 2012 [cited by applicant]
US 8401826B2 · Cheng et al. · 2013 [cited by applicant]
US 8439672B2 · Matov et al. · 2013 [cited by applicant]
US 8562338B2 · Kitching et al. · 2013 [cited by applicant]
US 8591225B2 · Wu et al. · 2013 [cited by applicant]
US 8788285B2 · Kuo · 2014 [cited by applicant]
US 8843381B2 · Kuo et al. · 2014 [cited by applicant]
US 8874452B2 · Kuo · 2014 [cited by applicant]
US 8896592B2 · Boltunov et al. · 2014 [cited by applicant]
US 8930219B2 · Trosien et al. · 2015 [cited by applicant]
US 9037439B2 · Kuo et al. · 2015 [cited by applicant]
US 9060829B2 · Sterental et al. · 2015 [cited by applicant]
US 9125709B2 · Matty · 2015 [cited by applicant]
US 9211166B2 · Kuo et al. · 2015 [cited by applicant]
US 9220580B2 · Borovinskih et al. · 2015 [cited by applicant]
US 9364296B2 · Kuo · 2016 [cited by applicant]
US 9375300B2 · Matov et al. · 2016 [cited by applicant]
US 9414897B2 · Wu et al. · 2016 [cited by applicant]
US 9492245B2 · Sherwood et al. · 2016 [cited by applicant]
US 9642678B2 · Kuo · 2017 [cited by applicant]
US 10248883B2 · Borovinskih et al. · 2019 [cited by applicant]
US 10342638B2 · Kitching et al. · 2019 [cited by applicant]
US 10463452B2 · Matov et al. · 2019 [cited by applicant]
US 10595966B2 · Carrier, Jr. et al. · 2020 [cited by applicant]
US 10617489B2 · Grove et al. · 2020 [cited by applicant]
US 10722328B2 · Velazquez et al. · 2020 [cited by applicant]
US 10758322B2 · Pokotilov et al. · 2020 [cited by applicant]
US 10779718B2 · Meyer et al. · 2020 [cited by applicant]
US 10792127B2 · Kopelman et al. · 2020 [cited by applicant]
US 10828130B2 · Pokotilov et al. · 2020 [cited by applicant]
US 10835349B2 · Cramer et al. · 2020 [cited by applicant]
US 10973611B2 · Pokotilov et al. · 2021 [cited by applicant]
US 10996813B2 · Makarenkova et al. · 2021 [cited by applicant]
US 10997727B2 · Xue et al. · 2021 [cited by applicant]
US 11020205B2 · Li et al. · 2021 [cited by applicant]
US 11020206B2 · Shi et al. · 2021 [cited by applicant]
US 11026766B2 · Chekh et al. · 2021 [cited by applicant]
US 11033359B2 · Velazquez et al. · 2021 [cited by applicant]
US 11071608B2 · Derakhshan et al. · 2021 [cited by applicant]
US 11096763B2 · Akopov et al. · 2021 [cited by applicant]
US 11116605B2 · Nyukhtikov et al. · 2021 [cited by applicant]
US 11147652B2 · Mason et al. · 2021 [cited by applicant]
US 11151753B2 · Gao et al. · 2021 [cited by applicant]
US 11154381B2 · Roschin et al. · 2021 [cited by applicant]
US 11259896B2 · Matov et al. · 2022 [cited by applicant]
US 20030008259A1 · Kuo et al. · 2003 [cited by applicant]
US 20030143509A1 · Kopelman et al. · 2003 [cited by applicant]
US 20030207227A1 · Abolfathi · 2003 [cited by applicant]
US 20040137400A1 · Chishti et al. · 2004 [cited by applicant]
US 20040152036A1 · Abolfathi · 2004 [cited by applicant]
US 20040197728A1 · Abolfathi et al. · 2004 [cited by applicant]
US 20040259049A1 · Kopelman et al. · 2004 [cited by applicant]
US 20050182654A1 · Abolfathi et al. · 2005 [cited by applicant]
US 20050244791A1 · Davis et al. · 2005 [cited by applicant]
US 20060127836A1 · Wen · 2006 [cited by applicant]
US 20060127852A1 · Wen · 2006 [cited by applicant]
US 20060127854A1 · Wen · 2006 [cited by applicant]
US 20060275731A1 · Wen et al. · 2006 [cited by applicant]
US 20060275736A1 · Wen et al. · 2006 [cited by applicant]
US 20080306724A1 · Kitching et al. · 2008 [cited by applicant]
US 20100009308A1 · Wen et al. · 2010 [cited by applicant]
US 20100068672A1 · Arjomand et al. · 2010 [cited by applicant]
US 20100068676A1 · Mason et al. · 2010 [cited by applicant]
US 20100092907A1 · Knopp · 2010 [cited by applicant]
US 20100167243A1 · Spiridonov et al. · 2010 [cited by applicant]
US 20130204599A1 · Matov et al. · 2013 [cited by applicant]
US 20150039613A1 · Li · 2015 [cited by examiner]
US 20160310235A1 · Derakhshan et al. · 2016 [cited by applicant]
US 20170083770A1 · Carlson · 2017 [cited by examiner]
US 20170169562A1 · Somasundaram · 2017 [cited by examiner]
US 20170273760A1 · John et al. · 2017 [cited by applicant]
US 20180280118A1 · Cramer · 2018 [cited by applicant]
US 20190008446A1 · Cunliffe · 2019 [cited by examiner]
US 20190029784A1 · Moalem et al. · 2019 [cited by applicant]
US 20190053876A1 · Sterental et al. · 2019 [cited by applicant]
US 20190192259A1 · Kopelman et al. · 2019 [cited by applicant]
US 20190328487A1 · Levin et al. · 2019 [cited by applicant]
US 20190328488A1 · Levin et al. · 2019 [cited by applicant]
US 20190333622A1 · Levin et al. · 2019 [cited by applicant]
US 20200000552A1 · Mednikov et al. · 2020 [cited by applicant]
US 20200000554A1 · Makarenkova et al. · 2020 [cited by applicant]
US 20200000555A1 · Yuryev et al. · 2020 [cited by applicant]
US 20200085546A1 · Li et al. · 2020 [cited by applicant]
US 20200107915A1 · Roschin et al. · 2020 [cited by applicant]
US 20200155274A1 · Pimenov et al. · 2020 [cited by applicant]
US 20200214800A1 · Matov et al. · 2020 [cited by applicant]
US 20200297458A1 · Roschin et al. · 2020 [cited by applicant]
US 20200306011A1 · Chekhonin et al. · 2020 [cited by applicant]
US 20200306012A1 · Roschin et al. · 2020 [cited by applicant]
US 20200315744A1 · Cramer · 2020 [cited by applicant]
US 20200360109A1 · Gao et al. · 2020 [cited by applicant]
US 20210073998A1 · Brown et al. · 2021 [cited by applicant]
US 20210134436A1 · Meyer et al. · 2021 [cited by applicant]
US 20210174477A1 · Shi et al. · 2021 [cited by applicant]
US 20210322136A1 · Anssari Moin · 2021 [cited by examiner]
US 20220067943A1 · Claessen · 2022 [cited by examiner]
US 20220215531A1 · Azernikov · 2022 [cited by examiner]
US 20220262007A1 · Cramer · 2022 [cited by examiner]