REGION-GROWING ALGORITHM
3 Assignments
0 Petitions
Accused Products
Abstract
A technique for automatically generating a virtual model of a branched structure using as an input a plurality of images taken of the branched structure. The technique employs an algorithm that avoids inaccuracies associated with sub-optimal threshold settings by “patching” holes or leaks created due to the inherent inconsistencies with imaging technology. By “patching” the holes, the algorithm may continue to run using a more sensitive threshold value than was previously possible.
6 Citations
17 Claims
-
1-7. -7. (canceled)
-
8. A method for performing a region growing comprising:
-
identifying a first seed voxel; comparing a hounsfield unit value of voxels adjacent to the first seed voxel with a threshold hounsfield unit value for air; identifying the adjacent voxels as seed voxels, when each of the adjacent voxels meets or exceeds the threshold hounsfield unit value for air; determining whether the identified adjacent voxels are a leakage object; segmenting newly identified adjacent voxels, which are determined not to be a leakage object; iterating the identifying, determining, and segmenting steps; determining whether a new adjacent voxel is segmented in a previous iteration; determining whether a leakage object is identified in the previous iteration when no new adjacent voxel is determined to have been segmented in the previous iteration; and reducing the threshold hounsfield unit value and performing the region growing algorithm only on the identified adjacent voxels, as seed voxels, in the previous iteration when at least one leakage object is determined being identified in the previous iteration. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17)
-
Specification