| Package | Description |
|---|---|
| woSource | |
| woSource.math |
| Modifier and Type | Field and Description |
|---|---|
protected Point3Dint[] |
PulmonaryTrunkSegm.treeTops |
protected Point3Dint |
VesselSegm.trunkSkelStartPt |
| Modifier and Type | Method and Description |
|---|---|
protected Point3Dint |
VesselSegm.findClosestSkeletonPt(int seedx,
int seedy,
int seedz) |
protected Point3Dint |
VesselSegm.findClosestSkeletonPt(Point3Dint seedpt)
start by searching near seed point for best distance value
|
Point3Dint |
VesselSegm.findSkeletonTop(int locx,
int locy,
int locz,
int levelAt) |
Point3Dint |
VesselSegm.findSkeletonTop(Point3Dint ptat,
int levelAt)
3/22/2013 after plugging all of the false connections between trees with calls to splitTreeAtConnection()
we want to generate updated masks for each tree to enable colored display in MIPsColor.
|
Point3Dint |
VesselSegm.findSkeletonTopTry(int locx,
int locy,
int locz,
int levelAt)
WO 7/17/2012 this is working correctly for 2D test image, but fails usually
for human 3D pulmonary tree and for the colon.
|
Point3Dint |
VesselSegm.findSkeletonTopTry(int locx,
int locy,
int locz,
int levelAt,
boolean onLastPath,
boolean findBiggestAngle) |
Point3Dint |
VesselSegm.findSkeletonTopTry(Point3Dint ptat,
int levelAt) |
Point3Dint |
VesselSegm.findSkeletonTopTry(Point3Dint ptat,
int levelAt,
boolean onLastPath,
boolean findBiggestAngle) |
Point3Dint |
VesselSegm.getHyperskelPairPt(int locx,
int locy,
int locz) |
Point3Dint |
VesselSegm.getHyperskelPairPt(Point3Dint checkLoc) |
Point3Dint |
VesselSegm.getHyperskelPairPt(Point3Dint checkLoc,
int pairAt) |
| Modifier and Type | Method and Description |
|---|---|
void |
VesselSegm.checkRemoveHyperskelPair(Point3Dint checkLoc) |
void |
VesselSegm.createHyperSkelPair(int treeFrom,
int brFrom,
Point3Dint pt1,
Point3Dint pt2) |
protected Point3Dint |
VesselSegm.findClosestSkeletonPt(Point3Dint seedpt)
start by searching near seed point for best distance value
|
Point3Dint |
VesselSegm.findSkeletonTop(Point3Dint ptat,
int levelAt)
3/22/2013 after plugging all of the false connections between trees with calls to splitTreeAtConnection()
we want to generate updated masks for each tree to enable colored display in MIPsColor.
|
Point3Dint |
VesselSegm.findSkeletonTopTry(Point3Dint ptat,
int levelAt) |
Point3Dint |
VesselSegm.findSkeletonTopTry(Point3Dint ptat,
int levelAt,
boolean onLastPath,
boolean findBiggestAngle) |
int |
VesselSegm.get2ndHyperSkelPairIndex(Point3Dint checkLoc,
int knownPt) |
int |
VesselSegm.getHyperSkelPairIndex(Point3Dint checkLoc) |
Point3Dint |
VesselSegm.getHyperskelPairPt(Point3Dint checkLoc) |
Point3Dint |
VesselSegm.getHyperskelPairPt(Point3Dint checkLoc,
int pairAt) |
int |
VesselSegm.getTopLocIndex(Point3Dint testPt) |
boolean |
VesselSegm.isAhyperSkelPt(Point3Dint checkLoc) |
boolean |
VesselSegm.isAtopLoc(Point3Dint testPt) |
protected void |
VesselSegm.traceCenterline(Point3Dint startPt) |
protected void |
VesselSegm.traceCenterlines(Point3Dint[] startPts,
int nstpts) |
| Modifier and Type | Field and Description |
|---|---|
Point3Dint |
HyperSkelPair.Pt1 |
Point3Dint |
HyperSkelPair.Pt2 |
Point3Dint[] |
VesselBranch.pts |
Point3Dint |
HyperSkelPair.terminatingPt |
| Modifier and Type | Method and Description |
|---|---|
Point3Dint |
VesselTree.clipBranchRadiusIncreases(int brAt,
float parRadRatioThresh,
float branchRadRatioThresh)
returns first break point along this branch
Intended to find fibrotic regions in lung volume hit during vessel traversal |
Point3Dint[] |
VesselTree.clipRadiusIncreases(float parRadRatioThresh,
float branchRadRatioThresh)
Found that parRadRatioThresh of 1.5 and radIncrRatio of 2 worked OK for 2D test data.
|
static Point3Dint[][] |
ArraysI.extend(Point3Dint[][] A,
int nextend1,
int nextend2) |
static Point3Dint[] |
ArraysI.extend(Point3Dint[] A,
int nextend) |
static Point3Dint[] |
ArraysI.findLocalExtrema(byte[][][][] image,
int search_size,
int Threshold,
int NMax)
WO 12/23/10 for stack of images
|
static Point3Dint[] |
ArraysI.findLocalExtrema(byte[][][][] image,
int searchI,
int searchJ,
int searchK,
int Threshold,
int NMax)
WO 12/23/10 for stack of images with same search size for each
|
static Point3Dint[] |
ArraysI.findLocalExtrema(byte[][][] image,
int search_size,
int Threshold,
int NMax)
WO 1/19/11 3D version; 2/16/11 removing divotThreshold, and corrected error where
if a new close point was found, it didn't check to see if the old point was worse
and throw it out if so.
|
static Point3Dint[] |
ArraysI.findLocalExtrema(byte[][][] image,
int searchI,
int searchJ,
int searchK,
int Threshold,
int NMax) |
static Point3Dint[] |
ArraysI.findLocalExtrema(short[][][][] image,
int search_size,
short Threshold,
int NMax) |
static Point3Dint[] |
ArraysI.findLocalExtrema(short[][][] image,
int search_size,
float Threshold,
int NMax)
WO 2/16/11 omitted DivotThresh as doesn't make sense with NCCC calculations
|
Point3Dint |
VesselBranch.getFirstPoint() |
Point3Dint |
VesselBranch.getLastPoint() |
Point3Dint |
VesselBranch.getMiddlePoint() |
Point3Dint |
VesselBranch.getPoint(int ptat) |
static Point3Dint |
MathII.getStringPoint3Dint(java.lang.String target,
java.lang.String key,
int skip,
java.lang.String strsep) |
Point3Dint |
VesselTree.getTreeTopPt3D() |
static Point3Dint[] |
ArraysI.insert(Point3Dint[] A,
Point3Dint newval,
int loc) |
static Point3Dint |
ArraysI.maxpt(byte[][][] A) |
static Point3Dint |
ArraysI.maxpt(byte[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint |
ArraysI.maxpt(float[][][] A) |
static Point3Dint |
ArraysI.maxpt(float[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint |
ArraysI.maxpt(int[][][] A) |
static Point3Dint |
ArraysI.maxpt(int[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint |
ArraysI.maxpt(Point3Dint[] A) |
static Point3Dint |
ArraysI.maxpt(Point3Dint[] A,
int x,
int width) |
static Point3Dint |
ArraysI.maxpt(short[][][] A) |
static Point3Dint |
ArraysI.maxpt(short[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint |
ArraysI.minpt(float[][][] A) |
static Point3Dint |
ArraysI.minpt(float[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint |
ArraysI.minpt(int[][][] A) |
static Point3Dint |
ArraysI.minpt(int[][][] A,
int x,
int y,
int z,
int width,
int height,
int depth) |
static Point3Dint[] |
ArraysI.remove(Point3Dint[] A,
int loc) |
static Point3Dint[] |
ArraysI.sortInsert(Point3Dint[] A,
Point3Dint newval) |
static Point3Dint[] |
ImgProc.statsCorrelation(short[][][] pixels,
float[][][][] kernels,
Point3Dint[] cands)
using Point3Dint[]
|
static Point3Dint[] |
ImgProc.statsCorrelation(short[][][] pixels,
float[][][] kernel,
Point3Dint[] cands)
Point3Dint[] version
|
| Modifier and Type | Method and Description |
|---|---|
void |
VesselBranch.addPt(Point3Dint A) |
static float[] |
ImgProc.calcPlaneThroughPoints(Point3Dint[] pts)
8/6/2012 intent to find normal to plane passing through the given points,
using plane = ax + by + cz + d =0 where the normal = {a,b,c} and the plane passes through
the centroid of the poitns array (I think this is arbitrary -- can pick any point -- since I
only care about the normal direction.
|
void |
Point4Dint.Copy(Point3Dint origpt) |
void |
Point3Dint.Copy(Point3Dint A) |
static Point3Dint[][] |
ArraysI.extend(Point3Dint[][] A,
int nextend1,
int nextend2) |
static Point3Dint[] |
ArraysI.extend(Point3Dint[] A,
int nextend) |
static float[] |
ImgProc.getNormalThroughEdgePt(boolean[][][] edgeMap,
Point3Dint ptAt,
int searchrad) |
float |
VesselBranch.getPtSep(int brPtAt,
Point3Dint nextPt) |
static Point3Dint[] |
ArraysI.insert(Point3Dint[] A,
Point3Dint newval,
int loc) |
static Point3Dint[] |
ArraysI.insert(Point3Dint[] A,
Point3Dint newval,
int loc) |
void |
VesselTree.insertDiskOntoMask(Point3Dint loc) |
boolean |
VesselBranch.isPointInBranch(Point3Dint testPt) |
boolean |
VesselTree.isPointInTree(Point3Dint testPt) |
static Point3Dint |
ArraysI.maxpt(Point3Dint[] A) |
static Point3Dint |
ArraysI.maxpt(Point3Dint[] A,
int x,
int width) |
static float[] |
ArraysI.minus(Point3Dint A,
Point3Dint B)
create vector separating the 2 Points
|
void |
ArrayDisplay.overlayPoints(Point3Dint[] points,
int marksize) |
void |
ArrayDisplay.overlayPoints(Point3Dint[] points,
int marksize,
java.lang.String color) |
static void |
ArraysI.print(Point3Dint[] A,
int n,
java.lang.String label) |
static void |
ArraysI.print(Point3Dint[] A,
java.lang.String label) |
static Point3Dint[] |
ArraysI.remove(Point3Dint[] A,
int loc) |
float |
Point4Dint.sep(Point3Dint origpt) |
float |
Point3Dint.sep(Point3Dint A) |
float[] |
Point3Dint.sepVec(Point3Dint A)
returns the unit vector from 'this' to A
|
float[] |
Point3D.sepVec(Point3Dint A)
returns the unit vector from 'this' to A
|
static Point3Dint[] |
ArraysI.sortInsert(Point3Dint[] A,
Point3Dint newval) |
static Point3Dint[] |
ArraysI.sortInsert(Point3Dint[] A,
Point3Dint newval) |
static Point3Dint[] |
ImgProc.statsCorrelation(short[][][] pixels,
float[][][][] kernels,
Point3Dint[] cands)
using Point3Dint[]
|
static Point3Dint[] |
ImgProc.statsCorrelation(short[][][] pixels,
float[][][] kernel,
Point3Dint[] cands)
Point3Dint[] version
|
| Constructor and Description |
|---|
Point3Dint(Point3Dint A) |
Point4Dint(Point3Dint origpt) |
Point4Dint(Point3Dint A,
int tt,
java.lang.String name) |