IP Library Granted Patent US 12,254,628
Granted Patent B2
US 12,254,628 · App. 18/641,941 · Granted Mar 18, 2025

Systems and methods for review of computer-aided detection of pathology in images

Inventors: Harris Bergman (Marietta, GA); Mark Blomquist (Tucson, AZ); Michael Wimmer (Prescott, AZ)
Assignee: BENEVIS INFORMATICS, LLC
G06T7/0012A61B6/51A61B6/5217A61B8/5223A61B5/055A61B6/032A61B6/037G06T2207/10116G06T2207/20081G06T2207/20084G06T2207/30036
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,254,628
App. No.
18/641,941
Granted
Mar 18, 2025
Kind
B2
Abstract

Disclosed and described herein are systems and methods of performing computer-aided detection (CAD)/diagnosis (CADx) in medical images and comparing the results of the comparison. Such detection can be used for treatment plans and verification of claims produced by healthcare providers, for the purpose of identifying discrepancies between the two. In particular, embodiments disclosed herein are applied to identifying dental caries (“caries”) in radiographs and comparing them against progress notes, treatment plans, and insurance claims.

Claims (76)

1. A system for performing computer-aided detection (CAD) using an image of one or more teeth, comprising:

a computer comprising one or more processors and a memory, wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer causing the computer to:

receive the image of the one or more teeth;

segment each of the one or more teeth that comprise the image to determine boundaries between each of the one or more teeth, wherein each tooth of the one or more teeth comprises a separate segmented image;

number each tooth in the separate segmented images using a tooth-type classifier model, wherein the teeth are numbered according to a standardized numbering system,

wherein numbering each tooth in the separate segmented images comprises:

performing a fuzzy-logic process for the numbering each tooth in the separate segmented images comprising:

identifying a likelihood that each of the separate segmented images contains any of several types of teeth including primary molars, secondary molars, primary canines, secondary canines, secondary premolars, primary incisors, secondary incisors, gaps between teeth, exfoliating teeth, and cropped teeth, wherein the probabilities of tooth types for the teeth are arranged in a tooth probability list of length number of teeth multiplied by a number of tooth types,

and wherein the tooth probability list is element-wise multiplied against each row of a matrix to produce a sequence score and tooth numbering is determined by the row with the highest score.

2. The system of claim 1 , wherein the standardized numbering system comprises a Universal Numbering System, wherein each tooth is assigned a number from 1-32 (adult teeth) or letter from A-T (deciduous teeth).

3. The system of claim 1 , wherein the image comprises an x-ray image of the one or more teeth, an image from a magnetic resonance imaging (MRI) system of the one or more teeth, an image from a computed tomography (CT) system of the one or more teeth, an image from an ultrasound system of the one or more teeth, an image from a positron emission tomography (PET) system of the one or more teeth, or an image from a single-photon emission computed tomography (SPECT) machine of the one or more teeth.

4. The system of claim 1 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to:

perform computer-aided detection (CAD) on each of the separate segmented images using a classifier model for restoration detection, wherein the restoration detection identifies teeth with restorations that may produce false negative results from a caries classifier model.

5. The system of claim 4 , wherein the classifier model classifies overall image features, said classifier model comprising an image classifier that is trained to identify images that include orthodontia or images that are of poor quality.

6. The system of claim 5 , wherein the classifier model comprises a convolutional neural network (CNN).

7. The system of claim 4 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to:

exclude separate segmented images with restorations that may produce false negative results from the caries classifier model; and

determine whether a tooth in a non-excluded separate segmented image has a caries, or not, using the caries classifier model, wherein the caries classifier is trained to determine whether a tooth has caries.

8. The system of claim 7 , wherein the caries classifier model comprises a convolutional neural network (CNN).

9. The system of claim 8 , wherein the caries classifier model comprises a region-based convolutional neural network (R-CNN).

10. The system of claim 1 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to execute a caries classifier model, said caries classifier model comprising a region-based convolutional neural network (R-CNN), and wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further cause the computer to perform caries detection of the image by the caries classifier model returning a list or an image of rectangular regions of the image with caries.

11. The system of claim 1 , wherein the one or more processors further execute computer-executable instructions to:

segment each of the one or more teeth that comprise the image to separate segmented images by separating upper teeth from lower teeth in the image by identifying an occlusal plane, wherein the occlusal plane is identified by rotating the image several degrees in clockwise and counterclockwise directions, where at each increment a projection of intensity for each image row is summed and the occlusal plane is identified by a valley in the profiles of this projection (“occlusal valley”);

