US5633995A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Camera system and methods for extracting 3D model of viewed object
Assignee: Lockheed Martin Corp
•
Filing: 1996-03-18
•
Granted: 1997-05-27
•
Expires: 2016-03-18
Abstract
Abstract A system for extracting a three-dimensional model of an object viewed in a selected scene, includes at least one camera for acquiring scene information, each from a different spatial-temporal aspect of the total scene. A digitizer converts the scene video and directional information to digital data, for at least temporary storage in a mass memory associated with a computer for data processing. An interactive display provides a means by which a human operator can view the stored scene information and select at least one scene object for which the computer will extract a 3D model, for subsequent use by a designated output device.
Inventors
- 👤 Richard A. McClain
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 20:50
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/10
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
266 words
A system for generating data representative of a three-dimensional object from a plurality of views of a scene including said object, and for displaying a view of said scene, said system comprising: camera means for generating plural views of said scene, for generating data representative of said scene; display and selection means coupled for receiving said data representative of said scene, for generating a display of said plural views, and for receiving, and converting into data, user inputs relating to the locations of vertices associated with said object, the identification of faces of said object associated with said vertices, and geometric constraints including, where applicable, line lengths, line directions, line parallelism, and point or vertex coincidence, for thereby generating user-processed scene data, said user inputs being subject to errors so that, in said user-processed scene data, the locations of said vertices and lines may not exactly correspond among said views; processing means coupled to said camera means and to said display and selection means, for (a) processing said user-processed scene data by means of a dependency graph to reduce the number of said geometric constraints, (b) combining all said user-processed scene data relating to parameters of said scene and object into a single vector, and forming a single likelihood function from said vector, which likelihood function includes the locations and parameters of said camera means; (c) optimizing said likelihood function to obtain optimized data representing the most likely combination of said camera, vertex and line locations and parameters; and display means coupled for receiving said optimized data, for displaying a two-dimensional representation of said three-dimensional object.
Claim 2
Independent Claim
266 words
A system for generating data representative of a three-dimensional object from a plurality of views of a scene including said object, and for displaying a view of said scene, said system comprising: camera means for generating plural views of said scene, for generating data representative of said scene; display and selection means coupled for receiving said data representative of said scene, for generating a display of said plural views, and for receiving, and converting into data, user inputs relating to the locations of vertices associated with said object, the identification of faces of said object associated with said vertices, and geometric constraints including, where applicable, line lengths, line directions, line parallelism, and point or vertex coincidence, for thereby generating user-processed scene data, said user inputs being subject to errors so that, in said user-processed scene data, the locations of said vertices and lines may not exactly correspond among said views; processing means coupled to said camera means and to said display and selection means, for (a) processing said user-processed scene data by means of a dependency graph to reduce the number of said geometric constraints, (b) combining all said user-processed scene data relating to parameters of said scene and object into a single vector, and forming a single likelihood function from said vector, which likelihood function includes the locations and parameters of said camera means; (c) optimizing said likelihood function to obtain optimized data representing the most likely combination of said camera, vertex and line locations and parameters; and display means coupled for receiving said optimized data, for displaying a two-dimensional representation of said three-dimensional object.
Claim 3
Dependent Claim
30 words
The system of claim 1, wherein said camera means includes means for obtaining a plurality m of substantially simultaneous different images, each of a different spatial aspect of said scene.
Claim 4
Dependent Claim
93 words
The system of claim 1, wherein said processing means is adapted to: retrieve from storage data representative of (a) topological structure, (b) constraints, and (c) vertex designation; receive information from the user selecting at least one object to establish a base object frame for the object to be extracted; create an acyclic dependency graph from a structure graph and the received constraint information; initialize unknowns in the dependency graph to form a trial solution thereof; and iteratively operating on and improving the dependency graph until a best sequentially constrained dependency graph is obtained.
Claim 5
Dependent Claim
18 words
The system of claim 3, wherein said processing means synthesizes said structure graph from the retrieved topological data.
Claim 6
Dependent Claim
65 words
The system of claim 3, wherein said processing means interacts with said display means to allow the user to select the at least one constraint from the group consisting of: vertex point, line direction, line length and coincidence of a selected one of a vertex, line or face of a first object with a selected one of a vertex, line or face of another object.
Claim 7
Dependent Claim
37 words
The system of claim 3, wherein said processing means provides to at least one object within said scene, other than said selected object, an object frame spatially situated at a location dependent upon said base object frame.
Claim 8
Dependent Claim
25 words
The system of claim 3, wherein said processing means establishes the totality of constraints as a consistent whole within a set of predetermined initability conditions.
Claim 9
Dependent Claim
31 words
The system of claim 7, wherein said processing means further limits the totality of constraints, to generate said dependency graph in the form of a single ordered list of scene elements.
Claim 10
Dependent Claim
39 words
The system of claim 8, wherein said processing means generates said single ordered element list by presorting said scene elements into a top-down sorted first network, and sorting said first network into a bottom-up sorted network of scene elements.
Claim 11
Dependent Claim
25 words
The system of claim 3, wherein said processing means performs said iterative improvement by use of a selected one of Gauss-Newton and Levenberg-Marquardt iteration algorithms.
Claim 12
Independent Claim
170 words
A method for extracting a three-dimensional model of an object in a selected scene, comprising the steps of: acquiring, from a plurality of spatial-temporal views, each of which spatial-temporal views is associated with a viewing site, digital data representing at least that portion of the scene containing the object to be extracted, said digital data not including information relating to the location of at least one of said viewing sites; at least temporarily storing the acquired digital scene information data; displaying to a system user selected scenic information to allow the user to select from the displayed data a feature of the object to be extracted; processing a constrained least-squares optimization of at least the stored digital data for the feature selected via the display, to obtain a set of solution data describing the most likely location of said selected object based upon the most likely locations of said viewing sites; and storing the solution data set to provide output data for at least a display of the extracted object.
Claim 13
Independent Claim
170 words
A method for extracting a three-dimensional model of an object in a selected scene, comprising the steps of: acquiring, from a plurality of spatial-temporal views, each of which spatial-temporal views is associated with a viewing site, digital data representing at least that portion of the scene containing the object to be extracted, said digital data not including information relating to the location of at least one of said viewing sites; at least temporarily storing the acquired digital scene information data; displaying to a system user selected scenic information to allow the user to select from the displayed data a feature of the object to be extracted; processing a constrained least-squares optimization of at least the stored digital data for the feature selected via the display, to obtain a set of solution data describing the most likely location of said selected object based upon the most likely locations of said viewing sites; and storing the solution data set to provide output data for at least a display of the extracted object.
Claim 14
Dependent Claim
31 words
The method of claim 11, wherein said acquiring step includes the step of obtaining a plurality m of substantially simultaneous different images, each of a different spatial view of the scene.
Claim 15
Dependent Claim
90 words
The method of claim 11, wherein said processing step includes the substeps of: retrieving topological structure, constraint and vertex designation data from storage; receiving information from the user to select at least one object to establish a base object frame for the object to be extracted; creating an acyclic dependency graph from a structure graph and the received constraint information; initializing unknowns in the dependency graph to form a trial solution thereof; and iteratively operating on and improving the dependency graph until a best sequentially constrained dependency graph is obtained.
Claim 16
Dependent Claim
22 words
The method of claim 13, wherein said processing step includes the step of forming said structure graph from the retrieved topological data.
Claim 17
Dependent Claim
70 words
The method of claim 13, wherein said processing step further includes the step of: interacting with the display means to allow the user to select the at least one constraint from the group consisting of: vertex point, line direction, line length and coincidence of a selected one of a vertex, line or face of a first object with a selected one of a vertex, line or face of another object.
Claim 18
Dependent Claim
39 words
The method of claim 13, wherein said processing step further includes the step of: providing to at least one object, other than the selected object, an object frame spatially situated at a location dependent upon the base object frame.
Claim 19
Dependent Claim
30 words
The method of claim 13, wherein said processing step further includes the step of: establishing the totality of constraints as a consistent whole within a set of predetermined initability conditions.
Claim 20
Dependent Claim
41 words
The method of claim 17, wherein said processing step further includes the step of: limiting the totality of constraints to cause the dependency graph to be created in a form allowing a single ordered list of scene elements to be produced.
Claim 21
Dependent Claim
53 words
The method of claim 18, wherein said processing step further includes the steps of: creating said single ordered dement list by first presorting the scene elements into a top-down sorted first network; and following said step of presorting the scene elements, sorting said first network into a bottom-up sorted network of scene elements.
Claim 22
Dependent Claim
30 words
The method of claim 13, wherein said processing step further includes the step of: performing the iterative improvement by use of a selected one of Gauss-Newton and Levenberg-Marquardt iteration algorithms.
References Cited (Backward Citations)
US4839824A
Cited
US5018065A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-05-26 | 2000-11-25 | 2001-05-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-05-26 | 2004-11-25 | 2005-05-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-05-26 | 2008-11-25 | 2009-05-27 | $7700.00 | Window Closed / Lapsed |