Photograph-based assessment of dental treatments and procedures

Description

TECHNICAL FIELD

The current document is directed to methods and systems for monitoring patient progress during dental treatments and procedures and, in particular, to a photograph-based monitoring method, and system that carries out the method, that uses two-dimensional photographs taken during a patient examination to determine how well the patient's teeth correspond to a three-dimensional representation of the expected positions of patient's teeth according to the treatment plan.

BACKGROUND

Prior to the development of oral-cavity-imaging-and-modeling systems, dental practitioners employed mechanical-impression methods to create three-dimensional models of teeth and underlying tissue in order to facilitate fabrication of various types of prostheses, including crowns and bridges. The mechanical-impression technologies generally involved biting, by a patient, into a viscous, thixotropic material that retains an accurate impression of the patient's teeth and underlying tissue when the material is lifted off from the patient's teeth. The material may serve as a mold for casting a positive three-dimensional model of the patient's teeth and underlying gum tissue or as a mold for casting a prosthetic device. While mechanical-impression technologies have been used by dental practitioners for many decades, mechanical-impression technologies are associated with a variety of deficiencies, including a relatively large probability that the impression may be inadvertently altered or damaged during removal of the hardened, viscous, thixotropic material from the patient's teeth as well as during transportation of the impression to laboratories where positive three-dimensional models are cast and prostheses are fabricated. In addition, the procedure is time-consuming and unpleasant to many patients.

More recently, semi-automated oral-cavity-imaging-and-modeling systems have been developed to electronically create digital, three-dimensional models of teeth and underlying tissues from images of a patient's oral cavity captured by an electro-optical-mechanical endoscope, or wand, that is guided by a technician within a patient's oral cavity in order to collect a sufficient number of two-dimensional images from which a three-dimensional digital model of the patient's teeth and underlying tissues is computationally generated. The oral-cavity-imaging-and-modeling systems have proven to be faster, more accurate and robust, and more cost effective than mechanical-impression technologies.

In many cases, therefore, dental professionals can prepare accurate, three-dimensional models of a patient's teeth and use the three-dimensional models to analyze the patient's dental status and develop treatment plans for various types of deficiencies and pathologies. Furthermore, the three-dimensional model can be electronically manipulated to prepare projected three-dimensional configurations of the patient's teeth for various time points during the course of a treatment plan. Vendors of dental equipment, dental practitioners, and, ultimately, dental patients seek cost-effective and time-effective methods and systems to use the three-dimensional information in order to monitor a dental patient's progress during a course of treatment.

SUMMARY OF THE DISCLOSURE

The current document is directed to methods and systems for monitoring a dental patient's progress during a course of treatment. At any particular point in time during the course of treatment, a three-dimensional model of the expected positions of the patient's teeth at that point in time can be projected, in time, from a three-dimensional model of the patient's teeth prepared prior to beginning the treatment. During the course of treatment, a digital camera is used to take one or more two-dimensional photographs of the patient's teeth which are input to a monitoring system. The input two-dimensional photographs represent the actual positions of the patient's teeth. The monitoring system determines virtual-camera parameters for each two-dimensional input image with respect to the projected three-dimensional model and uses the determined virtual-camera parameters to generate two-dimensional images from the three-dimensional model. The generated two-dimensional photographs represent the expected or desired positions of the patient's teeth. The monitoring system then compares each input photograph to the corresponding generated two-dimensional image in order to determine how closely the three-dimensional arrangement of the patient's teeth corresponds to the projected three-dimensional arrangement. When the correspondence falls below a threshold level, an indication that the treatment is not proceeding according to plan is returned to a dental practitioner so that the dental practitioner can take corrective actions.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a three-dimensional model of a dental patient's teeth.

FIGS. 2A-B illustrate the relationship between a virtual-camera position and a three-dimensional model of a patient's teeth.

FIGS. 3A-D illustrate one approach to mapping points in the world coordinate system to corresponding points on the image plane of a virtual camera.

FIGS. 5A-D graphically illustrate the treatment-monitoring method to which the current document is, in part, directed.

FIG. 6 provides a control-flow-diagram illustration of the operation of the treatment-monitoring system and treatment-monitoring method to which the current document is directed.

FIGS. 7A-B illustrate, using control-flow diagrams, step 604 of FIG. 6.

FIG. 8 provides a control-flow diagram for step 610 of FIG. 6, a virtual-camera-parameters determination method.

FIG. 9 provides a control-flow diagram for the initial virtual-camera-parameters adjustment method invoked in step 805 of FIG. 8.

FIGS. 10A-C provide additional details with regard to steps 904, 908, and 912 of FIG. 9.

FIG. 11 shows the second virtual-camera-parameter's adjustment method invoked in step 806 of FIG. 8.

FIG. 12 provides a control-flow diagram for the optimization step 1106 in FIG. 11.

FIGS. 13A-C illustrate computation of a gradient-based cost.

FIG. 14 provides a control-flow diagram for the first virtual-camera-parameters refinement method called in step 807 of FIG. 8.

FIG. 15 illustrates examples of the tooth groups over which the inner loop of the method illustrated in FIG. 14 iterates.

FIG. 16 illustrates, using the same illustration conventions as used in FIG. 13, computation of the Laplacian vectors for image elements and generation of a Laplacian-vector field.

FIGS. 17A-B illustrate computation of the comparison value or correlation coefficient.

FIG. 18 provides a general architectural diagram for various types of computers, including computers used to implement dental-treatment monitoring systems.

FIG. 19 illustrates an Internet-connected distributed computer system.

FIG. 20 illustrates cloud computing.

FIG. 21 illustrates generalized hardware and software components of a general-purpose computer system, such as a general-purpose computer system having an architecture similar to that shown in FIG. 1

FIGS. 22A-B illustrates two types of virtual machine and virtual-machine execution environments.

DETAILED DESCRIPTION

FIG. 1 illustrates a three-dimensional model of a dental patient's teeth. The three-dimensional model 102 includes a three-dimensional model of the teeth associated with the dental patient's upper jaw 104 and a three-dimensional model of the dental patient's teeth associated with the lower jaw 106. The three-dimensional model is generally prepared, using sophisticated imaging and reconstruction hardware and software, based on optical scans of the dental patient's oral cavity. The three-dimensional model may be electronically represented in many different ways, similar to the many different ways in which three-dimensional objects may be represented in various different types of CAD/CAM and various imaging and solid-modeling systems. The model may be electronically presented in a variety of different orientations and configurations. For example, the two jaws 104 and 106 may be rotated about rotation axis 108 so that the teeth associated with the two jaws close together and assume a configuration similar to that in patient with a closed mouth. Each jaw and associated teeth may be, alternatively presented as a separate three-dimensional model.

FIGS. 2A-B illustrate the relationship between a virtual-camera position and a three-dimensional model of a patient's teeth. As shown in FIG. 2A, the three-dimensional model of the dental patient's teeth 202 is translationally and rotationally positioned within a three-dimensional world coordinate system 204 having three mutually orthogonal axes X, Y, and Z. A two-dimensional view of the three-dimensional model can be obtained, from any position within the world coordinate system external to the three-dimensional model, by simulated image capture using a virtual camera 208. The virtual camera 208 is associated with its own three-dimensional coordinate system 210 having three mutually orthogonal axes x, y, and z. The world coordinate system and the camera coordinate system are, of course, mathematically related by a translation of the origin of the camera x, y, z coordinate system from the origin 212 of the world coordinate system and by three rotation angles that, when applied to the camera, rotate the camera x, y, and z coordinate system with respect to the world X, Y, Z coordinate system. The origin 214 of the camera x, y, z coordinate system has the coordinates (0, 0, 0) in the camera coordinate system and the coordinates (X_c, Y_c, and Z_c) in the world coordinate system. The two-dimensional image captured by the virtual camera 216 can be thought of as lying in the x, z plane of the camera coordinate system and centered at the origin of the camera coordinate system, as shown in FIG. 2.

FIG. 2B illustrates operations involved with orienting and positioning the camera x, y, z coordinate system to be coincident with the world X, Y, Z coordinate system. In FIG. 2B, the camera coordinate system 216 and world coordinate system 204 are centered at two different origins, 214 and 212, respectively, and the camera coordinate system is oriented differently than the world coordinate system. In order to orient and position the camera x, y, z coordinate system to be coincident with the world X, Y, Z coordinate system, three operations are undertaken. A first operation 220 involves translation of the camera-coordinate system, by a displacement represented by a vector t, so that the origins 214 and 212 of the two coordinate systems are coincident. The position of the camera coordinate system with respect to the world coordinate system is shown with dashed lines, including dashed line 218, with respect to the world coordinate system following the translation operation 220. A second operation 222 involves rotating the camera coordinate system by an angle α (224) so that the z axis of the camera coordinate system, referred to as the z′ axis following the translation operation, is coincident with the Z axis of the world coordinate system. In a third operation 226, the camera coordinate system is rotated about the Z/z′ axis by an angle θ (228) so that all of the camera-coordinate-system axes are coincident with their corresponding world-coordinate-system axes.

FIGS. 3A-D illustrate one approach to mapping points in the world coordinate system to corresponding points on the image plane of a virtual camera. This process allows virtual cameras to be positioned anywhere within space with respect to a computational three-dimensional model of a patient's teeth and used to generate a two-dimensional image that corresponds to the two-dimensional image that would be captured from a real camera having the same position and orientation with respect to an equivalent solid-model three-dimensional representation of a patient's teeth. FIG. 3A illustrates the image plane of a virtual camera, an aligned camera coordinate system and world coordinate system, and a point in three-dimensional space that is imaged on the image plane of the virtual camera. In FIG. 3A, and in FIGS. 3B-D that follow, the camera coordinate system, comprising the x, y, and z axes, is aligned and coincident with the world-coordinate system X, Y, and Z. This is indicated, in FIG. 3A, by dual labeling of the x and X axis 302, the y and Y axis 304, and the z and Z axis 306. The point that is imaged 308 is shown to have the coordinates (X_p, Y_p, and Z_p). The image of this point on the virtual-camera image plane 310 has the coordinates (x_i, y_i). The virtual lens of the virtual camera is centered at the point 312, which has the camera coordinates (0, 0, l) and the world coordinates (0, 0, l). When the point 308 is in focus, the distance l between the origin 314 and point 312 is the focal length of the virtual camera. Note that, in FIG. 3A, the z axis is used as the axis of symmetry for the virtual camera rather than the y axis, as in FIG. 2A. A small rectangle is shown, on the image plane, with the corners along one diagonal coincident with the origin 314 and the point 310 with coordinates (x_i, y_i). The rectangle has horizontal sides, including horizontal side 316, of length x_i, and vertical sides, including vertical side 318, with lengths y_i. A corresponding rectangle with horizontal sides of length −X_p, including horizontal side 320, and vertical sides of length −Y_p, including vertical side 322. The point 308 with world coordinates X_p, Y_p, and Z_p) and the point 324 with world coordinates (0, 0, Z_p) are located at the corners of one diagonal of the corresponding rectangle. Note that the positions of the two rectangles are inverted through point 312. The length of the line segment 328 between point 312 and point 324 is Z_p-l. The angles at which each of the lines passing through point 312 intersects the z, Z axis 326 are equal on both sides of point 312. For example, angle 330 and angle 332 are identical. As a result, the principal of the correspondence between the lengths of similar sides of similar triangles can be used to derive expressions for the image-plane coordinates (x_i, y_i) for an imaged point in three-dimensional space with world coordinates (X_p, Y_p, and Z_p) 334:

$\frac{x_{i}}{l} = \frac{- X_{p}}{Z_{p} - l} = \frac{X_{p}}{l - Z_{p}}$

$\frac{y_{i}}{l} = \frac{- Y_{p}}{Z_{p} - l} = \frac{Y_{p}}{l - Z_{p}}$

$x_{i} = \frac{{lX}_{p}}{l - Z_{p}}, y_{i} = \frac{{lY}_{p}}{l - Z_{p}}$

Of course, virtual-camera coordinate systems are not, in general, aligned with the world coordinate system, as discussed above with reference to FIG. 2A. Therefore, a slightly more complex analysis is required to develop the functions, or processes, that map points in three-dimensional space to points on the image plane of a virtual camera. FIGS. 3B-D illustrate the process for computing the image of points in a three-dimensional space on the image plane of an arbitrarily oriented and positioned virtual camera. FIG. 3B shows the arbitrarily positioned and oriented virtual camera. The virtual camera 336 is mounted to a mount 337 that allows the virtual camera to be tilted by an angle α 338 with respect to the vertical Z axis and to be rotated by an angle θ 339 about a vertical axis. The mount 337 can be positioned anywhere in three-dimensional space, with the position represented by a position vector wo 340 from the origin of the world coordinate system 341 to the mount 337. A second vector r 342 represents the relative position of the center of the image plane 343 within the virtual camera 336 with respect to the mount 337. The orientation and position of the origin of the camera coordinate system coincides with the center of the image plane 343 within the virtual camera 336. The image plane 343 lies within the x, y plane of the camera coordinate axes 344-346. The camera is shown, in FIG. 3B, imaging a point w 347, with the image of the point w appearing as image point c 348 on the image plane 343 within the virtual camera. The vector wo that defines the position of the camera mount 337 is shown, in FIG. 3B, to be the vector

$w_{0} = [\begin{matrix} X_{0} \\ Y_{0} \\ Z_{0} \end{matrix}]$

FIGS. 3C-D show the process by which the coordinates of a point in three-dimensional space, such as the point corresponding to vector w in world-coordinate-system coordinates, is mapped to the image plane of an arbitrarily positioned and oriented virtual camera. First, a transformation between world coordinates and homogeneous coordinates h and the inverse transformation h⁻¹is shown in FIG. 3C by the expressions 350 and 351. The forward transformation from world coordinates 352 to homogeneous coordinates 353 involves multiplying each of the coordinate components by an arbitrary constant k and adding a fourth coordinate component k. The vector w corresponding to the point 347 in three-dimensional space imaged by the virtual camera is expressed as a column vector, as shown in expression 354 in FIG. 3C. The corresponding column vector w_hin homogeneous coordinates is shown in expression 355. The matrix P is the perspective transformation matrix, shown in expression 356 in FIG. 3C. The perspective transformation matrix is used to carry out the world-to-camera coordinate transformations (334 in FIG. 3A) discussed above with reference to FIG. 3A. The homogeneous-coordinate-form of the vector c corresponding to the image 348 of point 347, c_h, is computed by the left-hand multiplication of w_hby the perspective transformation matrix, as shown in expression 357 in FIG. 3C. Thus, the expression for c_hin homogeneous camera coordinates 358 corresponds to the homogeneous expression for c_hin world coordinates 359. The inverse homogeneous-coordinate transformation 360 is used to transform the latter into a vector expression in world coordinates 361 for the vector c 362. Comparing the camera-coordinate expression 363 for vector c with the world-coordinate expression for the same vector 361 reveals that the camera coordinates are related to the world coordinates by the transformations (334 in FIG. 3A) discussed above with reference to FIG. 3A. The inverse of the perspective transformation matrix, P⁻¹, is shown in expression 364 in FIG. 3C. The inverse perspective transformation matrix can be used to compute the world-coordinate point in three-dimensional space corresponding to an image point expressed in camera coordinates, as indicated by expression 366 in FIG. 3C. Note that, in general, the Z coordinate for the three-dimensional point imaged by the virtual camera is not recovered by the perspective transformation. This is because all of the points in front of the virtual camera along the line from the image point to the imaged point are mapped to the image point. Additional information is needed to determine the Z coordinate for three-dimensional points imaged by the virtual camera, such as depth information obtained from a set of stereo images or depth information obtained by a separate depth sensor.

Three additional matrices are shown in FIG. 3D that represent the position and orientation of the virtual camera in the world coordinate system. The translation matrix T_w₀370 represents the translation of the camera mount (337 in FIG. 3B) from its position in three-dimensional space to the origin (341 in FIG. 3B) of the world coordinate system. The matrix R represents the α and θ rotations needed to align the camera coordinate system with the world coordinate system 372. The translation matrix C 374 represents translation of the image plane of the virtual camera from the camera mount (337 in FIG. 3B) to the image plane's position within the virtual camera represented by vector r (342 in FIG. 3B). The full expression for transforming the vector for a point in three-dimensional space w_hinto a vector that represents the position of the image point on the virtual-camera image plane c_his provided as expression 376 in FIG. 3D. The vector w_his multiplied, from the left, first by the translation matrix 370 to produce a first intermediate result, the first intermediate result is multiplied, from the left, by the matrix R to produce a second intermediate result, the second intermediate result is multiplied, from the left, by the matrix C to produce a third intermediate result, and the third intermediate result is multiplied, from the left, by the perspective transformation matrix P to produce the vector c_h. Expression 378 shows the inverse transformation. Thus, in general, there is a forward transformation from world-coordinate points to image points 380 and, when sufficient information is available, an inverse transformation 381. It is the forward transformation 380 that is used to generate two-dimensional images from a three-dimensional model or object corresponding to arbitrarily oriented and positioned virtual cameras. Each point on the surface of the three-dimensional object or model is transformed by forward transformation 380 to points on the image plane of the virtual camera.