examine each column in the rotated image, identify a maximum depth of the occlusal valley in that column, and create an occlusal curve, wherein the occlusal curve is a smoothed curve of the maximum valley depth locations spanned along the rows of the image;

identify boundaries between each tooth or partial tooth that comprises the image, wherein the boundaries are determined independently for an upper and lower set of teeth as determined by the occlusal plane, and wherein the boundaries between each tooth are determined by taking a column-wise projection of intensities between the occlusal curve and an edge of the image, wherein spaces between the teeth are indicated by the valleys in the projections; and

use K-means to determine an average position of column numbers in the image that correspond to the interproximal space between teeth.

12. The system of claim 11 , wherein the one or more processors further execute computer-executable instructions to:

starting at a row on the occlusal curve that roughly separates a tooth from one next to it, move a rectangular window towards the edge of the image, wherein a tooth segmentation line is chosen to be at a column of this window for which the average intensity in the window is the minimum;

filter out false tooth segmentation curves in the column-wise projections by comparing image intensity along the curve to those of curves translated to the left and right of the segmentation curve, wherein segmentation curves that run through the pulp of a tooth will have more similar intensities to each other, compared to a segmentation curve that runs between the teeth;

determine a distance between intensities, wherein curves for which the intensities are too close to each other are rejected; and

output separate segmented images, one for each segmented region.

13. The system of claim 1 , wherein the processor further executes computer-executable instructions to place the number assigned to each of the one or more teeth by the tooth-type classifier model in each tooth's separate segmented image.

14. The system of claim 1 , wherein the processor further executes computer-executable instructions to place the number assigned to each of the one or more teeth by the tooth-type classifier model in the image of the one or more teeth.

15. A method for performing computer-aided detection (CAD) using an image of one or more teeth, said method comprising:

segmenting and numbering each of the one or more teeth of the image using a computer comprising one or more processors and a memory, wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer causing the computer to:

segment each of the one or more teeth that comprise the image to determine boundaries between each of the one or more teeth, wherein each tooth of the one or more teeth comprises a separate segmented image; and

number each tooth in the separate segmented images using a tooth-type classifier model, wherein the teeth are numbered according to a standardized numbering system,

wherein numbering each tooth in the separate segmented images comprises:

performing a fuzzy-logic process for the numbering of each tooth in the separate segmented images comprising:

identifying a probability that each of the separate segmented images contains any of a plurality of tooth types including primary molars, secondary molars, primary canines, secondary canines, secondary premolars, primary incisors, secondary incisors, gaps between teeth, exfoliating teeth, and cropped teeth, wherein the probabilities of tooth types for the teeth are arranged in a tooth probability list of length number of teeth multiplied by a number of the tooth types,

and wherein the tooth probability list is element-wise multiplied against each row of a matrix to produce a sequence score and tooth numbering is determined by the row with a highest score.

16. The method of claim 15 , wherein the standardized numbering system comprises a Universal Numbering System, wherein each tooth is assigned a number from 1-32 (adult teeth) or letter from A-T (deciduous teeth).

17. The method of claim 15 , wherein the image comprises an x-ray image of the one or more teeth, an image from a magnetic resonance imaging (MRI) system of the one or more teeth, an image from a computed tomography (CT) system of the one or more teeth, an image from an ultrasound system of the one or more teeth, an image from a positron emission tomography (PET) system of the one or more teeth, or an image from a single-photon emission computed tomography (SPECT) machine of the one or more teeth.

18. The method of claim 15 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to:

perform computer-aided detection (CAD) on each of the separate segmented images using a classifier model for restoration detection, wherein the restoration detection identifies teeth with restorations that may produce false negative results from a caries classifier model.

19. The method of claim 18 , wherein the classifier model classifies overall image features, said classifier model comprising an image classifier that is trained to identify images that include orthodontia or images that are of poor quality.

20. The method of claim 19 , wherein the classifier model comprises a convolutional neural network (CNN).

21. The method of claim 18 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to:

exclude separate segmented images with restorations that may produce false negative results from the caries classifier model; and

determine whether a tooth in a non-excluded separate segmented image has a caries, or not, using the caries classifier model, wherein the caries classifier is trained to determine whether a tooth has caries.

22. The method of claim 21 , wherein the caries classifier model comprises a convolutional neural network (CNN).

