System and method associated with progressive spatial analysis of prodigious 3d data including complex structures

Patent metadata

Field	Value
Publication number	US-2020005015-A1
Application number	US-201816481744-A
Country	US
Kind code	A1
Filing date	Feb 7, 2018
Priority date	Feb 8, 2017
Publication date	Jan 2, 2020
Grant date	—

Abstract

A system associated with progressive spatial analysis of prodigious 3D data including complex structures is disclosed. The system receives minimum boundary information related to a first data object and a second data object, which are proximate neighbors. The system determines whether boundary data associated with a first data object is within an area delineated by minimum boundary information of first data objects. A first geometric structure associated with the first data object is generated based on respective decompressed data. A structural skeleton is determined using the first geometric structure to identify respective skeleton vertices. A geometric representation is generated based on the skeleton vertices associated with the first geometric structure. The system determines whether boundary data associated with the second data object is within the area delineated by the minimum boundary information of the first data object. A centroid point of the second data object that intersects the geometric representation associated with the first object is identified. A location of the centroid point of the second data object with respect to the first data object is determined in order to identify a minimum distance between the first data object and the second data object.
A corresponding method and computer-readable device are also disclosed.

First claim

What is claimed is:

1 . A system associated with progressive spatial analysis of prodigious 3D data including complex structures, the system comprising:
a 3D spatial query engine including a computing device that performs the following operations:
receiving minimum boundary information related to a first data object;
receiving minimum boundary information related to a second data object, the first data object and the second data object being proximate neighbors;
determining whether boundary data associated with the first data object is within an area delineated by minimum boundary information of first data objects;
generating a first geometric structure associated with the first data object based on respective decompressed data associated with the first data object;
determining a structural skeleton using the first geometric structure associated with the first data object in order to identify its respective skeleton_vertices;
generating a geometric representation based on the skeleton_vertices associated the first geometric structure;
determining whether boundary data associated with the second data object is within the area delineated by minimum boundary information of the first data object;
identifying whether a centroid point of the second data object intersects the geometric representation associated with the first object; and
determining a location of the centroid point of the second data object with respect to the first data object in order to identify a minimum distance between the first data object and the second data object.

2 . The system as recited in claim 1 , which further comprises iteratively receiving and processing minimum boundary information related to multiple first data objects and multiple second data objects.

3 . The system as recited in claim 1 , wherein the first data object is a blood vessel and the second data object is one of a cell and a nucleus.

4 . The system as recited in claim 1 , wherein the first data object is a first biological structure and the second data object is a second biological structure.

5 . The system as recited in claim 3 , in which the progressive spatial analysis further comprises a determination of a nearest distance between at least one nucleus and a nearest blood vessel.

6 . The system as recited in claim 1 , in which generating a first geometric structure associated with the first data object based on its decompressed data further comprises compressing the first data object according to a specified level of detail (LOD).

7 . The system as recited in claim 6 , which further comprises the specified level of detail (LOD) being varied to refine determination of minimum distance, based on an evaluation of compression of the first data object as associated with the progressive spatial analysis thereof.

8 . A system associated with progressive spatial analysis of prodigious 3D data including complex structures, the system comprising:
a 3D spatial query engine including a computing device that performs the following operations:
receiving minimum boundary information related to first data objects;
receiving minimum boundary information related to second data objects;
initializing an array with the minimum boundary information related to the first data objects;
determining whether minimum boundary information associated with one of the first data objects is related to an area delineated by the minimum boundary information in the array;
determining whether a first area delineated by the minimum boundary information associated with the one of the first data objects intersects an area delineated by a second area delineated by the minimum boundary information associated with one of the second data objects;
generating a first geometric structure associated with the one of the first data objects based on respective decompressed data associated with the one of the first data objects;
generating a second geometric structure object associated with the one of the second data objects based on respective decompressed data associated with the one of the second data objects;
determining whether a first geometric region defined by the first geometric structure intersects a second geometric region defined by the second geometric structure;
determining a spatial measurement of an intersecting region defined by an intersection of the first geometric region with the second geometric region; and
identifying a first intersecting object and a second intersecting object associated with the intersecting region and respective volume information associated with the intersecting region.

9 . The system as recited in claim 8 , in which the progressive spatial analysis further comprises determining a minimum distance between the one of the first data objects and a nearest second data object based on a tree-based analysis of their respective minimum bounding information.

10 . The system as recited in claim 8 , in which the progressive spatial analysis further comprises determining nearest distances between the first objects and the second objects based on a spatial proximity estimation distance analysis associated with extracted bounding geometries of a surface mesh of first data objects with respect to nearest second data objects.

11 . The system as recited in claim 8 , in which the progressive spatial analysis further comprises:
defining a first polygon based on the minimum boundary information associated with a first object; defining a second polygon based on minimum boundary information associated with one or more of nearest second objects of the first object; generating a buffered boundary that surrounds the first polygon determined by the minimum boundary information associated with the first object; determining an intersection between respective first polygon of the first data object and the second polygon associated with the one or more of nearest second objects; duplicating the first object so that a first duplicate of the first data object resides within the first polygon; and the second duplicate resides outside a boundary of the second polygon associated with the one or more of the nearest neighbor objects; and determining a minimum distance between the first duplicate of the first data object and the one or more of the nearest neighbor second objects.

12 . A method associated with progressive spatial analysis of prodigious 3D data including complex structures, the method comprising:
a 3D spatial query engine including a computing device that performs the following operations:
receiving minimum boundary information related to a first data object;
receiving minimum boundary information related to a second data object, the first data object and the second data object being proximate neighbors;
determining whether boundary data associated with the first data object is within an area delineated by minimum boundary information of first data objects;
generating a first geometric structure associated with the first data object based on respective decompressed data associated with the first data object;
determining a structural skeleton using the first geometric structure associated with the first data object in order to identify its respective skeleton_vertices;
generating a geometric representation based on the skeleton_vertices associated the first geometric structure;
determining whether boundary data associated with the second data object is within the area delineated by minimum boundary information of the first data object;
identifying whether a centroid point of the second data object intersects the geometric representation associated with the first object; and
determining a location of

Assignees

• Univ New York State Res Found

Inventors

• Liang Yanhui
• Wang Fusheng
• Vo Hoang

Classifications

• G16H30/20

  for handling medical images, e.g. DICOM, HL7 or PACS · CPC title

• G06F18/24137

  Distances to cluster centroïds · CPC title

• G06K9/00201

  Physics · mapped topic

• G06K9/0014 Primary

  Physics · mapped topic

• G06K9/6272

  Physics · mapped topic