FIG. 4 illustrates a continuum of three-dimensional models of a dental patient's teeth that can be electronically prepared to reflect the expected arrangements of the dental patient's teeth during the course of a proposed treatment plan. In FIG. 4, lower horizontal arrow 402 represents the timeline of the treatment plan. At an initial starting point 404, specified in FIG. 4 as time to, the arrangement of the dental patient's teeth is captured in an initial three-dimensional model 406 of the patient's teeth. A time-projected three-dimensional model, such as three-dimensional model 408, can be electronically prepared as an estimate of how the dental patient's teeth are expected to be arranged at a future point in time t₈₂or t₁₅₄during the course of the treatment or procedure. As shown in FIG. 4, the final time-projected three-dimensional model 410 in the continuous series of three-dimensional models represents the goal for the treatment or procedure that is expected to be obtained at time t₂₂₄. Although only four three-dimensional models are shown in both the treatment or procedure timeline 402 in FIG. 4, a time-projected three-dimensional model for any point along the timeline can be electronically prepared using extrapolation and simulation-based methodologies.

FIGS. 5A-D graphically illustrate the treatment-monitoring method to which the current document is, in part, directed. As shown in FIG. 5A, at a particular current point in time, t₈₂, during a dental patient's treatment or procedure, represented in FIG. 5A by vertical arrow 502, a dental practitioner examines the patient and takes a number n of two-dimensional pictures of the patient's teeth 504 (P₁, P₂, P₃). Alternatively, in certain implementations, the two-dimensional pictures may be taken by a patient's friend or relative, or even the patient, using a camera timer or smart-phone features that facilitate acquisition of images of a user. In the current example, n is equal to 3. In general, each photograph or subset of the photographs represents a certain, standard view or image type. A dental practitioner or other person is provided with instructions for capturing an image of a particular standard view or type. As shown in FIG. 5B, once the practitioner has submitted these two-dimensional images, along with patient information, an indication of the time that the two-dimensional images were captured, and other such information, the treatment-monitoring system, to which the current document is, in part, directed, determines camera parameters for virtual cameras 506-508, the orientations and positions of which most likely correspond to the camera parameters of the dental practitioner's camera at the points in time at which each of the corresponding n two-dimensional pictures, 510-512, respectively, were captured by the dental practitioner or other person.

Next, as shown in FIG. 5C, the determined camera parameters for the virtual cameras are used to generate corresponding two-dimensional images 516-518 corresponding to the n two-dimensional images 510-512 taken by the dental practitioner or other person. Finally, as shown in FIG. 5D, a comparison operation, such as comparison operation 1520, is applied to each pair of a dental-practitioner-submitted image and a corresponding image generated from the three-dimensional model in order to produce a correlation coefficient. In one implementation, the correlation coefficients are expressed as floating point values between 0 and 1 (522 in FIG. 5D). The correlation coefficients for the individual images are used to generate a single aggregate correlation value 524, in one implementation of the currently described method and system, which is also a floating-point value between 0 and 1 (526 in FIG. 5D). When the aggregate correlation value computed from the submitted two-dimensional images and the projected three-dimensional model is greater than a threshold value, as determined in step 528, then the treatment-monitoring system stores, in memory, and returns an indication that the treatment is proceeding according to plan 530. Otherwise, the treatment-monitoring system stores, in memory, and returns an indication that the treatment is not going according to plan 532. It should be noted that, in certain implementations, multiple images for a given standard view may be used for generating correlation coefficients and an aggregate correlation coefficient. In other implementations, including an implementation discussed below, a best representative image for each standard view is selected for processing.

FIG. 6 provides a control-flow-diagram illustration of the operation of the treatment-monitoring system and treatment-monitoring method to which the current document is directed. Additional control-flow diagrams, discussed below, provide greater detail for various steps in the highest-level control-flow diagram shown in FIG. 6. In step 602, the treatment-monitoring method and/or system (“treatment monitor”) receives: (1) n two-dimensional photographs of a first jaw and m two-dimensional photographs of a second jaw of a dental patient examined during the course of a treatment or procedure; (2) exchangeable-image-file-format (“EXIF”) metadata for each of the n+m two-dimensional images; (3) text labels for the two-dimensional images, which include, among other things, an indication of a standard type of view represented by each image and characterizations and parameters for the digitally encoded image, including the size of the image, date and time information, and camera settings, including one or more of the camera model and make and camera orientation, aperture, shutter speed, focal length, metering mode, and International Organization for Standardization (“ISO”) speed information; (4) a patient ID and other information; and (5) the time and date, t, of the patient examination which produced the two-dimensional photos. In step 604, the treatment monitor checks and verifies the input data. When there are any errors detected, as determined in step 606, an error is returned, in step 608, to allow various types of amelioration procedures to be undertaken, including requesting additional or substitute input information. Otherwise, in step 610, the treatment monitor determines the virtual-camera parameters for each of the input images that have survived the initial check and verification step 604. In step 612, a two-dimensional image corresponding to each of the input images is generated from the time-projected three-dimensional model using the determined set of virtual-camera parameters for the corresponding input image. In step 614, each input image and corresponding model-based projected image is compared to determine a correlation coefficient, and the set of correlation coefficients are used to determine an aggregate correlation coefficient. When the determined aggregate correlation coefficient is greater than a threshold value, as determined in step 616, an indication that the treatment or procedure is on track, ON_TRACK, is returned in step 618. Otherwise, an indication that the treatment or procedure is off track, OFF_TRACK, is returned in step 620.

FIGS. 7A-B illustrate, using control-flow diagrams, step 604 of FIG. 6. In the nested for-loops of steps 702-713, each input image related to each of the first and second jaws of the dental patient is considered (for each input image related to currently considered jaw 703). In step 704, the check-and-verification method matches the currently considered image within the nested for-loops with the metadata extracted and collected for that image from the input data. In step 705, the check-and-verify method filters the image to remove inconsistencies and defects and, in certain cases, may expand or contract the contrast within the image, or alter the color balance, in order to adjust the image for further analysis. In step 706, the check-and-verify method carries out a qualitative analysis of the image and assigns a quality metric to the image. This quality metric reflects how well the image corresponds to the image type specified in the metadata, as well as the sharpness, clarity, and completeness of the image. When the currently considered image is equivalent to an image already processed within the nested for-loops, as determined in step 707, and when the quality of metric assigned to the currently considered image is better than that of the already-processed image, as determined in step 708, the already-processed image is replaced by the currently considered image in a set of processed images prepared by the check-and-verify method, in step 709. Otherwise, when the quality metric assigned to the currently considered image is not better than that of the already-processed image, as determined in step 708, the currently considered image is discarded, in step 710. When the currently considered image is not equivalent to an already-processed image, as determined in step 707, the currently considered image is placed, along with the computed quality metric and various metadata, into the set of processed images, in step 711 and steps 704-711 repeated if there are more images 712 or more jaws 713. In step 714, the check-and-verify method verifies the patient ID included in the input information. Turning to FIG. 7B, when the patient ID is verified, as determined in step 715, and when the set of processed images prepared in the nested for-loops of step 702-713 are deemed adequate for further analysis, as determined in step 717, the check-and-verify method returns, in step 719, without reporting an error condition. In this case, the set of processed images contains a single, best image of each type, and the set of images contains sufficient information to proceed with analyzing progress of the treatment. Otherwise, error conditions are reported in steps 716 and 718. Of course, the check-and-verify method may, in various implementations, carry out additional types of verification and checking of the input data, and may return addition types of error conditions when the additional checks and verifications fail.

FIG. 8 provides a control-flow diagram for step 610 of FIG. 6, a virtual-camera-parameters determination method. In the for-loop of steps 802-812, each image in the set of processed images produced by the check-and-verify method, discussed above with reference to FIGS. 7A-B, is considered. In step 803, the method uses the metadata associated with the image, including the image type, to initialize a set of virtual-camera parameters associated with the image and to select an iteration count N. Different types of images and images with different characteristics and qualities may require a different number of adjustments and refinements. Then, in the while-loop of steps 804-810, the initial virtual-camera parameters for the image are adjusted and refined, with the while-loop iterating for N iterations. The adjustment and refinement process is non-convex, as a result of which the process does not necessarily converge. In step 805, a first virtual-camera-parameters adjustment method is invoked to make relatively coarse adjustments to the initial virtual-camera parameters. In step 806, a second virtual-camera-parameters adjustment method is invoked to more finely adjust the virtual-camera parameters for the image. In step 807, a first virtual-camera-parameters refinement method is invoked to refine the virtual-camera parameters associated with the image and, in step 808, a second virtual-camera-parameters refinement procedure is invoked to refine the virtual-camera-parameters associated with the image. In step 809, the iteration variable N is decremented. When N is greater than 0, as determined in step 810, then the while-loop of steps 804-810 continues to iterate. Otherwise, in step 811, a final refinement method is called to adjust the virtual-camera parameters for the image. Note that, through the various steps and iterations, the virtual-camera parameters associated with an image are generally continuously adjusted and refined towards a set of virtual-camera parameters that best estimates the position, orientation, and focal length of the dental practitioner's camera, with respect to the patient's teeth, used to initially capture the input image.

FIG. 9 provides a control-flow diagram for the initial virtual-camera-parameters-adjustment method invoked in step 805 of FIG. 8. In step 902, the method uses metadata associated with the image to select a value of an iteration variable M, in similar fashion to the selection of a value for the iteration variable N in step 803 in FIG. 8, and a set of entries resultSet is initialized to be empty. In step 904, the initial virtual-camera-parameters-adjustment method applies thresholding to each pixel color/intensity value within the image to generate a teeth mask, TM, for the image. When the pixels are encoded in the Lab color model, the a color component of the pixel color/intensity value is thresholded. The Lab color model is a color-opponent space with dimension L for lightness and color-opponent dimensions a and b, based on nonlinearly compressed color space coordinates, such as International Commission on Illumination (“CIE”) XYZ color space coordinates. When other color-model encodings are used for pixel colors and intensities, other components or values derived from one or more components of the pixel color/intensity values are thresholded. The elements corresponding to image pixels in the teeth mask TM are associated with one of two binary values to indicate whether the pixel or element corresponds to a tooth region or a non-tooth region within the image. In step 906, a similar teeth mask, TM′, is generated from the time-projected three-dimensional using the current virtual-camera parameters for the two-dimensional input image from which teeth mask TM was produced. In step 908, a distance transform of teeth mask TM, TM_dt, is generated. In step 910, the method searches for a minimal-cost overlay of teeth mask TM′ onto the distance transform of TM, TM_dt, with the search carried out over various rotations and scale factors of the teeth mask TM′ with respect to the distance transform TM_dt. In step 912, adjustments to the virtual-camera parameters for the currently considered two-dimensional image are computed in order to generate a new two-dimensional image from the three-dimensional model and a new teeth mask TM′ that correspond to the minimal-cost overlay of the previously computed TM′ onto TM_dt. In step 914, a cost of the new TM′ teeth mask with respect to TM_dtis computed. The adjusted virtual-camera parameters and computed cost, obtained in steps 912 and 914, are stored as a next entry in the set variable resultSet, in step 916. In step 917, iteration variable M is decremented. When M is still greater than 0, as determined in step 918, control returns to step 906 for an additional iteration of the virtual-camera-parameters adjustment. Otherwise, in step 920, the minimal-cost entry in resultSet is selected and the virtual-camera parameters associated with the two-dimensional image are set to the virtual-camera parameters in the selected entry.

FIGS. 10A-C provide additional details with regard to steps 904, 908, and 912 of FIG. 9. FIG. 10A illustrates the thresholding step 904 in FIG. 9. A small hypothetical portion of an image 1002 is shown as the original image in FIG. 10A. Each pixel in the original image is shown to have an intensity/color-component value. In the thresholding operation, those pixels with intensity/color-component values less than a threshold value, in the current hypothetical case 5, are assigned to the value 1 and all other pixels are assigned to the value 0. In one implementation, the threshold value is determined using well-known Otsu's well-known thresholding method, in which image pixels are partitioned into two classes on the assumption that the intensity-value distribution of the pixels can be modeled as a bi-modal distribution. Otsu's method seeks a threshold that minimizes the intra-class variance, which is the weighted sum of the intensity-value variances of the two classes. Pixels assigned the value 1 are considered to be tooth-region pixels and the other pixels are considered to be non-tooth-region pixels. Thus, in the thresholded image 1004, a small interior region 1006 corresponds to teeth. In addition, there are two small, teeth-like regions 1008 and 1010 adjacent to the edge of the image. In a next step, any of the teeth regions adjacent to the edge are backfilled with 0 values, since the teeth should not be at the borders of the photographs according to the procedures and protocols for taking photographs by the dental practitioner. A final step, not shown in FIG. 10A, reconsiders 0-backfilled regions to ensure that teeth-like regions have not been inadvertently back filled. The result of the next step is a tooth mask 1012 with an interior tooth-corresponding region 1014 with 1-valued pixels and an outer region with 0 value corresponding to non-tooth regions 1016.

FIG. 10B illustrates the computation of a distance transform of one mask in computing the cost of an overlay of a second mask onto this distance transform. A first mask 1020 is shown in FIG. 10B. The outer portion of the mask 1022 is shown in grid lines and has one of two binary values and an interior portion of the mask 1024 is shown without grid lines and each element or pixel in the interior portion has the other of the two binary values. A second mask 1026 is shown below the first mask. Note that the interior region of the second mask 1028 is differently shaped in size than the interior region 1024 of the first mask 1020. A distance transformation transforms the first mask 1020 into a first-mask distance transform 1030. In this transformation, the value of the elements or pixels in the first mask are replaced by the distance, in elements or pixels, that needs to be traversed from the element to the boundary between the outer and inner portions of the first mask. For example, from pixel 1032, no other pixels or elements need to be traversed in order to reach the boundary 1034 of the inner and outer mask regions, and therefore pixel or element 1032 has value 0 in the distance transform. Many different types of distance metrics can be used, including Euclidian distance, city-block distance, and other such distances. In the right-hand corner of FIG. 10B, the second mask 1026 is rotated with respect to the distance transform of the first mask 1030 and overlaid on top of the distance transform of the first mask to produce an overlay 1040. In the search for the minimal cost or best overlay of TM′ with respect to TM_dt, in step 910 of FIG. 9, a state space search is carried out in which various possible rotations and translations of the second mask are considered with respect to the distance transform of the first mask for various different scales, or sizings, of the second mask. The cost for a particular overlay, such as overlay 1040, is computed as the sum of the values of the elements in the distance transform underlying the interior region 1028 of the second mask, as indicated 1042 in FIG. 10B below the overlay 1040.

FIG. 10C illustrates certain of the adjustments of the virtual-camera parameters in order to create a projected image from which a new TM′ that corresponds to a minimal-cost overlay of the TM′ over the distance transform can be prepared. The adjustments include adjusting the position or center of the virtual camera 1060, adjusting the roll and yaw angles of the virtual camera 1062 and 1064, and adjusting the focal length or distance of the virtual camera from the surface of the 3D model 1066. The adjustments alter one or more of the shape, size, and orientation of the inner teeth region of the previous TM′ so that a minimal-cost overlay of the new TM′ is obtained. First, the camera is rotated 1060 so that the center of mass of the two masks, TM and TM′, coincide. For this purpose, two vectors are constructed in a coordinate system with an origin coincident with the camera position. The two vectors include a first vector that describes the position of the TM center of mass and a second vector that describes the position of the TM′ center of mass. The camera is rotated about a rotation axis coincident with the vector obtained as the cross-product of the first and second vectors. The camera roll angle is adjusted 1062, for front or side views only, by fitting straight lines through both teeth masks and rotating camera around the z axis (346 in FIG. 3B) so that the lines are parallel. To modify the area of mask TM′ 1066, the camera is moved closer or further from the three-dimensional model. A coefficient K controls this movement. When K>1, the camera is moved away from the three-dimensional model. Otherwise, the camera is moved closer to the three-dimensional model. Coefficient K is found using an empirical formula