23. The method of claim 22 , wherein the caries classifier model comprises a region-based convolutional neural network (R-CNN).

24. The method of claim 15 , wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to execute a caries classifier model, said caries classifier model comprising a region-based convolutional neural network (R-CNN), and wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer further causing the computer to perform caries detection of the image by the caries classifier model returning a list or an image of rectangular regions of the image with caries.

25. The method of claim 15 , wherein the one or more processors further execute computer-executable instructions to:

segment each of the one or more teeth that comprise the image to separate segmented images by separating upper teeth from lower teeth in the image by identifying an occlusal plane, wherein the occlusal plane is identified by rotating the image several degrees in clockwise and counterclockwise directions, where at each increment a projection of intensity for each image row is summed and the occlusal plane is identified by a valley in the profiles of this projection (“occlusal valley”);

examine each column in the rotated image, identify a maximum depth of the occlusal valley in that column, and create an occlusal curve, wherein the occlusal curve is a smoothed curve of the maximum valley depth locations spanned along the rows of the image;

identify boundaries between each tooth or partial tooth that comprises the image, wherein the boundaries are determined independently for an upper and lower set of teeth as determined by the occlusal plane, and wherein the boundaries between each tooth are determined by taking a column-wise projection of intensities between the occlusal curve and an edge of the image, wherein spaces between the teeth are indicated by the valleys in the projections; and

use K-means to determine an average position of column numbers in the image that correspond to the interproximal space between teeth.

26. The method of claim 25 , wherein the one or more processors further execute computer-executable instructions to:

starting at a row on the occlusal curve that roughly separates a tooth from one next to it, move a rectangular window towards the edge of the image, wherein a tooth segmentation line is chosen to be at a column of this window for which the average intensity in the window is the minimum;

filter out false tooth segmentation curves in the column-wise projections by comparing image intensity along the curve to those of curves translated to the left and right of the segmentation curve, wherein segmentation curves that run through the pulp of a tooth will have more similar intensities to each other, compared to a segmentation curve that runs between the teeth;

determine a distance between intensities, wherein curves for which the intensities are too close to each other are rejected; and

output separate segmented images, one for each segmented region.

27. The method of claim 15 , wherein the processor further executes computer-executable instructions to place the number assigned to each of the one or more teeth by the tooth-type classifier model in each tooth's separate segmented image.

28. The method of claim 15 , wherein the processor further executes computer-executable instructions to place the number assigned to each of the one or more teeth by the tooth-type classifier model in the image of the one or more teeth.

29. A system for performing computer-aided detection (CAD) using an image of one or more teeth, comprising:

a computer comprising one or more processors and a memory, wherein the one or more processors of the computer execute computer-executable instructions stored in the memory of the computer causing the computer to:

segment each of the one or more teeth that comprise the image to form a separate segmented image for each tooth of the one or more teeth that comprise the image; and

number each tooth of the separate segmented images using a tooth-type classifier model, wherein the teeth are numbered according to a standardized numbering system,

wherein numbering each tooth of the separate segmented images comprises the tooth-type classifier identifying a probability that each of the separate segmented images contains any of a plurality of tooth types, wherein the probabilities of tooth types for the teeth are arranged in a list of length number of teeth multiplied by a number of the plurality of tooth types to form a tooth probability list,

and wherein the tooth probability list is element-wise multiplied against each row of a matrix to produce a sequence score and tooth numbering is determined by the row with a highest score.

30. A method for performing computer-aided detection (CAD) using an image of one or more teeth, said method comprising:

segmenting each of the one or more teeth that comprise the image to form a separate segmented image for each tooth of the one or more teeth that comprise the image; and

number each tooth in each of the separate segmented images using a tooth-type classifier model, wherein the teeth are numbered according to a standardized numbering system,

wherein numbering each tooth of the separate segmented images comprises the tooth-type classifier identifying a probability that each of the separate segmented images contains any of a plurality of tooth types, wherein the probabilities of tooth types for the teeth are arranged in a list of length number of teeth multiplied by a number of the plurality of tooth types to form a tooth probability list,

