← Back to Patent Explorer
US5995650A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for rapid shaped digitizing and adaptive mesh generation

Assignee: Andreas Acquisition LLC
•
Filing: 1998-07-21
•
Granted: 1999-11-30
•
Expires: 2018-07-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract System and method for rapid collection of data points and construction of a computer model based on a multi-resolution mesh to describe the surface contours and color of an object. The system collects data by projecting shapes of light against the object and collecting (from a position of triangulation relative to the light projector) images of the light as it reflects from the object. The system and method of the present invention are comprised of a multiple laser stripe generation process to project a number of light shapes against the object, the collection of one or more reflected laser stripes in a single image of an images collector to gather sufficient information to reproduce points on the surface of the object.

Inventors

  • 👤 Alexander A. Migdal
  • 👤 Michael Petrov
  • 👤 Alexei Lebedev

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 22:05
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/50; H04N19/597; G; G01; G01B; G01B11/00; G01B11/24; G01B11/25; G01B11/2518; G01J; G01J3/00; G01J3/46; G06; G06T; G06T7/00; G06T7/50; G06T7/521; G06T9/00; G06T9/001; H04N13/00; H04N13/10; H04N13/189; H04N13/194; H04N13/20; H04N13/204; H04N13/207; H04N13/239; H04N13/243; H04N13/246; H04N13/254; H04N13/296; B; B33; B33Y; B33Y50/00; G01J3/50; G01J3/51; G06T2207/00; G06T2207/10; G06T2207/10024; H04N13/106; H04N13/15; H04N13/257; H04N2013/0074; H04N2013/0077; H04N2013/0081; H04N2013/0096

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 226 words
A computer system for use with a 3-D scanning system, said 3-D scanning system scanning an object using a light stripe which is positioned at a plurality of positions on said object corresponding to a plurality of discrete angles of approach of said stripe of light from said 3-D scanning system on said object, said 3-D scanning system generating signals representative of two-dimensional coordinate points corresponding to scanned points on said object, said computer system being coupled to said 3-D scanning system and receiving said signals representative of two-dimensional coordinate points, said computer system comprising: means for calculating a depth coordinate for each two-dimensional coordinate scanned point on said object using said corresponding discrete angle of approach of said light stripe from said 3-D scanning system onto said object; means for generating a geometric model of said scanned object, said geometric-model-generating means examining a first set and a second set of three-dimensional coordinates of scanned points on said object corresponding to two adjacent discrete angles of approach of said light stripe, wherein said geometric-model-generating means sequentially connects, for each given three-dimensional coordinate point in one of said first and second sets, at least said given three-dimensional coordinate point, a closest three-dimensional coordinate point in one of said first and second sets and a second closest three-dimensional coordinate point in one of said first and second sets.
Claim 2
Dependent Claim 226 words
A computer system for use with a 3-D scanning system, said 3-D scanning system scanning an object using a light stripe which is positioned at a plurality of positions on said object corresponding to a plurality of discrete angles of approach of said stripe of light from said 3-D scanning system on said object, said 3-D scanning system generating signals representative of two-dimensional coordinate points corresponding to scanned points on said object, said computer system being coupled to said 3-D scanning system and receiving said signals representative of two-dimensional coordinate points, said computer system comprising: means for calculating a depth coordinate for each two-dimensional coordinate scanned point on said object using said corresponding discrete angle of approach of said light stripe from said 3-D scanning system onto said object; means for generating a geometric model of said scanned object, said geometric-model-generating means examining a first set and a second set of three-dimensional coordinates of scanned points on said object corresponding to two adjacent discrete angles of approach of said light stripe, wherein said geometric-model-generating means sequentially connects, for each given three-dimensional coordinate point in one of said first and second sets, at least said given three-dimensional coordinate point, a closest three-dimensional coordinate point in one of said first and second sets and a second closest three-dimensional coordinate point in one of said first and second sets.
Claim 3
Dependent Claim 76 words
The computer system according to claim 1, wherein said geometric-model-generating means sequentially connects, for each given three-dimensional coordinate point in one of said first and second sets, at least said given three-dimensional coordinate point, a closest three-dimensional coordinate point in one of said first and second sets, a second closest three-dimensional coordinate point in one of said first and second sets, and a third closest three-dimensional coordinate point in one of said first and second sets.
Claim 4
Independent Claim 101 words
A method of generating by means of a computer a 3-dimensional geometric model of an object based on three-dimensional coordinate points representing a profile of said object, which method comprises: for each three-dimensional coordinate point in a first set and a second set of three-dimensional coordinate points corresponding to two adjacent profile lines of said object, determining at least two closest three-dimensional coordinate points in said first and second sets; and for each given three-dimensional coordinate point in said first set and said second set, sequentially connecting at least said given three-dimensional coordinate point and said two closest three-dimensional coordinate points.
Claim 5
Independent Claim 101 words
A method of generating by means of a computer a 3-dimensional geometric model of an object based on three-dimensional coordinate points representing a profile of said object, which method comprises: for each three-dimensional coordinate point in a first set and a second set of three-dimensional coordinate points corresponding to two adjacent profile lines of said object, determining at least two closest three-dimensional coordinate points in said first and second sets; and for each given three-dimensional coordinate point in said first set and said second set, sequentially connecting at least said given three-dimensional coordinate point and said two closest three-dimensional coordinate points.
Claim 6
Dependent Claim 53 words
The method according to claim 3, wherein said first step comprises determining, for said each three-dimensional coordinate point, at least three closest three-dimensional coordinate points in said first and second sets, and wherein said second step comprises sequentially connecting at least said given three-dimensional coordinate point and said three closest three-dimensional coordinate points.
Claim 7
Independent Claim 340 words
A method of generating by means of a computer a 3-dimensional geometric model of an object based on a plurality of sets of three-dimensional coordinate points representing a profile of said object, each of said sets of three-dimensional coordinate points representing a profile line of said profile of said object, which method comprises: (a) determining a first end point and a second end point for each of said sets of three-dimensional coordinate points; (b) for each of said sets of three-dimensional coordinate points, determining whether a perpendicular distance from a first line connecting said first and second end points to a three-dimensional coordinate point farthest from said first line exceeds a first predetermined value; (c) for each of said sets of three-dimensional coordinate points, determining whether a length of said first line connecting said first and second end points exceeds a second predetermined value; (d) for each of said sets of three-dimensional coordinate points, designating said three-dimensional coordinate point farthest from said first line connecting said first and second end points to be included in a simplified subset of three-dimensional coordinate points to be used in generating said 3-dimensional geometric model of said object, if condition of one of step (b) and step (c) is satisfied; (e) for each of said sets of three-dimensional coordinate points, grouping constituent three-dimensional coordinate points into two groups, a first group defined by said first end point and said three-dimensional coordinate point farthest from said first line, and a second group defined by said three-dimensional coordinate point farthest from said first line and said second end point; (f) for each of said sets of three-dimensional coordinate points, repeating steps (b) through (d) for said first group and said second group; (g) for each of said sets of three-dimensional coordinate points, recursively repeating steps (e) and (f) until a third predetermined number of three-dimensional coordinate points of each set have been examined; and (h) generating said 3-dimensional geometric model of said object based on three-dimensional coordinate points of said simplified subset of three-dimensional coordinate points.
Claim 8
Independent Claim 340 words
A method of generating by means of a computer a 3-dimensional geometric model of an object based on a plurality of sets of three-dimensional coordinate points representing a profile of said object, each of said sets of three-dimensional coordinate points representing a profile line of said profile of said object, which method comprises: (a) determining a first end point and a second end point for each of said sets of three-dimensional coordinate points; (b) for each of said sets of three-dimensional coordinate points, determining whether a perpendicular distance from a first line connecting said first and second end points to a three-dimensional coordinate point farthest from said first line exceeds a first predetermined value; (c) for each of said sets of three-dimensional coordinate points, determining whether a length of said first line connecting said first and second end points exceeds a second predetermined value; (d) for each of said sets of three-dimensional coordinate points, designating said three-dimensional coordinate point farthest from said first line connecting said first and second end points to be included in a simplified subset of three-dimensional coordinate points to be used in generating said 3-dimensional geometric model of said object, if condition of one of step (b) and step (c) is satisfied; (e) for each of said sets of three-dimensional coordinate points, grouping constituent three-dimensional coordinate points into two groups, a first group defined by said first end point and said three-dimensional coordinate point farthest from said first line, and a second group defined by said three-dimensional coordinate point farthest from said first line and said second end point; (f) for each of said sets of three-dimensional coordinate points, repeating steps (b) through (d) for said first group and said second group; (g) for each of said sets of three-dimensional coordinate points, recursively repeating steps (e) and (f) until a third predetermined number of three-dimensional coordinate points of each set have been examined; and (h) generating said 3-dimensional geometric model of said object based on three-dimensional coordinate points of said simplified subset of three-dimensional coordinate points.
Claim 9
Dependent Claim 33 words
The method according to claim 5, wherein said second predetermined number corresponds to an average distance between a set of three-dimensional coordinate points being examined and two adjacent sets of three-dimensional coordinate points.
Claim 10
Dependent Claim 28 words
The method according to claim 6, wherein said third predetermined number corresponds to the number of three-dimensional coordinate points in the set of three-dimensional coordinate points being examined.
Claim 11
Dependent Claim 84 words
The method according to claim 5, wherein said step (h) comprises substeps of: for each three-dimensional coordinate point in a first set and a second set of three-dimensional coordinate points corresponding to two adjacent profile lines of said object, determining at least two closest three-dimensional coordinate points in said first and second sets; and for each given three-dimensional coordinate point in said first set and said second set, sequentially connecting at least said given three-dimensional coordinate point and said two closest three-dimensional coordinate points.
Claim 12
Dependent Claim 53 words
The method according to claim 8, wherein said first substep comprises determining, for said each three-dimensional coordinate point, at least three closest three-dimensional coordinate points in said first and second sets, and wherein said second substep comprises sequentially connecting at least said given three-dimensional coordinate point and said three closest three-dimensional coordinate points.
Claim 13
Independent Claim 292 words
A method of computerized calibration of a 3-D scanning system which scans an object using a light stripe which is positioned at a plurality of positions on said object corresponding to a plurality of discrete angles of approach of said stripe of light from said 3-D scanning system on said object, said angles of approach being determined by rotation of a light deflection device about a rotation axis, said 3-D scanning system capturing images of said stripe of light as reflected from said object using an image-capturing device having a focal distance z, a plane of said stripe of light being described by the equation (n.r)=1, where n is a first 3-D vector representing said stripe of light at a first angle of approach and r represents a point on said object being scanned by said stripe of light, said 3-D scanning system generating signals representative of two-dimensional coordinate points corresponding to scanned points on said object, said 3-D scanning system having a computer associated therewith, said computer receiving said signals representative of two-dimensional coordinate points and calculating three-dimensional coordinate points representative profile of said object, said method comprising: scanning a reference surface to obtain a plurality of reference 3-D coordinate points; and minimizing a target function F, where F=sum{((m.r)-1).sup.2 }, wherein said sum encompasses said plurality of reference 3-D coordinate points, and wherein parameters z, n 0 , n u , and m are determined from said target function F, where m is a second 3-D vector to be determined by said target function, n 0 is an initial 3-D vector corresponding to zero angle of approach of said light stripe on said object, and n u is a unit 3-D vector of said rotation axis of said light deflection device.
Claim 14
Independent Claim 292 words
A method of computerized calibration of a 3-D scanning system which scans an object using a light stripe which is positioned at a plurality of positions on said object corresponding to a plurality of discrete angles of approach of said stripe of light from said 3-D scanning system on said object, said angles of approach being determined by rotation of a light deflection device about a rotation axis, said 3-D scanning system capturing images of said stripe of light as reflected from said object using an image-capturing device having a focal distance z, a plane of said stripe of light being described by the equation (n.r)=1, where n is a first 3-D vector representing said stripe of light at a first angle of approach and r represents a point on said object being scanned by said stripe of light, said 3-D scanning system generating signals representative of two-dimensional coordinate points corresponding to scanned points on said object, said 3-D scanning system having a computer associated therewith, said computer receiving said signals representative of two-dimensional coordinate points and calculating three-dimensional coordinate points representative profile of said object, said method comprising: scanning a reference surface to obtain a plurality of reference 3-D coordinate points; and minimizing a target function F, where F=sum{((m.r)-1).sup.2 }, wherein said sum encompasses said plurality of reference 3-D coordinate points, and wherein parameters z, n 0 , n u , and m are determined from said target function F, where m is a second 3-D vector to be determined by said target function, n 0 is an initial 3-D vector corresponding to zero angle of approach of said light stripe on said object, and n u is a unit 3-D vector of said rotation axis of said light deflection device.

References Cited (Backward Citations)

US4653104A Cited
US4982438A Cited
US5671395A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-11-29 2003-05-31 2003-11-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-11-29 2007-05-31 2007-11-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-11-29 2011-05-31 2011-11-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag