Method and system for distinguishing surfaces in 3D data sets (''dividing voxels'')

• US 20050219245A1
• Filed: 11/29/2004
• Published: 10/06/2005
• Est. Priority Date: 11/28/2003
• Status: Abandoned Application

• Current Assignee: Bracco Imaging S.p.A. (Bracco SPA)
• Original Assignee: Bracco Imaging S.p.A. (Bracco SPA)
• Inventors: Tao, Chen
• Application Number:
  US10/998,379
• Publication Number:
  US 20050219245A1
• Time in Patent Office: Days
• US Class Current: 345/424
• CPC Class Codes: G06T 17/20 Finite element generation, e.g. wire-frame surface description, tesselation

Abstract

A system and method for creating a surface for an arbitrary segment of a three-dimensional data set are presented. In exemplary embodiments according to the present invention the method includes initially identifying a set of surface voxels of the segment. For each voxel in the set information as to which of its neighbors are inside voxels can be obtained, and the results can be utilized to determine the location and direction of a polygonal surface dividing the voxel. The surface can then be obtained by connecting all of the polygonal surfaces. In exemplary embodiments according to the present invention the polygonal surfaces can comprise triangles. In exemplary embodiments according to the present invention the surface can be displayed in either a wireframe mode or a solid mode. In exemplary embodiments according to the present invention mesh reduction can be implemented to reduce the number of polygons in the final surface. In exemplary embodiments of the present invention the volume bounded by the mesh surface can be calculated. Additionally, if the mesh surface generated is not a closed surface, as when, for example, the segmented object has been cropped prior to generation of the mesh surface, any “holes” within it can be closed by a mesh and then the volume can be calculated.

Claims

1. A method of creating a surface for an arbitrary segmentation of an object from a three-dimensional data set, comprising:

identifying a set of surface voxels of the segment;

for each voxel in the set;

calculating which of its neighbors are inside voxels to generate a case vector; and

using the case vector to determine the location and direction of a polygonal surface within the voxel with which to divide the voxel; and

generating all of the polygonal surfaces to create a segment surface.

2. The method of claim 1, wherein if for a given voxel the case vector is ambiguous as to where to divide a given surface voxel, further comprising post processing prior to generating the polygonal surfaces.

3. The method of claim 2, wherein said post processing includes subdivision of ambiguous voxels into smaller scale voxels, recalculation of case vectors as to each smaller scale voxel, and division of said smaller scale voxels with polygonal surfaces.

4. The method of claim 1, wherein each polygonal surface comprises triangles.

5. The method of claim 4, wherein each polygonal surface comprises either two or three triangles.

6. The method of claim 1, further comprising reducing the number of polygons in the segment surface via mesh reduction.

7. The method of claims 1, further comprising filling any holes in the segment surface to create a closed segment surface.

8. The method of claim 7, wherein the volume of the closed segment surface is calculated as a measure of the volume of the actual object represented in the data set.

9. The method of claim 1, further comprising displaying the segment surface in either solid mode or wireframe mode.

10. The method of claim 9, wherein the segment surface can be displayed either using all of the originally generated polygonal surfaces or using polygonal surfaces as reduced by mesh reduction.

11. The method of claims 1, wherein said generating a case vector includes determining which direct neighbors of the surface voxel are inside voxels.

12. The method of claim 11, wherein said generating a case vector further includes determining which edge and corner neighbors of the surface voxel are inside voxels.

13. The method of claim 12, wherein the location and direction of a polygonal surface within a voxel is a function of the case vector.

14. The method of claim 1, wherein the location and direction of a polygonal surface comprises which edges of the surface voxel the polygonal surface intersects.

15. The method of claim 14, wherein said determining the location and direction of the polygonal surface further includes interpolating to determine which point on each edge of the voxel said polygonal surface should intersect.

17. A method of generating a surface for an arbitrary segmentation of an object from a three-dimensional data set, said segmentation being based upon a threshold, comprising:

implementing the method of claim 1 if the threshold was sparing; and

implementing the method of claim 16 if the threshold was liberal.

16. A method of creating a surface for an arbitrary segmentation of an object from a three-dimensional data set, comprising:

identifying a set of outermost inside voxels of the segment;

for each voxel in the set;

calculating which of its neighbors are outside voxels to generate a case vector; and

using the case vector to determine the location and direction of a polygonal surface within the voxel with which to divide the voxel; and

generating all of the polygonal surfaces to create a segment surface.

18. A computer program product comprising a computer usable medium having computer readable program code means embodied therein, the computer readable program code means in said computer program product comprising means for causing a computer to create a surface for an arbitrary segmentation of an object from a three-dimensional data set, comprising:

identifying a set of surface voxels of the segment;

for each voxel in the set;

calculating which of its neighbors are inside voxels to generate a case vector; and

using the case vector to determine the location and direction of a polygonal surface within the voxel with which to divide the voxel; and

generating all of the polygonal surfaces to create a segment surface.

20. The computer program product of claim 18, wherein said generating a case vector further includes determining which face, edge and corner neighbors of the surface voxel are inside voxels.

19. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method of creating a surface for an arbitrary segmentation of an object from a three-dimensional data set, comprising:

identifying a set of surface voxels of the segment;

for each voxel in the set;

calculating which of its neighbors are inside voxels to generate a case vector; and

using the case vector to determine the location and direction of a polygonal surface within the voxel with which to divide the voxel; and

generating all of the polygonal surfaces to create a segment surface.

21. The program storage device of claim 19, wherein said generating a case vector further includes determining which face, edge and corner neighbors of the surface voxel are inside voxels.