$K = 1 + \frac{1}{2} (\sqrt[4]{\frac{\langle {TM}^{'} \rangle}{\langle TM \rangle}} - 1),$

- where |TM| and |TM′| are the areas, in pixels, of the two masks TM and TM′, respectively. Adjustment of the yaw angle 1064 is carried for front or side views, but not for occlusal views. The yaw angle is computed using parameters of parabolas that are fitted through masks and an empirical formula for computing of the yaw angle in radians, provided below:

$y = a_{1} x^{2} + b_{1} x + c_{1}, where x, y \in TM, y = a_{2} x^{2} + b_{2} x + c_{2}, where x, y \in {TM}^{'}, yaw angle = \frac{1}{2} \sqrt{\langle a_{1} - a_{2} \rangle} * sign (a_{1} - a_{2}) .$

FIG. 11 shows the second virtual-camera-parameters adjustment method invoked in step 806 of FIG. 8. In step 1102, the metadata associated with the image is used to determine a value for an iteration variable N. Then, in the for-loop of steps 1104-1107, each of the two jaws of the dental patient, and their associated teeth, are considered. In step 1105, the jaw and associated teeth that are not currently considered are removed from the image and from current consideration. Then, in step 1106, the virtual-camera parameters associated with the image are optimized for that portion of the image corresponding to the currently considered jaw and associated teeth.

FIG. 12 provides a control-flow diagram for the optimization step 1106 in FIG. 11. In step 1202, an initial value of a variable cost is set to a large number and the variables p and q are both set to the current virtual-camera parameters. Then, in the while-loop of steps 1204-1212, an optimization method is used to find an optimized set of virtual-camera parameters for the currently considered image. The while-loop iterates over a number of iterations indicated by the iteration variable N, determined in step 1102 of FIG. 11. In step 1205, a two-dimensional image is generated from the three-dimensional model using the virtual-camera parameters q. In step 1206, a gradient-based cost is computed for this generated two-dimensional image with respect to the currently considered input image. When the new gradient-based cost is greater than the value stored in the variable cost 1207, the virtual-camera parameters p are returned, in step 1208, since these parameters correspond at least to a local minimum discovered in the previous iteration of the while-loop. Otherwise, the value of the variable cost is set to the new cost computed in step 1206 and the virtual-camera parameters p are set to q, in step 1209. In step 1210, the virtual-camera parameters q are perturbed in the direction of minimizing the cost within certain predefined limits. In step 1211, the iteration variable N is decremented. When the iteration variable N is greater than or equal to 0, as determined in step 1212, control returns to step 1205 for another iteration of the while-loop. Otherwise, the current virtual-camera parameters p are returned, in step 1213. The optimization approach illustrated in FIG. 12 is used subsequently for numerous steps, described below.

In one implementation, a Nelder-Mead downhill simplex optimization method is employed, with seven dimensions, including three rotations, three translations, and the virtual-camera view angle. In this method, a simplex with n+1 vertices in n dimensions, for a problem in n variables, is used, with test points corresponding to the vertices. The test points are replaced in a way that conserves the volume of the simplex but moves and deforms the simplex toward a local optimum. There are many variations of the Nelder-Mead downhill simplex optimization method, and many additional optimization methods that may be employed to optimize the virtual-camera parameters.

FIGS. 13A-C illustrate computation of a gradient-based cost. A small portion of the pixels in image 1302 are shown at the top of FIG. 13. The pixels are cells within a grid, such as the cell 1304 with grid coordinates (x,y). The gradient at the location of a pixel (x,y) in an image f is a vector 1306 that can be estimated from a discrete pixel-intensity computation 1308. Thus, the gradient vector ∇f(x,y) can be computed for each pixel or element of an image. The gradient vector 1310 for the pixel f(x,y) 1304 is shown as an example of a gradient associated with a pixel element. By computing the gradient at each pixel in an image, with different methods used to compute certain of the boundary-pixel gradient vectors, an image can be transformed into a vector field. Two images can be compared by computing a comparison value based, in part, on a comparison of the gradient-vector fields of the two images.

FIG. 13B illustrates generation of histograms for the intensity values of two images that are to be compared. The probability that a randomly selected pixel from the images has a particular intensity value can be computed from pixel-intensity histograms. In FIG. 13B, two images 1320 and 1322 are shown. Image 1320 is referred to as image I₁and image 1322 is referred to as image I₂. As usual, the pixels within the images are shown as rectangular or square cells and the cells are associated with coordinates with respect to x 1324-1325 and y 1326 and 1327 axes. Each pixel is associated with an intensity value. The intensity value may have different components, depending on the color model used to encode the colors and intensities of the pixel, or may be associated with a single intensity derived from the multiple color/intensity components associated with a pixel. In one implementation, each pixel is associated with an averaged intensity that represents the average of three color-channel intensities. The intensity for a pixel with coordinates (x, y) of image I₁is denoted as I₁(x, y). For example, the intensity of cell 1328 is I₁(4, 12). Histograms 1330-1332 are be prepared from the intensity values of the pixels of the individual images I₁and I₂and for the combination of the two images. For example, histogram 1330 is prepared from image I₁. The horizontal axis 1335 of the histogram is incremented in increasing intensity values and the vertical axis 1336 represents the number of pixels in the image having a particular intensity value. Of course, the histograms may be computationally represented by arrays of pixel counts indexed by intensity values. Histogram 1331 is prepared, in similar fashion, from image I₂1322. The joint histogram 1332 is a histogram showing the number of matching or aligned pixels, in the two images I₁and I₂, having a particular ordered pair of intensity values. The horizontal axis 1338 of the joint-image histogram 1332 is incremented in pairs of intensity values and the vertical axis 1339 represents the number of equivalent, aligned pixel pairs having a particular ordered pair of intensities. One pixel of each pair of pixels is selected from the first of the two images and the other pixel of each pair of pixels is selected from the second of the two images, with both pixels of each pair having the same (x, y) coordinates. The histograms can be thought of as discrete probability distributions. For example, the probability that a randomly selected pixel from image I₁has the intensity value 10 1340 can be computed as the number of pixels in image I₁with intensity value 10 1342 divided by the number of pixels in image I₁1344. In similar fashion, the probability that two aligned and matching pixels and images I₁and I₂have a particular ordered pair of intensity values 1346 is computed as the ratio of the number of pixels of the two images having the ordered pair of intensity values divided by the total number of the pixels in each of the two images 1348.

As shown in FIG. 13C, the intensity probabilities computed for randomly selected pixels of the two images I₁and I₂and joint intensity probabilities for pairs of matching pixels selected from the two images can be represented by alternative, simpler notation 1350. Using this notation, the expressions 1352 show calculation of the Shannon entropy H₁, H₂, and H_1,2for image I₁, image I₂, and the combination of images I₁and I₂, respectively. The mutual information for the two images I₁and I₂, MI(I₁, I₂) is then computed, as shown in FIG. 131354 from the entropies computed in expressions 1352. A variety of alternative expressions for MI(I₁, I₂) in terms of entropies, joint entropies, and conditional entropies can instead be used to compute MI(I₁, I₂). A cost function that represents a comparison value for two images I₁and I₂is then computed as the negative of the mutual information of the two images multiplied by a computed value G(I₁, I₂), as shown in expression 1356. The computed value G(I₁, I₂) is, as shown in expression 1358, computed as the sum of a function ƒ( ) computed over all of the pixels of the images. The function ƒ( ) takes, as arguments, the gradients computed for each pixel (x, y) for the two images and the value in the teeth mask computed for the first of the two images. As shown in expression 1360, the function ƒ( ) has the value cos(a, b)*√{square root over (min(|a|, |b|))} when the pixel to which the function is applied is a member of a teeth region in the mask and is otherwise 0. The cost-function value is minimized, by optimization methods discussed above with reference to FIG. 12.

FIG. 14 provides a control-flow diagram for the first virtual-camera-parameters refinement method called in step 807 of FIG. 8. In step 1402, the metadata associated with the currently considered input image is used to determine the value for an iteration variable N and a set variable resultSet is initialized to be empty. In step 1404, the current virtual-camera parameters for the image are stored. In an outer for-loop of steps 1406, each of the patient's two jaws and associated teeth are separately considered in two iterations. In the inner for-loop of steps 1407-1411, each tooth group of the currently considered jaw is considered 1407. The rest of the image other than the currently considered tooth group is masked out of the image, in step 1408. Then, in step 1409, an optimization procedure equivalent to the optimization procedure discussed above with reference to FIG. 12 is used to optimize the virtual-camera parameters for the currently considered input image. In step 1410, the optimized virtual-camera parameters are stored as a next entry in the set resultSet produced by the inner and outer for-loops of steps 1406-1413. Finally, in step 1411, the current virtual-camera parameters are reset to the stored virtual-camera parameters, stored in step 1404 and repeated for more tooth groups 1412. Following termination of the two nested loops in steps 1406-1413, a refined virtual-camera parameter is computed from the entries stored in the set resultSet by the two nested loops, in step 1414. This computation may involve illuminating outlying results from the results set and then averaging or using a weighted average on the remaining results of the results set. Then, in step 1415, the virtual-camera parameters for the currently considered input image are set to the refined virtual-camera parameters determined in step 1414.

FIG. 15 illustrates examples of the tooth groups over which the inner loop of the method illustrated in FIG. 14 iterates. At the top of FIG. 15, a chart indicating the universal numeric code for human teeth is provided 1502. Example tooth groups are shown below the chart, such as example tooth group 1504 consisting of the four teeth 7, 8, 9, and 10. Various different partitionings of teeth into tooth groups can be employed for deriving the multiple iterations of the inner loop of the nested for-loops discussed above with reference to FIG. 14.

The current discussion has been proceeding through the steps shown in FIG. 8. The second virtual-camera-parameters refinement method, invoked in step 808, uses an optimization method similar to that discussed above with reference to FIG. 12 on the full complement of teeth. The final refinement method, invoked in step 811 of FIG. 8, is similar to the method invoked in step 808, with the exception that the cost is computed from a consideration of the second derivatives of the images at the image elements, or Laplacian vectors, rather than the first derivatives, or gradient vectors. FIG. 16 illustrates, using the same illustration conventions as used in FIG. 13, computation of the Laplacian vectors for image elements and generation of a Laplacian-vector field.

As discussed above with reference to FIGS. 5D and 9, once all the input images are associated with finally refined virtual-camera parameters, a comparison is made between each input image and a corresponding image generated from the three-dimensional model in order to generate a comparison value or correlation coefficient. FIGS. 17A-B illustrate computation of the comparison value or correlation coefficient. As shown in FIG. 17A, a two-dimensional image 1702 I_sis generated 1706 from the three-dimensional model 1704 using the virtual-camera parameters determined, as discussed above with reference to FIG. 8, for a corresponding input image I_p1708. Next, a contour line that encloses the teeth in the image is generated 1707. This contour line is then overlaid or superimposed over the original input image 1708 to produce an overlaid image 1710. As shown in FIG. 17A in inset 1712, for each pixel (x, y) lying along the contour line 1714, a small square, rectangular, or other compact region 1716, ϵ_x,y, can be constructed. The comparison values generated from the overlaid image 1710 involve computing the cost of the pixels that lie along the contour in both the input image I_pand the image generated from the three-dimensional model I_s. The cost for a contour-overlapping pixel (x, y) is computed as shown in expression 1720 in FIG. 17B. When the absolute values or magnitudes of the gradients for pixel (x, y) in both images is greater than a threshold T, which has the value 3 in one implementation, the cost for the pixel is the dot product of the gradients for the pixel in the two images divided by the product of the magnitudes of the two gradients. Otherwise, the cost is 0. A fitness or similarity metric can be computed, as shown in equation 1722, as the sum of the costs of the pixels lying along the contour divided by the length of the contour, in pixels. An alternative fitness or similarity metric is shown in expression 1724. In the alternative fitness value, the cost for the two images is computed as the sum of the cost of the pixels along the contour divided by the sum of the maximum cost of any pixel in the region ϵ_x,yfor each of the pixels in the two images (x, y). This alternative metric has greater reliability when input images are slightly blurred by applying a Gaussian filter. Either fitness value or a linear combination of the two fitness values may be used as the computed similarity metric or correlation coefficient for the comparison of the two images.

It should be noted that, in general, color images are processed by the monitoring method. When gradients and Laplacian vectors are computed, they are computed based on an overall luminance or intensity computed from the three different color values of whatever color scheme is used to encode the images.

FIG. 18 provides a general architectural diagram for various types of computers, including computers used to implement dental-treatment monitoring systems. The computer system contains one or multiple central processing units (“CPUs”) 1802-1805, one or more electronic memories 1806 interconnected with the CPUs by a CPU/memory-subsystem bus 1810 or multiple busses, a first bridge 1812 that interconnects the CPU/memory-subsystem bus 1810 with additional busses 1814 and 1816, or other types of high-speed interconnection media, including multiple, high-speed serial interconnects. These busses or serial interconnections, in turn, connect the CPUs and memory with specialized processors, such as a graphics processor 1818, and with one or more additional bridges 1820, which are interconnected with high-speed serial links or with multiple controllers 1822-1827, such as controller 1827, that provide access to various different types of mass-storage devices 1828, electronic displays, input devices, and other such components, subcomponents, and computational resources. It should be noted that computer-readable data-storage devices include optical and electromagnetic disks, electronic memories, and other physical data-storage devices. Those familiar with modern science and technology appreciate that electromagnetic radiation and propagating signals do not store data for subsequent retrieval, and can transiently “store” only a byte or less of information per mile, far less information than needed to encode even the simplest of routines.

Of course, there are many different types of computer-system architectures that differ from one another in the number of different memories, including different types of hierarchical cache memories, the number of processors and the connectivity of the processors with other system components, the number of internal communications busses and serial links, and in many other ways. However, computer systems generally execute stored programs by fetching instructions from memory and executing the instructions in one or more processors.

FIG. 19 illustrates an Internet-connected distributed computer system. As communications and networking technologies have evolved in capability and accessibility, and as the computational bandwidths, data-storage capacities, and other capabilities and capacities of various types of computer systems have steadily and rapidly increased, much of modern computing now generally involves large distributed systems and computers interconnected by local networks, wide-area networks, wireless communications, and the Internet. FIG. 19 shows a typical distributed system in which a large number of PCs 1902-1905, a high-end distributed mainframe system 1910 with a large data-storage system 1912, and a large computer center 1914 with large numbers of rack-mounted servers or blade servers all interconnected through various communications and networking systems that together comprise the Internet 1916. Such distributed computing systems provide diverse arrays of functionalities. For example, a PC user sitting in a home office may access hundreds of millions of different web sites provided by hundreds of thousands of different web servers throughout the world and may access high-computational-bandwidth computing services from remote computer facilities for running complex computational tasks.

Until recently, computational services were generally provided by computer systems and data centers purchased, configured, managed, and maintained by service-provider organizations. For example, an e-commerce retailer generally purchased, configured, managed, and maintained a data center including numerous web servers, back-end computer systems, and data-storage systems for serving web pages to remote customers, receiving orders through the web-page interface, processing the orders, tracking completed orders, and other myriad different tasks associated with an e-commerce enterprise.

FIG. 20 illustrates cloud computing. In the recently developed cloud-computing paradigm, computing cycles and data-storage facilities are provided to organizations and individuals by cloud-computing providers. In addition, larger organizations may elect to establish private cloud-computing facilities in addition to, or instead of, subscribing to computing services provided by public cloud-computing service providers. In FIG. 20, a system administrator for an organization, using a PC 2002, accesses the organization's private cloud 2004 through a local network 2006 and private-cloud interface 2008 and also accesses, through the Internet 2010, a public cloud 2012 through a public-cloud services interface 2014. The administrator can, in either the case of the private cloud 2004 or public cloud 2012, configure virtual computer systems and even entire virtual data centers and launch execution of application programs on the virtual computer systems and virtual data centers in order to carry out any of many different types of computational tasks. As one example, a small organization may configure and run a virtual data center within a public cloud that executes web servers to provide an e-commerce interface through the public cloud to remote customers of the organization, such as a user viewing the organization's e-commerce web pages on a remote user system 2016.

Cloud-computing facilities are intended to provide computational bandwidth and data-storage services much as utility companies provide electrical power and water to consumers. Cloud computing provides enormous advantages to small organizations without the resources to purchase, manage, and maintain in-house data centers. Such organizations can dynamically add and delete virtual computer systems from their virtual data centers within public clouds in order to track computational-bandwidth and data-storage needs, rather than purchasing sufficient computer systems within a physical data center to handle peak computational-bandwidth and data-storage demands. Moreover, small organizations can completely avoid the overhead of maintaining and managing physical computer systems, including hiring and periodically retraining information-technology specialists and continuously paying for operating-system and database-management-system upgrades. Furthermore, cloud-computing interfaces allow for easy and straightforward configuration of virtual computing facilities, flexibility in the types of applications and operating systems that can be configured, and other functionalities that are useful even for owners and administrators of private cloud-computing facilities used by a single organization.

FIG. 21 illustrates generalized hardware and software components of a general-purpose computer system, such as a general-purpose computer system having an architecture similar to that shown in FIG. 1. The computer system 2100 is often considered to include three fundamental layers: (1) a hardware layer or level 2102; (2) an operating-system layer or level 2104; and (3) an application-program layer or level 2106. The hardware layer 2102 includes one or more processors 2108, system memory 2110, various different types of input-output (“I/O”) devices 2111 and 2112, and mass-storage devices 2114. Of course, the hardware level also includes many other components, including power supplies, internal communications links and busses, specialized integrated circuits, many different types of processor-controlled or microprocessor-controlled peripheral devices and controllers, and many other components. The operating system 2104 interfaces to the hardware level 2102 through a low-level operating system and hardware interface 2116 generally comprising a set of non-privileged computer instructions 2118, a set of privileged computer instructions 2120, a set of non-privileged registers and memory addresses 2122, and a set of privileged registers and memory addresses 2124. In general, the operating system exposes non-privileged instructions, non-privileged registers, and non-privileged memory addresses 2126 and a system-call interface 2128 as an operating-system interface 2130 to application programs 2132-2136 that execute within an execution environment provided to the application programs by the operating system. The operating system, alone, accesses the privileged instructions, privileged registers, and privileged memory addresses. By reserving access to privileged instructions, privileged registers, and privileged memory addresses, the operating system can ensure that application programs and other higher-level computational entities cannot interfere with one another's execution and cannot change the overall state of the computer system in ways that could deleteriously impact system operation. The operating system includes many internal components and modules, including a scheduler 2142, memory management 2144, a file system 2146, device drivers 2148, and many other components and modules. To a certain degree, modern operating systems provide numerous levels of abstraction above the hardware level, including virtual memory, which provides to each application program and other computational entities a separate, large, linear memory-address space that is mapped by the operating system to various electronic memories and mass-storage devices. The scheduler orchestrates interleaved execution of various different application programs and higher-level computational entities, providing to each application program a virtual, stand-alone system devoted entirely to the application program. From the application program's standpoint, the application program executes continuously without concern for the need to share processor resources and other system resources with other application programs and higher-level computational entities. The device drivers abstract details of hardware-component operation, allowing application programs to employ the system-call interface for transmitting and receiving data to and from communications networks, mass-storage devices, and other I/O devices and subsystems. The file system 2136 facilitates abstraction of mass-storage-device and memory resources as a high-level, easy-to-access, file-system interface. Thus, the development and evolution of the operating system has resulted in the generation of a type of multi-faceted virtual execution environment for application programs and other higher-level computational entities.

While the execution environments provided by operating systems have proved to be an enormously successful level of abstraction within computer systems, the operating-system-provided level of abstraction is nonetheless associated with difficulties and challenges for developers and users of application programs and other higher-level computational entities. One difficulty arises from the fact that there are many different operating systems that run within various different types of computer hardware. In many cases, popular application programs and computational systems are developed to run on only a subset of the available operating systems, and can therefore be executed within only a subset of the various different types of computer systems on which the operating systems are designed to run. Often, even when an application program or other computational system is ported to additional operating systems, the application program or other computational system can nonetheless run more efficiently on the operating systems for which the application program or other computational system was originally targeted. Another difficulty arises from the increasingly distributed nature of computer systems. Although distributed operating systems are the subject of considerable research and development efforts, many of the popular operating systems are designed primarily for execution on a single computer system. In many cases, it is difficult to move application programs, in real time, between the different computer systems of a distributed computer system for high-availability, fault-tolerance, and load-balancing purposes. The problems are even greater in heterogeneous distributed computer systems which include different types of hardware and devices running different types of operating systems. Operating systems continue to evolve, as a result of which certain older application programs and other computational entities may be incompatible with more recent versions of operating systems for which they are targeted, creating compatibility issues that are particularly difficult to manage in large distributed systems.

For all of these reasons, a higher level of abstraction, referred to as the “virtual machine,” has been developed and evolved to further abstract computer hardware in order to address many difficulties and challenges associated with traditional computing systems, including the compatibility issues discussed above. FIGS. 22A-B illustrate two types of virtual machine and virtual-machine execution environments. FIGS. 22A-B use the same illustration conventions as used in FIG. 21. FIG. 22A shows a first type of virtualization. The computer system 2200 in FIG. 22A includes the same hardware layer 2202 as the hardware layer 2102 shown in FIG. 21. However, rather than providing an operating system layer directly above the hardware layer, as in FIG. 21, the virtualized computing environment illustrated in FIG. 22A features a virtualization layer 2204 that interfaces through a virtualization-layer/hardware-layer interface 2206, equivalent to interface 2116 in FIG. 21, to the hardware. The virtualization layer provides a hardware-like interface 2208 to a number of virtual machines, such as virtual machine 2210, executing above the virtualization layer in a virtual-machine layer 2212. Each virtual machine includes one or more application programs or other higher-level computational entities packaged together with an operating system, referred to as a “guest operating system,” such as application 2214 and guest operating system 2216 packaged together within virtual machine 2210. Each virtual machine is thus equivalent to the operating-system layer 2104 and application-program layer 2106 in the general-purpose computer system shown in FIG. 21. Each guest operating system within a virtual machine interfaces to the virtualization-layer interface 2208 rather than to the actual hardware interface 2206. The virtualization layer partitions hardware resources into abstract virtual-hardware layers to which each guest operating system within a virtual machine interfaces. The guest operating systems within the virtual machines, in general, are unaware of the virtualization layer and operate as if they were directly accessing a true hardware interface. The virtualization layer ensures that each of the virtual machines currently executing within the virtual environment receive a fair allocation of underlying hardware resources and that all virtual machines receive sufficient resources to progress in execution. The virtualization-layer interface 2208 may differ for different guest operating systems. For example, the virtualization layer is generally able to provide virtual hardware interfaces for a variety of different types of computer hardware. This allows, as one example, a virtual machine that includes a guest operating system designed for a particular computer architecture to run on hardware of a different architecture. The number of virtual machines need not be equal to the number of physical processors or even a multiple of the number of processors.

The virtualization layer includes a virtual-machine-monitor module 2218 (“VMM”) that virtualizes physical processors in the hardware layer to create virtual processors on which each of the virtual machines executes. For execution efficiency, the virtualization layer attempts to allow virtual machines to directly execute non-privileged instructions and to directly access non-privileged registers and memory. However, when the guest operating system within a virtual machine accesses virtual privileged instructions, virtual privileged registers, and virtual privileged memory through the virtualization-layer interface 2208, the accesses result in execution of virtualization-layer code to simulate or emulate the privileged resources. The virtualization layer additionally includes a kernel module 2220 that manages memory, communications, and data-storage machine resources on behalf of executing virtual machines (“VM kernel”). The VM kernel, for example, maintains shadow page tables on each virtual machine so that hardware-level virtual-memory facilities can be used to process memory accesses. The VM kernel additionally includes routines that implement virtual communications and data-storage devices as well as device drivers that directly control the operation of underlying hardware communications and data-storage devices. Similarly, the VM kernel virtualizes various other types of I/O devices, including keyboards, optical-disk drives, and other such devices. The virtualization layer essentially schedules execution of virtual machines much like an operating system schedules execution of application programs, so that the virtual machines each execute within a complete and fully functional virtual hardware layer.

FIG. 22B illustrates a second type of virtualization. In FIG. 22B, the computer system 2240 includes the same hardware layer 2242 and software layer 2244 as the hardware layer 2102 shown in FIG. 21. Several application programs 2246 and 2248 are shown running in the execution environment provided by the operating system. In addition, a virtualization layer 2250 is also provided, in computer 2240, but, unlike the virtualization layer 2204 discussed with reference to FIG. 22A, virtualization layer 2250 is layered above the operating system 2244, referred to as the “host OS,” and uses the operating system interface to access operating-system-provided functionality as well as the hardware. The virtualization layer 2250 comprises primarily a VMM and a hardware-like interface 2252, similar to hardware-like interface 2208 in FIG. 22A. The virtualization-layer/hardware-layer interface 2252, equivalent to interface 2116 in FIG. 21, provides an execution environment for a number of virtual machines 2256-2258, each including one or more application programs or other higher-level computational entities packaged together with a guest operating system.

Dental-monitoring systems may be implemented using single PCs or servers, may be implemented in distributed computing systems, or may be implemented using cloud-computing facilities. Similarly, practitioners may communicate with a dental-monitoring system using a PC, server, or many other processor-controlled devices, including tablets, lap tops, and smart phones.

Although the present invention has been described in terms of particular embodiments, it is not intended that the invention be limited to these embodiments. Modifications within the spirit of the invention will be apparent to those skilled in the art. For example, any of many different design and implementation parameters, including operating system, hardware platform, programming language, modular organization, control structures, data structures, and other such parameters may be varied to produce various alternative implementations. As another example, the two-dimensional images acquired from patients during treatments can be obtained by using any of a wide variety of different imaging devices, including two-dimensional digital cameras, three-dimensional digital cameras, film-based cameras with digital-conversion devices, and even non-optical imaging devices.

It is appreciated that the previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A dental-treatment monitoring system comprising a computing device with a non-transitory computer-readable data-storage having instructions which can be executed by one or more processors to cause the computing device to: receive two-dimensional image data of a patient's teeth taken at a particular time during a course of dental treatment, the two-dimensional image data including associated metadata; andusing the one or more processors:compare the two-dimensional image data with a three-dimensional model representing an expected configuration of the patient's teeth at the particular time;determine a set of virtual-camera parameters that describe an estimated position and orientation of a virtual camera that produces a generated image from the three-dimensional model;determine an iteration variable N based on the metadata associated with the two-dimensional image data;iteratively modify the set of virtual-camera parameters N times to modify the generated image, wherein iterative modification includes: a first adjustment of a current set of virtual-camera parameters for the generated image;a second adjustment of the current set of virtual-camera parameters for the generated image, wherein the second adjustment includes: for each of two jaws of the patient, masking out the other of the two jaws and associated teeth from the generated image, and optimizing the set of virtual-camera parameters for the generated image with respect to a pixel-associated cost for the generated image and a next corresponding generated image;a first refinement of the current set of virtual-camera parameters for the generated image; anda second refinement of the current set of virtual-camera parameters for the generated image; andgenerate a comparison value for the two-dimensional image compared to the three-dimensional model.
2. The system of claim 1, wherein the pixel-associated cost for the generated image and the next corresponding generated image is computed as a linear combination of mutual information for the generated image and the next corresponding generated image and a sum of pixel-associated costs.
3. The system of claim 1, wherein optimizing the set of virtual-camera parameters for the generated image comprises: for each optimization iteration: generating the next corresponding generated image from the three-dimensional model of the patient's teeth using the current set of virtual-camera parameters for the generated image;computing a cost for the generated image and the next corresponding generated image; andperturbing the set of virtual-camera parameters for the generated image in a direction that minimizes the cost for the generated image and the next corresponding generated image.
4. The system of claim 1, wherein optimizing the set of virtual-camera parameters for the generated image comprises application of a Nelder-Mead downhill simplex optimization method, with seven dimensions, including three rotations, three translations, and a virtual-camera view angle.
5. The system of claim 1, wherein the first refinement of the current set of virtual-camera parameters for the generated image comprises: for each tooth group of a currently considered jaw: masking the generated image to leave the tooth group of the currently considered jaw, andoptimizing the set of virtual-camera parameters for the generated image with respect to a gradient-vector-based cost for the generated image and the next corresponding generated image.
6. The system of claim 1, wherein the first refinement of the current set of virtual-camera parameters for the generated image comprises: for each tooth group of a currently considered jaw: masking the generated image to leave the tooth group of the currently considered jaw, andoptimizing the set of virtual-camera parameters for the generated image with respect to a Laplacian-vector-based cost for the generated image and the next corresponding generated image.
7. The system of claim 1, wherein the metadata include one or more of: a text label, an indication of a standard type of view represented by the two-dimensional image, an image size, a date and time information, an indication of a camera model and make, an indication of a camera orientation, an indication of an aperture, an indication of a shutter speed, an indication of a focal length, an indication of a metering mode, and an indication of an image speed.
8. The system of claim 1, wherein the instructions further cause the computing device to determine, from the comparison value, whether a configuration of the patient's teeth is within a threshold level of correspondence to the expected configuration of the patient's teeth.
9. The system of claim 1, wherein the instructions further cause the computing device to remove teeth from the two-dimensional image that are not considered for producing the generated image.
10. The system of claim 1, wherein iteratively modifying the set of virtual-camera parameters comprises: applying a color and intensity threshold value to each pixel of the generated image;determining whether each pixel corresponds to a tooth region or a non-tooth region based on the color and intensity threshold value; andgenerating a teeth mask for the generated image.
11. The system of claim 1, wherein the instructions further cause the computing device to generate multiple comparison values for multiple two-dimensional images.
12. The system of claim 1, wherein iteratively modifying the set of virtual-camera parameters further comprises: thresholding the generated image to generate a first teeth mask;thresholding a next corresponding image generated from the three-dimensional model of the patient's teeth using the current set of virtual-camera parameters for the generated image to generate a next second corresponding teeth mask,generating a distance transform of the first teeth mask,searching over scalings, rotations, and translations of the next second corresponding teeth mask to identify a next minimum-cost overlay of the next second corresponding teeth mask over the distance transform of the first teeth mask, andadjusting the set of virtual-camera parameters for the generated image corresponding to the next minimum-cost overlay; andselecting, as an adjusted set of virtual-camera parameters for the generated image, the set of virtual-camera parameters associated with lowest-cost overlay of any of the generated next second corresponding teeth mask over the distance transform of the first teeth mask.
13. The system of claim 12, wherein a cost of an overlay of the next second corresponding teeth mask over the distance transform of the first teeth mask is a sum of distances associated with pixels in the distance transform of the first teeth mask underlying a tooth region within the next second corresponding teeth mask.
14. The system of claim 12, wherein adjusting the set of virtual-camera parameters for the generated image corresponding to the next minimum-cost overlay includes: adjusting the set of virtual-camera parameters to move a position of a center of the next corresponding image generated from a time-projected three-dimensional model of the patient's teeth;adjusting the set of virtual-camera parameters to rotate the next corresponding image generated;from the time-projected three-dimensional model of the patient's teeth in an image plane;adjusting the set of virtual-camera parameters to rotate the next corresponding image generated from the time-projected three-dimensional model of the patient's teeth about an axis parallel to the image plane; andadjusting the set of virtual-camera parameters to rescale the next corresponding image generated from the time-projected three-dimensional model of the patient's teeth.
15. A dental-treatment monitoring system comprising a computing device with a non-transitory computer-readable data-storage having instructions which can be executed by one or more processors to cause the computing device to: receive two-dimensional image data of a patient's teeth taken at a particular time during a course of dental treatment, the two-dimensional image data including associated metadata; andusing the one or more processors:compare the two-dimensional image with a three-dimensional model representing an expected configuration of the patient's teeth at the particular time; determine a set of virtual-camera parameters that describe an estimated position and orientation of a virtual camera that produces a generated image from the three-dimensional model;determine an iteration variable N based on the metadata associated with the two-dimensional image data;iteratively modify the set of virtual-camera parameters N times to modify the generated image, wherein iterative modification includes: a first adjustment of a current set of virtual-camera parameters for the generated image;a second adjustment of the current set of virtual-camera parameters for the generated image;a first refinement of the current set of virtual-camera parameters for the generated image, the first refinement including, for each tooth group of a currently considered jaw: masking the generated image to leave the tooth group of the currently considered jaw, and optimizing the set of virtual-camera parameters for the generated image with respect to a gradient-vector-based cost for the generated image and a next corresponding generated image; anda second refinement of the current set of virtual-camera parameters for the generated image; andgenerate a comparison value for the two-dimensional image compared to the three-dimensional model.
16. A dental-treatment monitoring system comprising a computing device with a non-transitory computer-readable data-storage having instructions which can be executed by one or more processors to cause the computing device to: receive two-dimensional image data of a patient's teeth taken at a particular time during a course of dental treatment, the two-dimensional image data including associated metadata; andusing the one or more processors:compare the two-dimensional image with a three-dimensional model representing an expected configuration of the patient's teeth at the particular time;determine a set of virtual-camera parameters that describe an estimated position and orientation of a virtual camera that produces a generated image from the three-dimensional model;determine an iteration variable N based on the metadata associated with the two-dimensional image data;iteratively modify the set of virtual-camera parameters N times to modify the generated image, wherein iterative modification includes: a first adjustment of a current set of virtual-camera parameters for the generated image;a second adjustment of the current set of virtual-camera parameters for the generated image, the first adjustment including, for each tooth group of a currently considered jaw: masking the generated image to leave the tooth group of the currently considered jaw, and optimizing the set of virtual-camera parameters for the generated image with respect to a Laplacian-vector-based cost for the generated image and a next corresponding generated image;a first refinement of the current set of virtual-camera parameters for the generated image; anda second refinement of the current set of virtual-camera parameters for the generated image; andgenerate a comparison value for the two-dimensional image compared to the three-dimensional model.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/831,548, filed Aug. 20, 2015, which is incorporated herein by reference in its entirety for all purposes. All publications and patent applications mentioned in this specification are herein incorporated by reference in their entirety to the same extent as if each individual publication or patent application was specifically and individually indicated to be incorporated by reference.

US Referenced Citations (538)

Number	Name	Date	Kind
2171695	Harper	Sep 1939	A
2467432	Kesling	Apr 1949	A
2531222	Kesling	Nov 1950	A
3379193	Monsghan	Apr 1968	A
3385291	Martin	May 1968	A
3407500	Kesling	Oct 1968	A
3478742	Bohlmann	Nov 1969	A
3496936	Gores	Feb 1970	A
3533163	Kirschenbaum	Oct 1970	A
3556093	Quick	Jan 1971	A
3600808	Reeve	Aug 1971	A
3660900	Andrews	May 1972	A
3683502	Wallshein	Aug 1972	A
3738005	Cohen et al.	Jun 1973	A
3860803	Levine	Jan 1975	A
3885310	Northcutt	May 1975	A
3916526	Schudy	Nov 1975	A
3922786	Lavin	Dec 1975	A
3950851	Bergersen	Apr 1976	A
3983628	Acevedo	Oct 1976	A
4014096	Dellinger	Mar 1977	A
4195046	Kesling	Mar 1980	A
4253828	Coles et al.	Mar 1981	A
4255138	Frohn	Mar 1981	A
4324546	Heitlinger et al.	Apr 1982	A
4324547	Arcan et al.	Apr 1982	A
4348178	Kurz	Sep 1982	A
4419992	Chorbajian	Dec 1983	A
4433956	Witzig	Feb 1984	A
4478580	Barrut	Oct 1984	A
4500294	Lewis	Feb 1985	A
4505673	Yoshii	Mar 1985	A
4519386	Sullivan	May 1985	A
4526540	Dellinger	Jul 1985	A
4575330	Hull	Mar 1986	A
4575805	Moermann et al.	Mar 1986	A
4591341	Andrews	May 1986	A
4609349	Cain	Sep 1986	A
4611288	Duret et al.	Sep 1986	A
4629424	Lauks et al.	Dec 1986	A
4656860	Orthuber et al.	Apr 1987	A
4663720	Duret et al.	May 1987	A
4664626	Kesling	May 1987	A
4676747	Kesling	Jun 1987	A
4755139	Abbatte et al.	Jul 1988	A
4757824	Chaumet	Jul 1988	A
4763791	Halverson et al.	Aug 1988	A
4764111	Knierim	Aug 1988	A
4793803	Martz	Dec 1988	A
4798534	Breads	Jan 1989	A
4836778	Baumrind et al.	Jun 1989	A
4837732	Brandestini et al.	Jun 1989	A
4850864	Diamond	Jul 1989	A
4850865	Napolitano	Jul 1989	A
4856991	Breads et al.	Aug 1989	A
4877398	Kesling	Oct 1989	A
4880380	Martz	Nov 1989	A
4886451	Cetlin	Dec 1989	A
4889238	Batchelor	Dec 1989	A
4890608	Steer	Jan 1990	A
4935635	O'Harra	Jun 1990	A
4936862	Walker et al.	Jun 1990	A
4937928	van der Zel	Jul 1990	A
4941826	Loran et al.	Jul 1990	A
4952928	Carroll et al.	Aug 1990	A
4964770	Steinbichler et al.	Oct 1990	A
4975052	Spencer et al.	Dec 1990	A
4983334	Adell	Jan 1991	A
4997369	Shafir	Mar 1991	A
5002485	Aagesen	Mar 1991	A
5011405	Lemchen	Apr 1991	A
5017133	Miura	May 1991	A
5027281	Rekow et al.	Jun 1991	A
5035613	Breads et al.	Jul 1991	A
5037295	Bergersen	Aug 1991	A
5055039	Abbatte et al.	Oct 1991	A
5100316	Wildman	Mar 1992	A
5103838	Yousif	Apr 1992	A
5121333	Riley et al.	Jun 1992	A
5123425	Shannon et al.	Jun 1992	A
5128870	Erdman et al.	Jul 1992	A
5130064	Smalley et al.	Jul 1992	A
5131843	Hilgers et al.	Jul 1992	A
5131844	Marinaccio et al.	Jul 1992	A
5139419	Andreiko et al.	Aug 1992	A
5145364	Martz et al.	Sep 1992	A
5176517	Truax	Jan 1993	A
5204670	Stinton	Apr 1993	A
5242304	Truax et al.	Sep 1993	A
5245592	Kuemmel et al.	Sep 1993	A
5273429	Rekow et al.	Dec 1993	A
5278756	Lemchen et al.	Jan 1994	A
5306144	Hibst et al.	Apr 1994	A
5328362	Watson et al.	Jul 1994	A
5335657	Terry et al.	Aug 1994	A
5338198	Wu et al.	Aug 1994	A
5340309	Robertson	Aug 1994	A
5342202	Deshayes	Aug 1994	A
5368478	Andreiko et al.	Nov 1994	A
5372502	Massen et al.	Dec 1994	A
D354355	Hilgers	Jan 1995	S
5382164	Stern	Jan 1995	A
5395238	Andreiko et al.	Mar 1995	A
5431562	Andreiko et al.	Jul 1995	A
5440326	Quinn	Aug 1995	A
5440496	Andersson et al.	Aug 1995	A
5447432	Andreiko et al.	Sep 1995	A
5452219	Dehoff et al.	Sep 1995	A
5454717	Andreiko et al.	Oct 1995	A
5456600	Andreiko et al.	Oct 1995	A
5474448	Andreiko et al.	Dec 1995	A
RE35169	Lemchen et al.	Mar 1996	E
5499633	Fenton	Mar 1996	A
5528735	Strasnick et al.	Jun 1996	A
5533895	Andreiko et al.	Jul 1996	A
5540732	Testerman	Jul 1996	A
5542842	Andreiko et al.	Aug 1996	A
5543780	McAuley et al.	Aug 1996	A
5549476	Stern	Aug 1996	A
5562448	Mushabac	Oct 1996	A
5570182	Nathel et al.	Oct 1996	A
5587912	Andersson et al.	Dec 1996	A
5605459	Kuroda et al.	Feb 1997	A
5607305	Andersson et al.	Mar 1997	A
5614075	Andre	Mar 1997	A
5621648	Crump	Apr 1997	A
5626537	Danyo et al.	May 1997	A
5645420	Bergersen	Jul 1997	A
5645421	Slootsky	Jul 1997	A
5651671	Seay et al.	Jul 1997	A
5655653	Chester	Aug 1997	A
5659420	Wakai et al.	Aug 1997	A
5683243	Andreiko et al.	Nov 1997	A
5683244	Truax	Nov 1997	A
5691539	Pfeiffer	Nov 1997	A
5692894	Schwartz et al.	Dec 1997	A
5725376	Poirier	Mar 1998	A
5725378	Wang	Mar 1998	A
5737084	Ishihara	Apr 1998	A
5740267	Echerer et al.	Apr 1998	A
5742700	Yoon et al.	Apr 1998	A
5769631	Williams	Jun 1998	A
5774425	Ivanov et al.	Jun 1998	A
5790242	Stern et al.	Aug 1998	A
5799100	Clarke et al.	Aug 1998	A
5800174	Andersson	Sep 1998	A
5816800	Brehm et al.	Oct 1998	A
5818587	Devaraj et al.	Oct 1998	A
5823778	Schmitt et al.	Oct 1998	A
5848115	Little et al.	Dec 1998	A
5857853	van Nifterick et al.	Jan 1999	A
5866058	Batchelder et al.	Feb 1999	A
5879158	Doyle et al.	Mar 1999	A
5880961	Crump	Mar 1999	A
5880962	Andersson et al.	Mar 1999	A
5904479	Staples	May 1999	A
5934288	Avila et al.	Aug 1999	A
5957686	Anthony	Sep 1999	A
5964587	Sato	Oct 1999	A
5971754	Sondhi et al.	Oct 1999	A
5975893	Chishti et al.	Nov 1999	A
5980246	Ramsay et al.	Nov 1999	A
5989023	Summer et al.	Nov 1999	A
6044309	Honda	Mar 2000	A
6049743	Baba	Apr 2000	A
6053731	Heckenberger	Apr 2000	A
6068482	Snow	May 2000	A
6099303	Gibbs et al.	Aug 2000	A
6099314	Kopelman et al.	Aug 2000	A
6123544	Cleary	Sep 2000	A
6152731	Jordan et al.	Nov 2000	A
6154676	Levine	Nov 2000	A
6183248	Chishti et al.	Feb 2001	B1
6186780	Hibst et al.	Feb 2001	B1
6190165	Andreiko et al.	Feb 2001	B1
6200133	Kittelsen	Mar 2001	B1
6201880	Elbaum et al.	Mar 2001	B1
6212435	Lattner et al.	Apr 2001	B1
6217334	Hultgren	Apr 2001	B1
6231338	de Josselin de Jong et al.	May 2001	B1
6239705	Glen	May 2001	B1
6243601	Wist	Jun 2001	B1
6263234	Engelhardt et al.	Jul 2001	B1
6299438	Sahagian et al.	Oct 2001	B1
6309215	Phan et al.	Oct 2001	B1
6315553	Sachdeva et al.	Nov 2001	B1
6328745	Ascherman	Dec 2001	B1
6334073	Levine	Dec 2001	B1
6350120	Sachdeva et al.	Feb 2002	B1
6364660	Durbin et al.	Apr 2002	B1
6382975	Poirier	May 2002	B1
6402510	Williams	Jun 2002	B1
6402707	Ernst	Jun 2002	B1
6405729	Thornton	Jun 2002	B1
6413086	Womack	Jul 2002	B1
6436058	Krahner et al.	Aug 2002	B1
6450167	David et al.	Sep 2002	B1
6450807	Chishti et al.	Sep 2002	B1
6482298	Bhatnagar	Nov 2002	B1
6499995	Schwartz	Dec 2002	B1
6515593	Stark et al.	Feb 2003	B1
6516805	Thornton	Feb 2003	B1
6520772	Williams	Feb 2003	B2
6524101	Phan et al.	Feb 2003	B1
6540707	Stark et al.	Apr 2003	B1
6572372	Phan et al.	Jun 2003	B1
6573998	Cohen-Sabban	Jun 2003	B2
6594539	Geng	Jul 2003	B1
6597934	de Jong et al.	Jul 2003	B1
6602070	Miller et al.	Aug 2003	B2
6611783	Kelly et al.	Aug 2003	B2
6613001	Dworkin	Sep 2003	B1
6616579	Reinbold et al.	Sep 2003	B1
6623698	Kuo	Sep 2003	B2
6624752	Klitsgaard et al.	Sep 2003	B2
6626180	Kittelsen et al.	Sep 2003	B1
6640128	Vilsmeier et al.	Oct 2003	B2
6697164	Babayoff et al.	Feb 2004	B1
6702765	Robbins et al.	Mar 2004	B2
6702804	Ritter et al.	Mar 2004	B1
6705863	Phan et al.	Mar 2004	B2
6830450	Knopp et al.	Dec 2004	B2
6832912	Mao	Dec 2004	B2
6885464	Pfeiffer et al.	Apr 2005	B1
6890285	Rahman et al.	May 2005	B2
7036514	Heck	May 2006	B2
7106233	Schroeder et al.	Sep 2006	B2
7112065	Kopelman et al.	Sep 2006	B2
7121825	Chishti et al.	Oct 2006	B2
7138640	Delgado et al.	Nov 2006	B1
7142312	Quadling et al.	Nov 2006	B2
7166063	Rahman et al.	Jan 2007	B2
7184150	Quadling et al.	Feb 2007	B2
7192273	McSurdy	Mar 2007	B2
7220124	Taub et al.	May 2007	B2
7286954	Kopelman et al.	Oct 2007	B2
7292759	Boutoussov et al.	Nov 2007	B2
7302842	Biester et al.	Dec 2007	B2
7338327	Sticker et al.	Mar 2008	B2
D565509	Fechner et al.	Apr 2008	S
7351116	Dold	Apr 2008	B2
7357637	Liechtung	Apr 2008	B2
7450231	Johs et al.	Nov 2008	B2
7458810	Bergersen	Dec 2008	B2
7460230	Johs et al.	Dec 2008	B2
7462076	Walter et al.	Dec 2008	B2
7463929	Simmons	Dec 2008	B2
7500851	Williams	Mar 2009	B2
D594413	Palka et al.	Jun 2009	S
7544103	Walter et al.	Jun 2009	B2
7553157	Abolfathi et al.	Jun 2009	B2
7561273	Stautmeister et al.	Jul 2009	B2
7577284	Wong et al.	Aug 2009	B2
7596253	Wong et al.	Sep 2009	B2
7597594	Stadler et al.	Oct 2009	B2
7609875	Liu et al.	Oct 2009	B2
D603796	Sticker et al.	Nov 2009	S
7616319	Woollam et al.	Nov 2009	B1
7626705	Altendorf	Dec 2009	B2
7632216	Rahman et al.	Dec 2009	B2
7633625	Woollam et al.	Dec 2009	B1
7637262	Bailey	Dec 2009	B2
7668355	Wong et al.	Feb 2010	B2
7670179	Müller	Mar 2010	B2
7695327	Bäuerle et al.	Apr 2010	B2
7698068	Babayoff	Apr 2010	B2
7724378	Babayoff	May 2010	B2
D618619	Walter	Jun 2010	S
7731508	Borst	Jun 2010	B2
7735217	Borst	Jun 2010	B2
7780460	Walter	Aug 2010	B2
7787132	Körner et al.	Aug 2010	B2
7791810	Powell	Sep 2010	B2
7796243	Choo-Smith et al.	Sep 2010	B2
7806727	Dold et al.	Oct 2010	B2
7813787	de Josselin de Jong et al.	Oct 2010	B2
7824180	Abolfathi et al.	Nov 2010	B2
7828601	Pyczak	Nov 2010	B2
7845969	Stadler et al.	Dec 2010	B2
7854609	Chen et al.	Dec 2010	B2
7862336	Kopelman et al.	Jan 2011	B2
7872760	Ertl	Jan 2011	B2
7874836	McSurdy	Jan 2011	B2
7878801	Abolfathi et al.	Feb 2011	B2
7907280	Johs et al.	Mar 2011	B2
7929151	Liang et al.	Apr 2011	B2
7947508	Tricca et al.	May 2011	B2
7959308	Freeman et al.	Jun 2011	B2
7963766	Cronauer	Jun 2011	B2
7986415	Thiel et al.	Jul 2011	B2
8017891	Nevin	Sep 2011	B2
8026916	Wen	Sep 2011	B2
8027709	Arnone et al.	Sep 2011	B2
7874849	Sticker et al.	Nov 2011	B2
8054556	Chen et al.	Nov 2011	B2
8070490	Roetzer et al.	Dec 2011	B1
8077949	Liang et al.	Dec 2011	B2
8083556	Stadler et al.	Dec 2011	B2
D652799	Mueller	Jan 2012	S
8108189	Chelnokov et al.	Jan 2012	B2
8118592	Tortorici	Feb 2012	B2
8126025	Takeda	Feb 2012	B2
8144954	Quadling et al.	Mar 2012	B2
8160334	Thiel et al.	Apr 2012	B2
8201560	Dembro	Jun 2012	B2
8215312	Garabadian et al.	Jul 2012	B2
8240018	Walter et al.	Aug 2012	B2
8279450	Oota et al.	Oct 2012	B2
8292617	Brandt et al.	Oct 2012	B2
8294657	Kim et al.	Oct 2012	B2
8296952	Greenberg	Oct 2012	B2
8297286	Smernoff	Oct 2012	B2
8306608	Mandelis et al.	Nov 2012	B2
8314764	Kim et al.	Nov 2012	B2
8332015	Ertl	Dec 2012	B2
8354588	Sticker et al.	Jan 2013	B2
8366479	Borst et al.	Feb 2013	B2
8465280	Sachdeva et al.	Jun 2013	B2
8477320	Stock et al.	Jul 2013	B2
8488113	Thiel et al.	Jul 2013	B2
8520922	Wang et al.	Aug 2013	B2
8520925	Duret et al.	Aug 2013	B2
8556625	Lovely	Oct 2013	B2
8570530	Liang	Oct 2013	B2
8573224	Thornton	Nov 2013	B2
8577212	Thiel	Nov 2013	B2
8650586	Lee et al.	Feb 2014	B2
8675706	Seurin et al.	Mar 2014	B2
8723029	Pyczak et al.	May 2014	B2
8743923	Geske et al.	Jun 2014	B2
8767270	Curry et al.	Jul 2014	B2
8768016	Pan et al.	Jul 2014	B2
8771149	Rahman et al.	Jul 2014	B2
8839476	Adachi	Sep 2014	B2
8870566	Bergersen	Oct 2014	B2
8878905	Fisker et al.	Nov 2014	B2
8896592	Boltunov et al.	Nov 2014	B2
8899976	Chen et al.	Dec 2014	B2
8936463	Mason et al.	Jan 2015	B2
8948482	Levin	Feb 2015	B2
8956058	Rösch	Feb 2015	B2
8992216	Karazivan	Mar 2015	B2
9022792	Sticker et al.	May 2015	B2
9039418	Rubbert	May 2015	B1
9084535	Girkin et al.	Jul 2015	B2
9108338	Sirovskiy et al.	Aug 2015	B2
9144512	Wagner	Sep 2015	B2
9192305	Levin	Nov 2015	B2
9204952	Lampalzer	Dec 2015	B2
9242118	Brawn	Jan 2016	B2
9261358	Atiya et al.	Feb 2016	B2
9336336	Deichmann et al.	May 2016	B2
9351810	Moon	May 2016	B2
9375300	Matov et al.	Jun 2016	B2
9408743	Wagner	Aug 2016	B1
9433476	Khardekar et al.	Sep 2016	B2
9439568	Atiya et al.	Sep 2016	B2
9444981	Bellis et al.	Sep 2016	B2
9463287	Lorberbaum et al.	Oct 2016	B1
9500635	Islam	Nov 2016	B2
9506808	Jeon et al.	Nov 2016	B2
9545331	Ingemarsson-Matzen	Jan 2017	B2
9584771	Mandelis et al.	Feb 2017	B2
9675430	Verker et al.	Jun 2017	B2
9693839	Atiya et al.	Jul 2017	B2
9744006	Ross	Aug 2017	B2
9861451	Davis	Jan 2018	B1
9936186	Jesenko et al.	Apr 2018	B2
10007987	Braunston	Jun 2018	B1
10076389	Wu	Sep 2018	B2
10123706	Elbaz et al.	Nov 2018	B2
10159541	Bindayel	Dec 2018	B2
10248883	Borovinskih et al.	Apr 2019	B2
10449016	Kimura et al.	Oct 2019	B2
10470847	Shanjani et al.	Nov 2019	B2
10485638	Salah	Nov 2019	B2
10504386	Levin et al.	Dec 2019	B2
10517482	Sato et al.	Dec 2019	B2
10528636	Elbaz et al.	Jan 2020	B2
20010038705	Rubbert et al.	Nov 2001	A1
20020010568	Rubbert et al.	Jan 2002	A1
20020015934	Rubbert et al.	Feb 2002	A1
20030009252	Pavlovskaia et al.	Jan 2003	A1
20030035061	Iwaki et al.	Feb 2003	A1
20030139834	Nikolskiy et al.	Jul 2003	A1
20030190575	Hilliard	Oct 2003	A1
20030207224	Lotte	Nov 2003	A1
20030224311	Cronauer	Dec 2003	A1
20040009449	Mah et al.	Jan 2004	A1
20040019262	Perelgut	Jan 2004	A1
20040058295	Bergersen	Mar 2004	A1
20040094165	Cook	May 2004	A1
20040158194	Wolff et al.	Aug 2004	A1
20040167646	Jelonek et al.	Aug 2004	A1
20040197727	Sachdeva	Oct 2004	A1
20050023356	Wiklof et al.	Feb 2005	A1
20050031196	Moghaddam et al.	Feb 2005	A1
20050037312	Uchida	Feb 2005	A1
20050048433	Hilliard	Mar 2005	A1
20050100333	Kerschbaumer et al.	May 2005	A1
20050181333	Karazivan et al.	Aug 2005	A1
20050186524	Abolfathi et al.	Aug 2005	A1
20050244781	Abels et al.	Nov 2005	A1
20060084024	Farrell	Apr 2006	A1
20060099546	Bergersen	May 2006	A1
20060154198	Durbin et al.	Jul 2006	A1
20060188144	Sasaki	Aug 2006	A1
20060223032	Fried et al.	Oct 2006	A1
20060223342	Borst et al.	Oct 2006	A1
20060234179	Wen et al.	Oct 2006	A1
20070046865	Umeda et al.	Mar 2007	A1
20070053048	Kumar et al.	Mar 2007	A1
20070087300	Willison et al.	Apr 2007	A1
20070106138	Beiski et al.	May 2007	A1
20070184402	Boutoussov et al.	Aug 2007	A1
20070231765	Phan et al.	Oct 2007	A1
20070238065	Sherwood et al.	Oct 2007	A1
20080045053	Stadler et al.	Feb 2008	A1
20080057461	Cheng et al.	Mar 2008	A1
20080090208	Rubbert	Apr 2008	A1
20080115791	Heine	May 2008	A1
20080176448	Muller et al.	Jul 2008	A1
20080242144	Dietz	Oct 2008	A1
20080253651	Sagawa	Oct 2008	A1
20090030347	Cao	Jan 2009	A1
20090040740	Muller et al.	Feb 2009	A1
20090061379	Yamamoto et al.	Mar 2009	A1
20090061381	Durbin et al.	Mar 2009	A1
20090075228	Kumada et al.	Mar 2009	A1
20090210032	Beiski et al.	Aug 2009	A1
20090218514	Klunder et al.	Sep 2009	A1
20090298017	Boerjes et al.	Dec 2009	A1
20090305540	Stadler et al.	Dec 2009	A1
20100019170	Hart et al.	Jan 2010	A1
20100045902	Ikeda et al.	Feb 2010	A1
20100145898	Malfliet et al.	Jun 2010	A1
20100152599	DuHamel et al.	Jun 2010	A1
20100165275	Tsukamoto et al.	Jul 2010	A1
20100167225	Kuo	Jul 2010	A1
20100214289	Xiao	Aug 2010	A1
20100231577	Kim et al.	Sep 2010	A1
20100312484	DuHamel et al.	Dec 2010	A1
20110012901	Kaplanyan	Jan 2011	A1
20110081625	Fuh	Apr 2011	A1
20110102549	Takahashi	May 2011	A1
20110102566	Zakian et al.	May 2011	A1
20110143673	Landesman et al.	Jun 2011	A1
20110235045	Koerner et al.	Sep 2011	A1
20110269092	Kuo et al.	Nov 2011	A1
20110316994	Lemchen	Dec 2011	A1
20120081786	Mizuyama et al.	Apr 2012	A1
20120086681	Kim et al.	Apr 2012	A1
20120129117	McCance	May 2012	A1
20120147912	Moench et al.	Jun 2012	A1
20120172678	Logan et al.	Jul 2012	A1
20120281293	Gronenborn et al.	Nov 2012	A1
20120295216	Dykes et al.	Nov 2012	A1
20120322025	Ozawa et al.	Dec 2012	A1
20130089828	Borovinskih et al.	Apr 2013	A1
20130095446	Andreiko et al.	Apr 2013	A1
20130103176	Kopelman et al.	Apr 2013	A1
20130110469	Kopelman	May 2013	A1
20130163627	Seurin et al.	Jun 2013	A1
20130201488	Ishihara	Aug 2013	A1
20130235165	Gharib et al.	Sep 2013	A1
20130252195	Popat	Sep 2013	A1
20130266326	Joseph et al.	Oct 2013	A1
20130280671	Brawn et al.	Oct 2013	A1
20130286174	Urakabe	Oct 2013	A1
20130293824	Yoneyama et al.	Nov 2013	A1
20130323664	Parker	Dec 2013	A1
20130323671	Dillon et al.	Dec 2013	A1
20130323674	Hakomori et al.	Dec 2013	A1
20130337412	Kwon	Dec 2013	A1
20130345491	Saitoh	Dec 2013	A1
20140081091	Abolfathi et al.	Mar 2014	A1
20140122027	Andreiko et al.	May 2014	A1
20140272774	Dillon et al.	Sep 2014	A1
20140294273	Jaisson	Oct 2014	A1
20140313299	Gebhardt et al.	Oct 2014	A1
20140329194	Sachdeva et al.	Nov 2014	A1
20140363778	Parker	Dec 2014	A1
20150002649	Nowak et al.	Jan 2015	A1
20150079531	Heine	Mar 2015	A1
20150140502	Brawn et al.	May 2015	A1
20150164335	Van Der Poel et al.	Jun 2015	A1
20150173856	Iowe et al.	Jun 2015	A1
20150178908	Jesenko	Jun 2015	A1
20150209118	Kopelman	Jul 2015	A1
20150230885	Wucher	Aug 2015	A1
20150238280	Wu et al.	Aug 2015	A1
20150238283	Tanugula et al.	Aug 2015	A1
20150306486	Logan et al.	Oct 2015	A1
20150320320	Kopelman et al.	Nov 2015	A1
20150325044	Lebovitz	Nov 2015	A1
20150338209	Knüttel	Nov 2015	A1
20160000332	Atiya et al.	Jan 2016	A1
20160003610	Lampert et al.	Jan 2016	A1
20160051345	Levin	Feb 2016	A1
20160064898	Atiya et al.	Mar 2016	A1
20160067013	Morton et al.	Mar 2016	A1
20160081768	Kopelman et al.	Mar 2016	A1
20160135924	Choi et al.	May 2016	A1
20160135925	Mason et al.	May 2016	A1
20160163115	Furst	Jun 2016	A1
20160210500	Feng	Jul 2016	A1
20160228213	Tod et al.	Aug 2016	A1
20160242871	Morton et al.	Aug 2016	A1
20160246936	Kahn	Aug 2016	A1
20160296303	Parker	Oct 2016	A1
20160328843	Graham et al.	Nov 2016	A1
20170007366	Kopelman et al.	Jan 2017	A1
20170007367	Li et al.	Jan 2017	A1
20170156821	Kopelman et al.	Jun 2017	A1
20170215739	Miyasato	Aug 2017	A1
20170265970	Verker	Sep 2017	A1
20170325690	Salah et al.	Nov 2017	A1
20170340411	Akselrod	Nov 2017	A1
20180000565	Shanjani et al.	Jan 2018	A1
20180028064	Elbaz et al.	Feb 2018	A1
20180055602	Kopelman et al.	Mar 2018	A1
20180125610	Carrier et al.	May 2018	A1
20180153648	Shanjani et al.	Jun 2018	A1
20180153649	Wu et al.	Jun 2018	A1
20180153733	Kuo	Jun 2018	A1
20180192877	Atiya et al.	Jul 2018	A1
20180280118	Cramer	Oct 2018	A1
20180284727	Cramer et al.	Oct 2018	A1
20180296080	Glinec	Oct 2018	A1
20180353264	Riley et al.	Dec 2018	A1
20180360567	Xue et al.	Dec 2018	A1
20180368961	Shanjani et al.	Dec 2018	A1
20190019187	Miller et al.	Jan 2019	A1
20190021817	Sato et al.	Jan 2019	A1
20190029784	Moalem et al.	Jan 2019	A1
20190076214	Nyukhtikov et al.	Mar 2019	A1
20190105130	Grove et al.	Apr 2019	A1
20190313963	Hillen	Oct 2019	A1

Foreign Referenced Citations (76)

Number	Date	Country
517102	Nov 1977	AU
3031677	Nov 1977	AU
1121955	Apr 1982	CA
2749802	May 1978	DE
69327661	Jul 2000	DE
102005043627	Mar 2007	DE
202010017014	Mar 2011	DE
102011051443	Jan 2013	DE
102014225457	Jun 2016	DE
0428152	May 1991	EP
490848	Jun 1992	EP
541500	May 1993	EP
714632	May 1997	EP
774933	Dec 2000	EP
731673	May 2001	EP
1941843	Jul 2008	EP
2437027	Apr 2012	EP
2447754	May 2012	EP
1989764	Jul 2012	EP
2332221	Nov 2012	EP
2596553	Dec 2013	EP
2612300	Feb 2015	EP
2848229	Mar 2015	EP
463897	Jan 1980	ES
2455066	Apr 2014	ES
2369828	Jun 1978	FR
2930334	Oct 2009	FR
1550777	Aug 1979	GB
53-058191	May 1978	JP
04-028359	Jan 1992	JP
08-508174	Sep 1996	JP
2007260158	Oct 2007	JP
2008523370	Jul 2008	JP
04184427	Nov 2008	JP
2009000412	Jan 2009	JP
2009018173	Jan 2009	JP
2009205330	Sep 2009	JP
2011087733	May 2011	JP
2013007645	Jan 2013	JP
201735173	Feb 2017	JP
10-1266966	May 2013	KR
10-2016-041632	Apr 2016	KR
10-2016-0071127	Jun 2016	KR
WO91004713	Apr 1991	WO
WO94010935	May 1994	WO
WO98032394	Jul 1998	WO
WO98044865	Oct 1998	WO
WO02017776	Mar 2002	WO
WO02062252	Aug 2002	WO
WO02095475	Nov 2002	WO
WO03003932	Jan 2003	WO
WO2006096558	Sep 2006	WO
WO2006133548	Dec 2006	WO
WO2009085752	Jul 2009	WO
WO2009089129	Jul 2009	WO
WO2009146788	Dec 2009	WO
WO2009146789	Dec 2009	WO
WO2010123892	Oct 2010	WO
WO2012007003	Jan 2012	WO
WO2012064684	May 2012	WO
WO2012074304	Jun 2012	WO
WO2013058879	Apr 2013	WO
WO2014068107	May 2014	WO
WO2014091865	Jun 2014	WO
WO2015015289	Feb 2015	WO
WO2015063032	May 2015	WO
WO2015112638	Jul 2015	WO
WO2015176004	Nov 2015	WO
WO2016004415	Jan 2016	WO
WO2016042393	Mar 2016	WO
WO2016061279	Apr 2016	WO
WO2016084066	Jun 2016	WO
WO2016099471	Jun 2016	WO
WO2016113745	Jul 2016	WO
WO2016116874	Jul 2016	WO
WO2017006176	Jan 2017	WO

Non-Patent Literature Citations (186)

Entry
US 8,553,966 B1, 10/2013, Alpern et al. (withdrawn)
AADR. American Association for Dental Research; Summary of Activities; Los Angeles, CA; p. 195; Mar. 20-23,(year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1980.
Alcaniz et aL; An Advanced System for the Simulation and Planning of Orthodontic Treatments; Karl Heinz Hohne and Ron Kikinis (eds.), Visualization in Biomedical Computing. 4th Intl. Conf, VBC '96, Hamburg, Germany; Springer-Verlag; pp. 511-520; Sep. 22-25, 1996.
Alexander et al.; The DigiGraph Work Station Part 2 Clinical Management; J. Clin. Orthod.; pp. 402-407; (Author Manuscript); Jul. 1990.
Align Technology; Align technology announces new teen solution with introduction of invisalign teen with mandibular advancement; 2 pages; retrieved from the internet (http://investor.aligntech.com/static-files/eb4fa6bb-3e62-404f-b74d-32050366a01b); Mar. 6, 2017.
Allesee Orthodontic Appliance: Important Tip About Wearing the Red White & Blue Active Clear Retainer System; Allesee Orthodontic Appliances—Pro Lab; 1 page; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 1998.
Allesee Orthodontic Appliances: DuraClearTM; Product information; 1 page; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1997.
Allesee Orthodontic Appliances; The Choice is Clear: Red, White & Blue . . . The Simple, Affordable, No-Braces Treatment; (product information for doctors); retrieved from the internet (http://ormco.com/aoa/appliancesservices/RWB/doctorhtml); 5 pages on May 19, 2003.
Allesee Orthodontic Appliances; The Choice is Clear: Red, White & Blue . . . The Simple, Affordable, No-Braces Treatment; (product information), 6 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 2003.
Allesee Orthodontic Appliances; The Choice is Clear: Red, White & Blue . . . The Simple, Affordable, No-Braces Treatment;(Patient Information); retrieved from the internet (http://ormco.com/aoa/appliancesservices/RWB/patients.html); 2 pages on May 19, 2003.
Allesee Orthodontic Appliances; The Red, White & Blue Way to Improve Your Smile; (information for patients), 2 pages, (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1992.
Allesee Orthodontic Appliances; You may be a candidate for this invisible no-braces treatment; product information for patients; 2 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 2002.
Altshuler et al.; Analysts, of 3-D Data for Comparative 3-D Serial Growth Pattern Studies of Oral-Facial Structures; AADR Abstracts, Program and Abstracts of Papers, 57th General Session. IADR Annual Session, Mar. 29, 1979-Apr. 1, 1979, New Orleans Marriot; Journal of Dental Research; vol. 58, Special Issue A, p. 221; Jan. 1979.
Altschuler et al.; Laser Electro-Optic System for Rapid Three-Dimensional (3D) Topographic Mapping of Surfaces; Optical Engineering; 20(6); pp. 953-961; Dec. 1981.
Altschuler et al.; Measuring Surfaces Space-Coded by a Laser Projected Dot Matrix; SPIE Imaging q Applications for Automated Industrial Inspection and Assembly; vol. 182; pp. 187-191; Oct. 10, 1979.
Altschuler; 3D Mapping of Maxillo-Facial Prosthesis; AADR Abstract #607; 2 pages total, (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1980.
Andersson et al.; Clinical Results with Titanium Crowns Fabricated with Machine Duplication and Spark Erosion; Acta Odontologica Scandinavica; 47(5); pp. 279-286; Oct. 1989.
Andrews, The Six Keys to Optimal Occlusion Straight Wire, Chapter 3, L.A. Wells; pp. 13-24; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1989.
Barone et al.; Creation of 3D mufti-body orthodontic models by using independent imaging sensors; Sensors; 13(2); pp. 2033-2050; Feb. 5, 2013.
Bartels et al.; An Introduction to Splines for Use in Computer Graphics and Geometric Modeling; Morgan Kaufmann Publishers; pp. 422-425 Jan. 1, 1987.
Baumrind et al, “Mapping the Skull in 3-D,” reprinted from J. Calif. Dent. Assoc, 48(2), 11 pages; (year of pub. sufficientiy earlier than effective US filing date and any foreign priority date) Fall Issue 1972.
Baumrind et al.; A Stereophotogrammetric System for the Detection of Prosthesis Loosening in Total Hip Arthroplasty; NATO Symposium on Applications of Human Biostereometrics; SPIE; vol. 166; pp. 112-123; Jul. 9-13, 1978.
Baumrind; A System for Cranio facial Mapping Through the integration of Data from Stereo X-Ray Films and Stereo Photographs; an invited paper submitted to the 1975 American Society of Photogram Symposium on Close-Range Photogram Systems; University of Illinois; pp. 142-166; Aug. 26-30, 1975.
Baumrind; Integrated Three-Dimensional Craniofacial Mapping: Background, Principles, and Perspectives; Seminars in Orthodontics; 7(4); pp. 223-232; Dec. 2001.
Begole et al.; A Computer System for the Analysis of Dental Casts; The Angle Orthodontist; 51(3); pp. 252-258; Jul. 1981.
Bernard et al; Computerized Diagnosis in Orthodontics for Epidemiological Studies: A ProgressReport; (Abstract Only), J. Dental Res. Special Issue, vol. 67, p. 169, paper presented at International Association for Dental Research 66th General Session, Montreal Canada; Mar. 9-13, 1988.
Bhatia et al.; A Computer-Aided Design for Orthognathic Surgery; British Journal of Oral and Maxillofacial Surgery; 22(4); pp. 237-253; Aug. 1, 1984.
Biggerstaff et al.; Computerized Analysis of Occlusion in the Postcanine Dentition; American Journal of Orthodontics; 61(3); pp. 245-254; Mar. 1972.
Biggerstaff; Computerized Diagnostic Setups and Simulations; Angle Orthodontist; 40(I); pp. 28-36; Jan. 1970.
Biostar Operation & Training Manual. Great Lakes Orthodontics, Ltd. 199 Fire Tower Drive,Tonewanda, New York. 14150-5890, 20 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1990.
Blu et al.; Linear interpolation revitalized; IEEE Transactions on Image Processing; 13(5); pp. 710-719: May 2004.
Bourke, Coordinate System Transformation; 1 page; retrived from the internet (http://astronomy.swin.edu.au/' pbourke/prolection/coords) on Nov. 5, 2004; Jun. 1996.
Boyd et al.; Three Dimensional Diagnosis and Orthodontic Treatment of Complex Malocclusions With the Invisalipn Appliance; Seminars in Orthodontics; 7(4); pp. 274-293; Dec. 2001.
Brandestini et al.; Computer Machined Ceramic Inlays: In Vitro Marginal Adaptation; J. Dent, Res. Special Issue; (Abstract 305); vol. 64: p. 208; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1985.
Brook et al.; An Image Analysis System for the Determination of Tooth Dimensions from Study Casts; Comparison with Manual Measurements of Mesio-distal Diameter; Journal of Dental Research; 65(3); pp. 428-431; Mar. 1986.
Burstone et al.; Precision Adjustment of the Transpalatal Lingual Arch: Computer Arch Form Predetermination; American Journal of Orthodontics; 79(2);pp. 115-133; Feb. 1981.
Burstone; Dr. Charles J. Burstone on The Uses of the Computer in Orthodontic Practice (Part 1); Journal of Clinical Orthodontics; 13(7); pp. 442-453; (interview); Jul. 1979.
Burstone; Dr. Charles J. Burstone on The Uses of the Computer in Orthodontic Practice (Part 2); journal of Clinical Orthodontics; 13(8); pp. 539-551 (interview); Aug. 1979.
Cardinal Industrial Finishes; Powder Coatings; 6 pages; retrieved from he internet (http://www.cardinalpaint.com) on Aug. 25, 2000.
Carnaghan, An Alternative to Holograms for the Portrayal of Human Teeth; 4th Int'l. Conf. on Holographic Systems, Components and Applications; pp. 228-231; Sep. 15, 1993.
Chaconas et al,; The DigiGraph Work Station, Part 1, Basic Concepts; Journal of Clinical Orthodontics; 24(6); pp. 360-367; (Author Manuscript); Jun. 1990.
Chafetz et al.; Subsidence of the Femoral Prosthesis, A Stereophotogrammetric Evaluation; Clinical Orthopaedics and Related Research; No. 201; pp. 60-67; Dec. 1985.
Chiappone; Constructing the Gnathologic Setup and Positioner; Journal of Clinical Orthodontics; 14(2); pp. 121-133; Feb. 1980
Chishti et al.; U.S. Appl. No. 60/050,342 entitled “Procedure for moving teeth using a seires of retainers,” filed Jun. 20, 1997.
Cottingham; Gnathologic Clear Plastic Positioner; American Journal of Orthodontics; 55(1); pp. 23-31; Jan. 1969.
Crawford; CAD/CAM in the Dental Office; Does It Work?; Canadian Dental Journal; 57(2); pp. 121-123 Feb. 1991.
Crawford; Computers in Dentistry: Part 1: CAD/CAM: The Computer Moves Chairside, Part 2:F. Duret A Man With a Vision, Part 3: The Computer Gives New Vision—Literally, Part 4: Bytes 'N Bites The Computer Moves From the Front Desk to the Operatory: Canadian Dental Journal; 54(9); pp. 661-666 Sep. 1988.
Crooks; CAD/CAM Comes to USC; USC Dentistry; pp. 14-17; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) Spring 1990.
CSI Computerized Scanning and Imaging Facility; What is a maximum/minimum intensity projection (MIP/MiniP); 1 page; retrived from the internet (http://csi.whoi.edu/content/what-maximumminimum-intensity-projection-mipminip); Jan. 4, 2010.
Cureton; Correcting Malaligned Mandibular Incisors with Removable Retainers; Journal of Clinical Orthodontics; 30(7); pp. 390-395; Jul. 1996.
Curry et al.; Integrated Three-Dimensional Craniofacial Mapping at the Craniofacial Research InstrumentationLaboratory/University of the Pacific; Seminars in Orthodontics; 7(4); pp. 258-265; Dec. 2001.
Cutting et al.; Three-Dimensional Computer-Assisted Design of Craniofacial Surgical Procedures: Optimization and Interaction with Cephalometric and CT-Based Models; Plastic and Reconstructive Surgery; 77(6); pp. 877-885; Jun. 1986.
DCS Dental AG; The CAD/CAM ‘DCS Titan System’ for Production of Crowns/Bridges; DSC Production; pp. 1-7; Jan. 1992.
Defranco et al.; Three-Dimensional Large Displacement Analysis of Orthodontic Appliances; Journal of Biomechanics; 9(12); pp. 793-801; Jan. 1976.
Dental Institute University of Zurich Switzerland; Program for International Symposium on Computer Restorations: State of the Art of the CEREC-Method; 2 pages; May 1991.
Dentrac Corporation; Dentrac document; pp. 4-13; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1992.
Dent-X; Dentsim . . . Dent-x's virtual reality 3-D training simulator . . . A revolution in dental education; 6 pages; retrieved from the internet (http://www.dent-x.com/DentSim.htm); on Sep. 24, 1998.
Di Muzio et al.; Minimum intensity projection (MinIP); 6 pages; retrieved from the internet (https://radiopaedia.org/articles/minimum-intensity-projection-minip) on Sep. 6, 2018.
Doruk et al.; The role of the headgear timer in extraoral co-operation; European Journal of Orthodontics; 26; pp. 289-291; Jun. 1, 2004.
Doyle; Digital Dentistry; Computer Graphics World; pp. 50-52 andp. 54; Oct. 2000.
Dummer et al.; Computed Radiography Imaging Based on High-Density 670 nm VCSEL Arrays; International Society for Optics and Photonics; vol. 7557; p. 75570H, 7 pages; (Author Manuscript); Feb. 24, 2010.
Duret et al.; CAD/CAM Imaging in Dentistry; Current Opinion in Dentistry; 1(2); pp. 150-154; Apr. 1991.
Duret et al; CAD-CAM in Dentistry; Journal of the American Dental Association; 117(6); pp. 715-720; Nov. 1988.
Duret; The Dental CAD/CAM, General Description of the Project; Hennson International Product Brochure, 18 pages; Jan. 1986.
Duret; Vers Une Prosthese Informatisee; Tonus; 75(15); pp. 55-57; (English translation attached); 23 pages; Nov. 15, 1985.
Economides; The Microcomputer in the Orthodontic Office; Journal of Clinical Orthodontics; 13(11); pp. 767-772; Nov. 1979.
Ellias et al.; Proteomic analysis of saliva identifies potential biomarkers for orthodontic tooth movement; The Scientific World Journal; vol. 2012; Article ID 647240; dio:10.1100/2012/647240; 7 pages; Jul. 2012.
Elsasser; Some Observations on the History and Uses of the Kesling Positioner; American Journal of Orthodontics; 36(5); pp. 368-374; May 1, 1950.
English translation of Japanese Laid-Open Publication No. 63-11148 to inventor T. Ozukuri (Laid-Open on Jan. 18, 1998) pp. 1-7.
Faber et al.; Computerized Interactive Orthodontic Treatment Planning; American Journal of Orthodontics; 73(1); pp. 36-46; Jan. 1978.
Felton et al.; A Computerized Analysis of the Shape and Stability of Mandibular Arch Form; American Journal of Orthodontics and Dentofacial Orthopedics; 92(6); pp. 478-483; Dec. 1987.
Florez-Moreno; Time-related changes in salivary levels of the osteotropic factors SRANKL and OPG through orthodontic tooth movement; American Journal of Orthodontics and Dentofacial Orthopedics; 143(1); pp. 92-100; Jan. 2013.
Friede et al.; Accuracy of Cephalometric Prediction in Orthognathic Surgery; Journal of Oral and Maxillofacial Surgery; 45(9); pp. 754-760; Sep. 1987.
Friedrich et al; Measuring system for in vivo recording of force systems in orthodontic treatment-concept and analysis of accuracy; J. Biomech.; 32(1); pp. 81-85; (Abstract Only) Jan. 1999.
Futterling et al.; Automated Finite Element Modeling of a Human Mandible with Dental Implants, JS WSCG '98—Conference Program; 8 pages; retrieved from the Internet (https://dspace5.zcu.cz/bitstream/11025/15851/1/Strasser_98.pdf); on Aug. 21, 2013.
Gao et al ; 3-D element Generation for Multi-Connected Complex Dental and Mandibular Structure; IEEE Proceedings International Workshop in Medical Imaging and Augmented Reality; pp. 267-271; Jun. 12, 2001.
Gim-Alldent Deutschland, “Das DUX System: Die Technik,” 3 pages; (English Translation included); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 2002.
Gottleib et al.; JCO Interviews Dr. James A. McNamura, Jr., on the Frankel Appliance: Part 2: Clinical 1-1 Management; Journal of Clinical Orthodontics; 16(6); pp. 390-407; retrieved from the internet (http://www.jco-online.com/archive/print_article.asp?Year=1982&Month=06&ArticleNum+); 21 pages; Jun. 1982.
Grayson; New Methods for Three Dimensional Analysis of Craniofacial Deformity, Symposium: Computerized Facial Imaging in Oral and Maxillofacial Surgery; American Association of Oral and Maxillofacial Surgeons; 48(8) suppl 1; pp. 5-6; Sep. 13, 1990.
Grest, Daniel; Marker-Free Human Motion Capture in Dynamic Cluttered Environments from a Single View-Point, PhD Thesis; 171 pages; Dec. 2007.
Guess et al.; Computer Treatment Estimates in Orthodontics and Orthognathic Surgery; Journal of Clinical Orthodontics; 23(4); pp. 262-268; 11 pages; (Author Manuscript); Apr. 1989.
Heaven et al.; Computer-Based Image Analysis of Artificial Root Surface Caries; Abstracts of Papers #2094; Journal of Dental Research; 70:528; (Abstract Only); Apr. 17-21, 1991.
Highbeam Research; Simulating stress put on jaw. (ANSYS Inc.'s finite element analysis software); 2 pages; retrieved from the Internet (http://static.highbeam.com/t/toolingampproduction/november011996/simuiatingstressputonfa . . . ); on Nov. 5, 2004.
Hikage; Integrated Orthodontic Management System for Virtual Three-Dimensional Computer Graphic Simulation and Optical Video Image Database tor Diagnosis and Treatment Planning: Journal of Japan KA Orthodontic Society; 46(2); pp. 248-269; 56 pages; (English Translation Included); Feb. 1967.
Hoffmann et al.; Role of Cephalometry for Planning of Jaw Orthopedics and Jaw Surgery Procedures; Informatbnen, pp. 375-396; (English Abstract Included); Mar. 1991.
Hojjatie et al.; Three-Dimensional Finite Element Analysis of Glass-Ceramic Dental Crowns; Journal of Biomechanics; 23(11); pp. 1157-1166; Jan. 1990.
Huckins; CAD-CAM Generated Mandibular Model Prototype from MRI Data; AAOMS, p. 96; (Abstract Only); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1999.
Invisalign; You were made to move. There's never been a better time to straighten your teeth with the most advanced clear aligner in the wood; Product webpage; 2 pages; retrieved from the internet (www.invisalign.com/) on Dec. 28. 2017.
JCO Interviews; Craig Andreiko , DDS, MS on the Elan and Orthos Systems; Interview by Dr. Larry W. White; Journal of Clinical Orthodontics; 26(8); pp. 459-468; 14 pages; (Author Manuscript); Aug. 1994.
JCO Interviews; Dr. Homer W. Phillips on Computers in Orthodontic Practice, Part 2; Journal of Clinical Orthodontics; 17(12); pp. 819-831; 19 pages; (Author Manuscript); Dec. 1983.
Jerrold; The Problem, Electronic Data Transmission and the Law; American Journal of Orthodontics and Dentofacial Orthopedics; 113(4); pp. 478-479; 5 pages; (Author Manuscript); Apr. 1998.
Jones et al.; An Assessment of the Fit of a Parabolic CuiNe to Pre- and Post-Treatment Dental Arches; British Journal of Orthodontics; 16(2); pp. 85-93; May 1989.
Kamada et.al.; Case Reports on Tooth Positioners Using LTV Vinyl Silicone Rubber; J. Nihon University School of Dentistry; 26(1); pp. 11-29; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1984.
Kamada et.al.; Construction of Tooth Positioners with LTV Vinyl Silicone Rubber and Some Case KJ Reports: J. Nihon University School of Dentistry; 24(1); pp. 1-27; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1982.
Kanazawa et al.; Three-Dimensional Measurements of the Occlusal Surfaces of Upper Molars in a Dutch Population; Journal of Dental Research; 63(11); pp. 1298-1301; Nov. 1984.
Kesling et al.; The Philosophy of the Tooth Positioning Appliance; American Journal of Orthodontics and Oral surgery; 31(6); pp. 297-304; Jun. 1945.
Kesling; Coordinating the Predetermined Pattern and Tooth Positioner with Conventional Treatment; American Journal of Orthodontics and Oral Surgery; 32(5); pp. 285-293; May 1946.
Kleeman et al.; The Speed Positioner; J. Clin. Orthod.; 30(12); pp. 673-680; Dec. 1996.
Kochanek; Interpolating Splines with Local Tension, Continuity and Bias Control; Computer Graphics; 18(3); pp. 33-41; Jan. 1, 1984.
Kumar et al.; Rapid maxillary expansion: A unique treatment modality in dentistry; J. Clin. Diagn. Res.; 5(4); pp. 906-911; Aug. 2011.
Kunii et al.; Articulation Simulation for an Intelligent Dental Care System; Displays; 15(3); pp. 181-188; Jul. 1994.
Kuroda et al.; Three-Dimensional Dental Cast Analyzing System Using Laser Scanning; American Journal of Orthodontics and Dentofacial Orthopedics; 110(4); pp. 365-369; Oct. 1996.
Laurendeau et al.; A Computer-Vision Technique for the Acquisition and Processing of 3-D Profiles of 7 Dental Imprints: An Application in Orthodontics; IEEE Transactions on Medical Imaging; 10(3); pp. 453-461; Sep. 1991.
Leinfelder et al.; A New Method for Generating Ceramic Restorations: a CAD-CAM System; Journal of the American Dental Association; 118(6); pp. 703-707; Jun. 1989.
Manetti et al.; Computer-Aided Cefalometry and New Mechanics in Orthodontics; Fortschr Kieferorthop; 44; pp. 370-376; 8 pages; (English Article Summary Included); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1983.
McCann; Inside the ADA; J. Amer. Dent. Assoc, 118:286-294; Mar. 1989.
McNamara et al.; Invisible Retainers; J. Clin Orthod.; pp. 570-578; 11 pages; (Author Manuscript); Aug. 1985.
McNamara et al.; Orthodontic and Orthopedic Treatment in the Mixed Dentition; Needham Press; pp. 347-353; Jan. 1993.
Moermann et al, Computer Machined Adhesive Porcelain Inlays: Margin Adaptation after Fatigue Stress; IADR Abstract 339; J. Dent. Res.; 66(a):763; (Abstract Only); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1987.
Moles; Correcting Mild Malalignments—As Easy As One, Two, Three; AOA/Pro Corner; 11(2); 2 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 2002.
Mormann et al.; Marginale Adaptation von adhasuven Porzellaninlays in vitro; Separatdruck aus:Schweiz. Mschr. Zahnmed.; 95; pp. 1118-1129; 8 pages; (Machine Translated English Abstract); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 1985.
Nahoum; The Vacuum Formed Dental Contour Appliance; N. Y., State Dent. J.; 30(9); pp. 385-390; Nov. 1964.
Nash; CEREC CAD/CAM Inlays: Aesthetics and Durability in a Single Appointment; Dentistry Today; 9(8); pp. 20, 22-23 and 54; Oct. 1990.
Nedelcu et al.; “Scanning Accuracy and Precision in 4 Intraoral Scanners: An In Vitro Comparison Based on 3-Dimensional Analysis”; J. Prosthet. Dent.; 112(6); pp. 1461-1471; Dec. 2014.
Nishiyama et al.; A New Construction of Tooth Repositioner by LTV Vinyl Silicone Rubber; The Journal of Nihon University School of Dentistry; 19(2): pp. 93-102 (year of pub. sufficientiy earlier than effective US filing date and any foreign priority date) 1977.
Ogawa et al.; Mapping, profiling and clustering of pressure pain threshold (PPT) in edentulous oral muscosa; Journal of Dentistry; 32(3); pp. 219-228; Mar. 2004.
Ogimoto et al.; Pressure-pain threshold determination in the oral mucosa; Journal of Oral Rehabilitation; 29(7); pp. 620-626; Jul. 2002.
Paul et al.; Digital Documentation of Individual Human Jaw and Tooth Forms for Applications in Orthodontics; Oral Surgery and Forensic Medicine Proc. of the 24th Annual Conf. of the IEEE Industrial Electronics Society (IECON '98); vol. 4; pp. 2415-2418; Sep. 4, 1998.
Pinkham; Foolish Concept Propels Technology; Dentist, 3 pages , Jan./Feb. 1989.
Pinkham; Inventor's CAD/CAM May Transform Dentistry; Dentist; pp. 1 and 35, Sep. 1990.
Ponitz; Invisible retainers; Am. J. Orthod.; 59(3); pp. 266-272; Mar. 1971.
Procera Research Projects; Procera Research Projects 1993 Abstract Collection; 23 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1993.
Proffit et al.; The first stage of comprehensive treatment afignment and leveling; Contemporary Orthodontics, 3rd Ed.; Chapter 16: Mosby Inc.; pp. 534-537; (year of pub. suificientiy earlier than effective US filing date and any foreign priority date) 2000.
Proffit et al.; The first stage of comprehensive treatment: alignment and leveling; Contemporary Orthodontics; (Second Ed.); Chapter 15, MosbyYear Book; St. Louis, Missouri; pp. 470-533 Oct. 1993.
Raintree Essix & ARS Materials, Inc., Raintree Essix, Technical Magazine Table of contents and Essix Appliances, 7 pages; retrieved from the internet (http://www.essix.com/magazine/defaulthtml) on Aug. 13, 1997.
Redmond et al.; Clinical Implications of Digital Orthodontics; American Journal of Orthodontics and Dentofacial Orthopedics; 117(2); pp. 240-242; Feb. 2000.
Rekow et al.; CAD/CAM for Dental Restorations—Some of the Curious Challenges; IEEE Transactions on Biomedical Engineering; 38(4); pp. 314-318; Apr. 1991.
Rekow et al.; Comparison of Three Data Acquisition Techniques for 3-D Tooth Surface Mapping; Annual International Conference of the IEEE Engineering in Medicine and Biology Society; 13(1); pp. 344-345 (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1991.
Rekow; A Review of the Developments in Dental CAD/CAM Systems; Opinion in Dentistry; 2; pp. 25-33; Jun. 1992.
Rekow; CAD/CAM in Dentistry: A Historical Perspective and View of the Future; Journal Canadian Dental Association; 58(4); pp. 283, 287-288; Apr. 1992.
Rekow; Computer-Aided Design and Manufacturing in Dentistry; A Review of the State of the Art; Journal of Prosthetic Dentistry; 58(4); pp. 512-516; Dec. 1987.
Rekow: Dental CAD-CAM Systems: What is the State of the Art?: The Journal of the American Dental Association; 122(12); pp. 43-48; Dec. 1991.
Rekow; Feasibility of an Automated System for Production of Dental Restorations, Ph.D, Thesis; Univ. of Minnesota, 250 pages, Nov. 1988.
Richmond et al.; The Development of the PAR Index (Peer Assessment Rating): Reliability and Validity.; The European Journal of Orthodontics; 14(2); pp. 125-139; Apr. 1992.
Richmond et al.; The Development of a 3D Cast Analysis System; British Journal of Orthodontics; 13(1); pp. 53-54; Jan. 1986.
Richmond; Recording the Dental Cast in Three Dimensions; American Journal of Orthodontics and Dentofacial Orthopedics; 92(3); pp. 199-206; Sep. 1987.
Rudge; Dental Arch Analysis: Arch Form, A Review of the Literature; The European Journal of Orthodontics; 3(4); pp. 279-284; Jan. 1981.
Sahm et al.; “Micro-Electronic Monitoring of Functional Appliance Wear”;Eur J Orthod.; 12(3); pp. 297-301; Aug. 1990.
Sahm; Presentation of a wear timer for the clarification of scientific questions in orthodontic orthopedics; Fortschritte der Kieferorthopadie; 51 (4); pp. 243-247; (Translation Included) Jul. 1990.
Sakuda et al.; integrated Information—Processing System in Clinical Orthodontics: An Approach with Use of a Computer Network System; American Journal of Orthodontics and Dentofacial Orthopedics; 101(3); pp. 210-220; 20 pages; (Author Manuscript) Mar. 1992.
Schafer et al.; “Quantifying patient adherence during active orthodontic treatment with removable appliances using microelectronic wear-time documentation”; Eur J Orthod.; 37(1)pp. 1-8; doi:10.1093/ejo/cju012; Jul. 3, 2014.
Schellhas et al.; Three-Dimensional Computed Tomography in Maxillofacial Surgical Planning; Archives of Otolaryngology—Head and Neck Surgery; 114(4); pp. 438-442; Apr. 1988.
Schroeder et al; Eds. The Visual Tooikit. Prentice Hall PTR, New Jersey; Chapters 6, 8 & 9, (pp. 153-210,300-354, and 355-428; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1998.
Shilliday; Minimizing finishing problems with the mini-positioner; American Journal of Orthodontics; 59(6); pp. 596-599; Jun. 1971.
Shimada et al.; Application of optical coherence tomography (OCT) for diagnosis of caries, cracks, and defects of restorations; Current Oral Health Reports; 2(2); pp. 73-80; Jun. 2015.
Siemens; CEREC—Computer-Reconstruction, High Tech in der Zahnmedizin; 15 pages; (Includes Machine Translation); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 2004.
Sinclair; The Readers' Corner; Journal of Clinical Orthodontics; 26(6); pp. 369-372; 5 pages; retrived from the internet (http://www.jco-online.com/archive/print_article.asp?Year=1992&Month=06&ArticleNum=); Jun. 1992.
Stoll et al.; Computer-aided Technologies in Dentistry; Dtsch Zahna'rztl Z 45, pp. 314-322; (English Abstract included); (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1990.
Sturman; Interactive Keyframe Animation of 3-D Articulated Models; Proceedings Graphics Interface '84; vol. 86; pp. 35-40; May-Jun. 1984.
The American Heritage, Stedman's Medical Dictionary; Gingiva; 3 pages; retrieved from the interent(http://reference.com/search/search?q=gingiva) on Nov. 5, 2004.
The Dental Company Sirona: Cerc omnicam and cerec bluecam brochure: The first choice in every case; 8 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 2014.
Thera Mon; “Microsensor”; 2 pages; retrieved from the internet (www.english.thera-mon.com/the-product/transponder/index.html); on Sep. 19, 2016.
Thorlabs; Pellin broca prisms; 1 page; retrieved from the internet (www.thorlabs.com); Nov. 30, 2012.
Tiziani et al.; Confocal principle for macro and microscopic surface and defect analysis; Optical Engineering; 39(1); pp. 32-39; Jan. 1, 2000.
Truax; Truax Clasp-Less(TM) Appliance System; The Functional Orthodontist; 9(5); pp. 22-24, 26-28; Sep.-Oct. 1992.
Tru-Tatn Orthodontic & Dental Supplies, Product Brochure, Rochester, Minnesota 55902; 16 pages; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date) 1996.
U.S. Department of Commerce, National Technical Information Service, Holodontography: An Introduction to Dental Laser Holography; School of Aerospace Medicine Brooks AFB Tex; Mar. 1973, 40 pages; Mar. 1973.
U.S. Department of Commerce, National Technical Information Service; Automated Crown Replication Using Solid Photography SM; Solid Photography Inc., Melville NY,; 20 pages; Oct. 1977.
Vadapalli; Minimum intensity projection (MinIP) is a data visualization; 7 pages; retrieved from the internet (https://prezi.com/tdmttnmv2knw/minimum-intensity-projection-minip-is-a-data-visualization/) on Sep. 6, 2018.
Van Der Linden et al.; Three-Dimensional Analysis of Dental Casts by Means of the Optocom; Journal of Dental Research; 51(4); p. 1100; Jul.-Aug. 1972.
Van Der Linden; A New Method to Determine Tooth Positions and Dental Arch Dimensions; Journal of Dental Research; 51(4); p. 1104; Jul.-Aug. 1972.
Van Der Zel; Ceramic-Fused-to-Metal Restorations With a New CAD/CAM System; Quintessence International; 24(A); pp. 769-778; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 1993.
Van Hilsen et al.; Comparing potential early caries assessment methods for teledentistry; BMC Oral Health; 13(16); doi: 10.1186/1472-6831-13-16; 9 pages; Mar. 2013.
Varady et al.; Reverse Engineering of Geometric Models An Introduction; Computer-Aided Design; 29(4); pp. 255-268; 20 pages; (Author Manuscript); Apr. 1997.
Verstreken et al.; An Image-Guided Planning System for Endosseous Oral Implants; IEEE Transactions on Medical Imaging; 17(5); pp. 842-852; Oct. 1998.
Warunek et al.; Physical and Mechanical Properties of Elastomers in Orthodonic Positioners; American Journal of Orthodontics and Dentofacial Orthopedics; 95(5); pp. 388-400; 21 pages; (Author Manuscript); May 1989.
Warunek et.al.; Clinical Use of Silicone Elastomer Applicances; JCO; 23(10); pp. 694-700; Oct. 1989.
Watson et al.; Pressures recorded at te denture base-mucosal surface interface in complete denture wearers; Journal of Oral Rehabilitation 14(6); pp. 575-589; Nov. 1987.
Wells; Application of the Positioner Appliance in Orthodontic Treatment; American Journal of Orthodontics; 58(4); pp. 351-366; Oct. 1970.
Wikipedia; Palatal expansion; 3 pages; retrieved from the internet (https://en.wikipedia.org/wiki/Palatal_expansion) on Mar. 5, 2018.
Williams; Dentistry and CAD/CAM: Another French Revolution; J. Dent. Practice Admin.; 4(1); pp. 2-5 Jan./Mar. 1987.
Williams; The Switzerland and Minnesota Developments in CAD/CAM; Journal of Dental Practice Administration; 4(2); pp. 50-55; Apr./Jun. 1987.
Wireless Sensor Networks Magazine; Embedded Teeth for Oral Activity Recognition; 2 pages; retrieved on Sep. 19, 2016 from the internet (www.wsnmagazine.com/embedded-teeth/); Jul. 29, 2013.
Wishan; New Advances in Personal Computer Applications for Cephalometric Analysis, Growth Prediction, Surgical Treatment Planning and Imaging Processing; Symposium: Computerized Facial Imaging in Oral and Maxilofacial Surgery; p. 5; Presented on Sep. 13, 1990.
Witt et al.; The wear-timing measuring device in orthodontics-oui bono? Reflections on the state-of-the-art in wear-timing measurement and compliance research in orthodontics; Portschr Kieferorthop.; 52(3); pp. 117-125; (Translation included) Jun. 1991.
Wolf; Three-dimensional structure determination of semi-transparent objects from holographic data; Optics Communications; 1(4); pp. 153-156; Sep. 1969.
WSCG'98—Conference Program, The Sixth international Conference in Central Europe on Computer Graphics and Visualization '98; pp. 1-7; retrieved from the Internet on Nov. 5, 2004, (http://wscg.zcu.cz/wscg98/wscg98.htm); Feb. 9-13, 1998.
Xia et al.; Three-Dimensional Virtual-Reality Surgical Planning and Soft-Tissue Prediction for Orthognathic Surgery; IEEE Transactions on Information Technology in Biomedicine; 5(2); pp. 97-107; Jun. 2001.
Yamada et al.; Simulation of fan-beam type optical computed-tomography imaging of strongly scattering and weakly absorbing media; Applied Optics; 32(25); pp. 4808-4814, Sep. 1, 1993.
Yamamoto et al.; Optical Measurement of Dental Cast Profile and Application to Analysis of Three-Dimensional Tooth Movement in Orthodontics; Front. Med. Biol. Eng., 1(2); pp. 119-130; (year of pub. sufficiently earlier than effective US filing date and any foreign priority date); 1988.
Yamamoto et al.; Three-Dimensional Measurement of Dental Cast Profiles and Its Applications to Orthodontics; Conf. Proc. IEEE Eng. Med. Biol. Soc.; 12(5); pp. 2052-2053; Nov. 1990.
Yamany et al.; A System for Human Jaw Modeling using Intra-Oral Images: Proc. of the 20th Annual Conf. of the IEEE Engineering in Medicine and Biology Society; vol. 2; pp. 563-566; Oct. 1998.
Yoshii; Research on a New Orthodontic Appliance: The Dynamic Positioner (D.P.); 111. The General Concept of the D.P. Method and Its Therapeutic Effect, Part 1, Dental and Functional Reversed Occlusion Case Reports; Nippon Dental Review; 457; pp. 146-164; 43 pages; (Author Manuscript); Nov. 1980.
Yoshii; Research on a New Orthodontic Appliance: The Dynamic Positioner (D.P.); I. The D.P. Concept and Implementation of Transparent Silicone Resin (Orthocon); Nippon Dental Review; 452; pp. 61-74; 32 pages; (Author Manuscript); Jun. 1980.
Yoshii; Research on a New Orthodontic Appliance: The Dynamic Positioner (D.P.); II. The D.P. Manufacturing Procedure and Clinical Applications; Nippon Dental Review; 454; pp. 107-130; 48 pages; (Author Manuscript); Aug. 1980.
Yoshii; Research on a New Orthodontic Appliance: The Dynamic Positioner (D.P.); III—The General Concept of the D.P. Method and Its Therapeutic Effect, Part 2 Skeletal Reversed Occlusion Case Reports; Nippon Dental Review; 458; pp. 112-129; 40 pages; (Author Manuscript); Dec. 1980.

Related Publications (1)

	Number	Date	Country
	20190228255 A1	Jul 2019	US

Continuations (1)

	Number	Date	Country
Parent	14831548	Aug 2015	US
Child	16370788		US

Photograph-based assessment of dental treatments and procedures

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

International Classifications

Disclaimer

Abstract