and wherein the tooth probability list is element-wise multiplied against each row of a matrix to produce a sequence score and tooth numbering is determined by the row with a highest score.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2024
From: BERGMAN, HARRIS; BLOMQUIST, MARK; WIMMER, MICHAEL
To: BENEVIS INFORMATICS, LLC
Reel/Frame 068043/0174 →
Continuity (4)
Continuation 18510197 · Nov 15, 2023
Continuation 17055411
Provisional Application 62672266 · May 16, 2018
Related Publication 20240303814A1 · Sep 12, 2024
References Cited (235)
US 5594638A · Illiff · 1997 [cited by applicant]
US 5660176A · Illiff · 1997 [cited by applicant]
US 5711297A · Iliff · 1998 [cited by applicant]
US 5724968A · Iliff · 1998 [cited by applicant]
US 5742700A · Yoon et al. · 1998 [cited by applicant]
US 5868669A · Iliff · 1999 [cited by applicant]
US 5915036A · Grunkin · 1999 [cited by applicant]
US 6058322A · Nishikawa et al. · 2000 [cited by applicant]
US 6113540A · Illiff · 2000 [cited by applicant]
US 6125194A · Yeh et al. · 2000 [cited by applicant]
US 6195474B1 · Snyder et al. · 2001 [cited by applicant]
US 6201880B1 · Elbaum et al. · 2001 [cited by applicant]
US 6206829B1 · Illiff · 2001 [cited by applicant]
US 6283761B1 · Joao · 2001 [cited by applicant]
US 6292596B1 · Snyder et al. · 2001 [cited by applicant]
US 6482156B2 · Iliff · 2002 [cited by applicant]
US 6654728B1 · Li et al. · 2003 [cited by applicant]
US 6760468B1 · Yeh et al. · 2004 [cited by applicant]
US 6879712B2 · Tuncay et al. · 2005 [cited by applicant]
US 6925198B2 · Scharlack et al. · 2005 [cited by applicant]
US 7010153B2 · Zimmermann · 2006 [cited by applicant]
US 7215803B2 · Marshall · 2007 [cited by applicant]
US 7245753B2 · Squilla et al. · 2007 [cited by applicant]
US 7283654B2 · McLain · 2007 [cited by applicant]
US 7292716B2 · Kim · 2007 [cited by applicant]
US 7297111B2 · Iliff · 2007 [cited by applicant]
US 7300402B2 · Iliff · 2007 [cited by applicant]
US 7306560B2 · Illiff · 2007 [cited by applicant]
US 7308126B2 · Rogers et al. · 2007 [cited by applicant]
US 7324680B2 · Zimmermann · 2008 [cited by applicant]
US 7362890B2 · Scharlack et al. · 2008 [cited by applicant]
US 7433505B2 · Yoo et al. · 2008 [cited by applicant]
US 7457443B2 · Persky · 2008 [cited by applicant]
US 7463757B2 · Luo et al. · 2008 [cited by applicant]
US 7464040B2 · Joao · 2008 [cited by applicant]
US 7471821B2 · Rubbert et al. · 2008 [cited by applicant]
US 7490048B2 · Joao · 2009 [cited by applicant]
US 7499588B2 · Jacobs et al. · 2009 [cited by applicant]
US 7532942B2 · Reiner et al. · 2009 [cited by applicant]
US 7551760B2 · Scharlack et al. · 2009 [cited by applicant]
US 7577284B2 · Wong et al. · 2009 [cited by applicant]
US 7603000B2 · Zheng et al. · 2009 [cited by applicant]
US 7620228B2 · Yoo et al. · 2009 [cited by applicant]
US 7623693B2 · Holzner et al. · 2009 [cited by applicant]
US 7648460B2 · Simopoulos et al. · 2010 [cited by applicant]
US 7702139B2 · Liang et al. · 2010 [cited by applicant]
US 7751606B2 · Luo et al. · 2010 [cited by applicant]
US 7756326B2 · Howerton, Jr. · 2010 [cited by applicant]
US 7783094B2 · Collins et al. · 2010 [cited by applicant]
US 7835558B2 · Gagnon et al. · 2010 [cited by applicant]
US 7840042B2 · Kriveshko et al. · 2010 [cited by applicant]
US 7844091B2 · Wong et al. · 2010 [cited by applicant]
US 7844092B2 · Crucs · 2010 [cited by applicant]
US 7853476B2 · Reiner et al. · 2010 [cited by applicant]
US 7860289B2 · Yoo et al. · 2010 [cited by applicant]
US 7865261B2 · Pfeiffer · 2011 [cited by applicant]
US 7912257B2 · Paley et al. · 2011 [cited by applicant]
US 7916900B2 · Lanier · 2011 [cited by applicant]
US 7936911B2 · Fang et al. · 2011 [cited by applicant]
US 7940260B2 · Kriveshko · 2011 [cited by applicant]
US 7957573B2 · Ikeda · 2011 [cited by applicant]
US 8014576B2 · Collins et al. · 2011 [cited by applicant]
US 8015138B2 · Illiff · 2011 [cited by applicant]
US 8035637B2 · Kriveshko · 2011 [cited by applicant]
US 8036438B2 · Komiya · 2011 [cited by applicant]
US 8045772B2 · Kosuge et al. · 2011 [cited by applicant]
US 8077949B2 · Liang et al. · 2011 [cited by applicant]
US 8087932B2 · Liu et al. · 2012 [cited by applicant]
US 8099268B2 · Kitching et al. · 2012 [cited by applicant]
US 8117549B2 · Reiner · 2012 [cited by applicant]
US 8144954B2 · Quadling et al. · 2012 [cited by applicant]
US 8145340B2 · Taub et al. · 2012 [cited by applicant]
US RE43433E · Iliff · 2012 [cited by applicant]
US 8199988B2 · Marshall et al. · 2012 [cited by applicant]
US 8208704B2 · Wong et al. · 2012 [cited by applicant]
US RE43548E · Iliff · 2012 [cited by applicant]
US 8224045B2 · Burns et al. · 2012 [cited by applicant]
US 8270689B2 · Liang et al. · 2012 [cited by applicant]
US 8275180B2 · Kuo · 2012 [cited by applicant]
US 8303301B2 · Bergersen · 2012 [cited by applicant]
US 8320634B2 · Deutsch · 2012 [cited by applicant]
US 8335694B2 · Reiner · 2012 [cited by applicant]
US 8341100B2 · Miller et al. · 2012 [cited by applicant]
US 8385617B2 · Okawa et al. · 2013 [cited by applicant]
US 8391574B2 · Collins et al. · 2013 [cited by applicant]
US 8411917B2 · Gandyra · 2013 [cited by applicant]
US 8416984B2 · Liang et al. · 2013 [cited by applicant]
US 8417010B1 · Colby · 2013 [cited by applicant]
US 8433033B2 · Harata et al. · 2013 [cited by applicant]
US 8442283B2 · Choi · 2013 [cited by applicant]
US 8442927B2 · Chakradhar et al. · 2013 [cited by applicant]
US 8447078B2 · Maschke · 2013 [cited by applicant]
US 8447087B2 · Wong et al. · 2013 [cited by applicant]
US 8494241B2 · Kadobayashi et al. · 2013 [cited by applicant]
US 8520925B2 · Duret · 2013 [cited by applicant]
US 8532355B2 · Quadling et al. · 2013 [cited by applicant]
US 8556625B2 · Lovely · 2013 [cited by applicant]
US 8571281B2 · Wong et al. · 2013 [cited by applicant]
US 8577493B2 · Taub et al. · 2013 [cited by applicant]
US 8605973B2 · Wang et al. · 2013 [cited by applicant]
US 8605974B2 · Liang et al. · 2013 [cited by applicant]
US 8634631B2 · Kanerva et al. · 2014 [cited by applicant]
US 8737706B2 · Graham et al. · 2014 [cited by applicant]
US 8768025B2 · Wong et al. · 2014 [cited by applicant]
US 8768036B2 · Caligor et al. · 2014 [cited by applicant]
US 8848991B2 · Tjioe et al. · 2014 [cited by applicant]
US 8867800B2 · Bullis et al. · 2014 [cited by applicant]
US 8897526B2 · MacLeod et al. · 2014 [cited by applicant]
US 8913814B2 · Gandyra · 2014 [cited by applicant]
US 8914097B2 · Burlina et al. · 2014 [cited by applicant]
US 8977020B2 · Goto · 2015 [cited by applicant]
US 8977023B2 · Buckland · 2015 [cited by applicant]
US 8977025B2 · Baumgart · 2015 [cited by applicant]
US 8977049B2 · Aila et al. · 2015 [cited by applicant]
US 8979773B2 · Hirabayashi · 2015 [cited by applicant]
US 8983029B2 · Hasegawa · 2015 [cited by applicant]
US 8983162B2 · Ye et al. · 2015 [cited by applicant]
US 8983165B2 · Sun et al. · 2015 [cited by applicant]
US 8989347B2 · Sperl et al. · 2015 [cited by applicant]
US 8989461B2 · Zhu et al. · 2015 [cited by applicant]
US 8989473B2 · Nambu · 2015 [cited by applicant]
US 8989474B2 · Kido et al. · 2015 [cited by applicant]
US 8989487B2 · Choe et al. · 2015 [cited by applicant]
US 8989514B2 · Russakoff et al. · 2015 [cited by applicant]
US 8994747B2 · Heron · 2015 [cited by applicant]
US 8996428B2 · Baras et al. · 2015 [cited by applicant]
US 9001967B2 · Baturin et al. · 2015 [cited by applicant]
US 9001972B2 · Takahashi et al. · 2015 [cited by applicant]
US 9002084B2 · Shahar et al. · 2015 [cited by applicant]
US 9005119B2 · Iliff · 2015 [cited by applicant]
US 9014423B2 · Wang et al. · 2015 [cited by applicant]
US 9014440B2 · Arumugam et al. · 2015 [cited by applicant]
US 9014442B2 · Kelly et al. · 2015 [cited by applicant]
US 9014447B2 · Slabaugh et al. · 2015 [cited by applicant]
US 9014454B2 · Zankowski · 2015 [cited by applicant]
US 9014455B2 · Oh et al. · 2015 [cited by applicant]
US 9019301B2 · Matsue et al. · 2015 [cited by applicant]
US 9020220B2 · Nukui · 2015 [cited by applicant]
US 9020221B2 · Liu et al. · 2015 [cited by applicant]
US 9020222B2 · Wiets · 2015 [cited by applicant]
US 9020223B2 · Liu et al. · 2015 [cited by applicant]
US 9020228B2 · Yan et al. · 2015 [cited by applicant]
US 9020232B2 · Graham · 2015 [cited by applicant]
US 9020235B2 · Krishnan et al. · 2015 [cited by applicant]
US 9020236B2 · Wang et al. · 2015 [cited by applicant]
US 9025726B2 · Ishii · 2015 [cited by applicant]
US 9025842B2 · Barr et al. · 2015 [cited by applicant]
US 9025849B2 · Fouras et al. · 2015 [cited by applicant]
US 9026193B2 · Pahlevan et al. · 2015 [cited by applicant]
US 9030492B2 · Bischoff et al. · 2015 [cited by applicant]
US 9031295B2 · Klingenbeck · 2015 [cited by applicant]
US 9031300B1 · Manjeshwar et al. · 2015 [cited by applicant]
US 9031302B2 · Omi · 2015 [cited by applicant]
US 9031303B2 · Yamaguchi · 2015 [cited by applicant]
US 9036882B2 · Masumoto et al. · 2015 [cited by applicant]
US 9036884B2 · Harvey et al. · 2015 [cited by applicant]
US 9036887B2 · Fouras et al. · 2015 [cited by applicant]
US 9036899B2 · Vandenberghe · 2015 [cited by applicant]
US 9041712B2 · Bogues et al. · 2015 [cited by applicant]
US 9042611B2 · Blezek et al. · 2015 [cited by applicant]
US 9042612B2 · Gkanatsios et al. · 2015 [cited by applicant]
US 9042613B2 · Spilker et al. · 2015 [cited by applicant]
US 9042627B2 · Ohishi et al. · 2015 [cited by applicant]
US 9042628B2 · Florent et al. · 2015 [cited by applicant]
US 9111223B2 · Schmidt et al. · 2015 [cited by applicant]
US 9111372B2 · Ortega et al. · 2015 [cited by applicant]
US 9262698B1 · George et al. · 2016 [cited by applicant]
US 9277877B2 · Burlina et al. · 2016 [cited by applicant]
US 9333060B2 · Hunter · 2016 [cited by applicant]
US 9346167B2 · O'Connor et al. · 2016 [cited by applicant]
US 9373059B1 · Heifets et al. · 2016 [cited by applicant]
US 9430697B1 · Iliadis et al. · 2016 [cited by applicant]
US 9443141B2 · Mirowski et al. · 2016 [cited by applicant]
US 9443192B1 · Cosic · 2016 [cited by applicant]
US 9445713B2 · Douglas et al. · 2016 [cited by applicant]
US 9532762B2 · Cho et al. · 2017 [cited by applicant]
US 9536054B1 · Podilchuk et al. · 2017 [cited by applicant]
US 9542621B2 · He et al. · 2017 [cited by applicant]
US 9547804B2 · Nirenberg et al. · 2017 [cited by applicant]
US 9569736B1 · Ghesu et al. · 2017 [cited by applicant]
US 9589374B1 · Gao et al. · 2017 [cited by applicant]
US 9595002B2 · Leeman-Munk et al. · 2017 [cited by applicant]
US 9633282B2 · Sharma et al. · 2017 [cited by applicant]
US 9659560B2 · Cao et al. · 2017 [cited by applicant]
US 9662040B2 · Kam et al. · 2017 [cited by applicant]
US 9665927B2 · Ji et al. · 2017 [cited by applicant]
US 9668699B2 · Georgescu et al. · 2017 [cited by applicant]
US 9672814B2 · Cao et al. · 2017 [cited by applicant]
US 9674447B2 · Kam et al. · 2017 [cited by applicant]
US 9684960B2 · Buzaglo et al. · 2017 [cited by applicant]
US 9697463B2 · Ross et al. · 2017 [cited by applicant]
US 9700219B2 · Sharma et al. · 2017 [cited by applicant]
US 9710748B2 · Ross et al. · 2017 [cited by applicant]
US 9715508B1 · Kish et al. · 2017 [cited by applicant]
US 9717417B2 · DiMaio · 2017 [cited by applicant]
US 9720515B2 · Wagner et al. · 2017 [cited by applicant]
US 9730643B2 · Georgescu et al. · 2017 [cited by applicant]
US 9734567B2 · Zhang et al. · 2017 [cited by applicant]
US 9747546B2 · Ross et al. · 2017 [cited by applicant]
US 9747548B2 · Ross et al. · 2017 [cited by applicant]
US 9749738B1 · Adsumilli et al. · 2017 [cited by applicant]
US 9750450B2 · Shie et al. · 2017 [cited by applicant]
US 9753959B2 · Birdwell et al. · 2017 [cited by applicant]
US 9760807B2 · Zhou et al. · 2017 [cited by applicant]
US 9767385B2 · Nguyen et al. · 2017 [cited by applicant]
US 9767557B1 · Gulsun et al. · 2017 [cited by applicant]
US 9779492B1 · Garnavi et al. · 2017 [cited by applicant]
US 9792531B2 · Georgescu et al. · 2017 [cited by applicant]
US 9792907B2 · Bocklet et al. · 2017 [cited by applicant]
US 9798751B2 · Birdwell et al. · 2017 [cited by applicant]
US 9805255B2 · Yang et al. · 2017 [cited by applicant]
US 9805303B2 · Ross · 2017 [cited by applicant]
US 9805304B2 · Ross · 2017 [cited by applicant]
US 9805466B2 · Ryu et al. · 2017 [cited by applicant]
US 9811906B1 · Vizitiu et al. · 2017 [cited by applicant]
US 9818029B2 · Lee et al. · 2017 [cited by applicant]
US 11553874B2 · Hillen · 2023 [cited by applicant]
US 20060069591A1 · Razzano · 2006 [cited by applicant]
US 20060233455A1 · Cheng · 2006 [cited by examiner]
US 20080170764A1 · Burns · 2008 [cited by examiner]
US 20110110575A1 · Banumathi et al. · 2011 [cited by applicant]
US 20120087468A1 · Lang · 2012 [cited by examiner]
US 20120189182A1 · Liang · 2012 [cited by examiner]
US 20140037180A1 · Wang · 2014 [cited by examiner]
US 20160256121A1 · Colby · 2016 [cited by examiner]
US 20160259994A1 · Ravindran et al. · 2016 [cited by applicant]
US 20160361037A1 · Im · 2016 [cited by examiner]
US 20190269485A1 · Elbaz · 2019 [cited by examiner]
US 20190313963A1 · Hillen · 2019 [cited by examiner]
US 20190333627A1 · Johnson · 2019 [cited by examiner]
US 20200320685A1 · Anssari Moin · 2020 [cited by examiner]
US 20210106229A1 · Van Der Poel · 2021 [cited by examiner]
PCT/US2019/032096, International Search Report and Written Opinion issued on Jul. 29, 2019, 8 pages. [cited by applicant]
Oksana Bandura, How Dental Imaging Can Be Improved with Machine Learning, Convolutional neural networks and other machine learning algorithms are gradually transforming our reality. Dentistry is no exception. May 11, 20… [cited by applicant]
Office Action in connection to U.S. Appl. No. 18/510,197, dated Jul. 30, 2024. [cited by applicant]