Method and system for direct classification from three dimensional digital imaging
First Claim
1. A method for processing digital image data taken from a three-dimensional topographic scene including terrain to extract discrete objects, the method comprising:
- locating waypoints to define a centerline and a bounded area to be analyzed;
defining the primary dimensional characteristics or attributes of the objects to be extracted from the image;
defining finite element cells having a width dependent on the area of interest, a length dependent on the dimension of the objects and terrain variation and a height dependent on the discrete objects;
mapping the finite element cells to a normalized coordinate base;
grouping the digital image data, in the form of scanned three-dimensional point (x, y, z) coordinate points in Cartesian coordinate reference frames, into the finite element cells by determining eigenvalues and eigenvectors associated with each cell;
classifying each of the three-dimensional points as simple local structures;
composing globally complex structures from the local structures; and
wherein spatial relationships of the three-dimensional coordinate points within each finite element cell are analyzed by calculating a 3×
3 covariance matrix where Cj,k is the element in row j, column k in the matrix, (xi)j is the coordinate of point i in dimension j, n is the number of points in the cell, Nj is a normalization constant, Nk is a second normalization constant, mk is the mean value of the coordinates of the points in dimension k, and mj is the mean value of the coordinates of the points in dimension j, such that;
calculating the eigenvalues and eigenvectors of the matrix, each eigenvector {right arrow over (e)}and corresponding eigenvalue λ
satisfying the equation;
C·
{right arrow over (e)}=λ
·
{right arrow over (e)} wherein C is a constant, and such that the three eigenvalues measure the spread of the data in the direction of the corresponding eigenvectors.
2 Assignments
0 Petitions
Accused Products
Abstract
An automated system and/or method is disclosed for rapidly, accurately, and efficiently processing bulk three-dimensional digital image data of both path/corridor and area scenes to discriminate different structures or classifications of objects from within the image. The method first decomposes the three-dimensional digital imagery coordinate points into simple local structures and then extracts the globally complex structures from the local structures. The system and/or method incorporates procedures for sub-dividing the three-dimensional image data into rectilinear and/or ellipsoidal finite element cells, mathematically analyzing the contents (point coordinates) of each individual cell to classify/define the local structure, and extracting the globally complex structure or object from the image. The system and/or method applies accepted mathematical formulas to filter or classify large volumes of apparently random three-dimensional point coordinate spatial data into simpler structures and then to extract more globally complex objects generally encountered within the real world imagery scene being investigated.
-
Citations
27 Claims
-
1. A method for processing digital image data taken from a three-dimensional topographic scene including terrain to extract discrete objects, the method comprising:
-
locating waypoints to define a centerline and a bounded area to be analyzed; defining the primary dimensional characteristics or attributes of the objects to be extracted from the image; defining finite element cells having a width dependent on the area of interest, a length dependent on the dimension of the objects and terrain variation and a height dependent on the discrete objects; mapping the finite element cells to a normalized coordinate base; grouping the digital image data, in the form of scanned three-dimensional point (x, y, z) coordinate points in Cartesian coordinate reference frames, into the finite element cells by determining eigenvalues and eigenvectors associated with each cell; classifying each of the three-dimensional points as simple local structures; composing globally complex structures from the local structures; and wherein spatial relationships of the three-dimensional coordinate points within each finite element cell are analyzed by calculating a 3×
3 covariance matrix where Cj,k is the element in row j, column k in the matrix, (xi)j is the coordinate of point i in dimension j, n is the number of points in the cell, Nj is a normalization constant, Nk is a second normalization constant, mk is the mean value of the coordinates of the points in dimension k, and mj is the mean value of the coordinates of the points in dimension j, such that;calculating the eigenvalues and eigenvectors of the matrix, each eigenvector {right arrow over (e)}and corresponding eigenvalue λ
satisfying the equation;
C·
{right arrow over (e)}=λ
·
{right arrow over (e)}wherein C is a constant, and such that the three eigenvalues measure the spread of the data in the direction of the corresponding eigenvectors. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system for processing a three-dimensional digital image of topographic scenes to extract discrete objects, the system comprising:
-
a processor which accepts inputs of a three-dimensional digital image; wherein the processor locates waypoints to define the primary dimensional characteristics or attributes of the objects to be extracted from the image; wherein the processor defines finite element cells having a width dependent on the area of interest, a length dependent on the dimensions of the discrete objects and terrain variation and a height dependent on the discrete objects; wherein the processor groups the digital image data, in the form of scanned three-dimensional point (x, y, z) coordinates in Cartesian coordinate reference frames, into the finite element cells; the processor classifies each of the three-dimensional points as simple local structures; wherein the processor composes globally complex structures from the local structures and wherein the spatial relationships of the three-dimensional coordinate points within each finite element cell are analyzed by calculating a 3×
3 covariance matrix, where Cj,k is the element in row j, column k in the matrix, (xi)j is the coordinate of point i in dimension j, n is the number of points in the cell, Nj is a normalization constant, Nk is a second normalization constant, mk is the mean value of the coordinates of the points in dimension k, and mj is the mean value of the coordinates of the points in dimension j, such that;calculating the eigenvalues and eigenvectors of the matrix, each eigenvector {right arrow over (e)} and corresponding eigenvalue λ
satisfying the equation;
C·
{right arrow over (e)}=λ
·
{right arrow over (e)}wherein C is a constant, and such that the three eigenvalues measure the spread of the data in the direction of the corresponding eigenvectors. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
-
Specification