edu.jhu.ece.iacl.algorithms.dti.tractography
Class ConnectivityMatrix
java.lang.Object
edu.jhu.ece.iacl.algorithms.dti.tractography.ConnectivityMatrix
public class ConnectivityMatrix
- extends java.lang.Object
This class organizes connectivity data into a connectivity matrix.
- Author:
- John Bogovic
07/30/2009
Method Summary |
static double[][] |
compute(java.util.List<double[]> fiberstats,
java.util.List<Point2i> labelpairs,
java.util.List<java.lang.Integer> labels,
byte stat)
This method organizes fiber data into a connectivity matrix. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
ConnectivityMatrix
public ConnectivityMatrix()
compute
public static double[][] compute(java.util.List<double[]> fiberstats,
java.util.List<Point2i> labelpairs,
java.util.List<java.lang.Integer> labels,
byte stat)
- This method organizes fiber data into a connectivity matrix.
The first input is a list of double[]. Each element of the list corresponds to a single connection.
Each double[] in this list contains statistics for each fiber that is part of the connection.
If the double[] is null, the corresponding entry in the connecvitity matrix will be NaN. This may occur
when no fibers are found between two regions.
Each connection is represented by a Point2i (a pair of Integer labels). These must be contained in
the input list "labelpairs" in which the ith element represents the connection for the ith fiberstatistics.
Note the convension that each label pair should be organized such that x
- Parameters:
fiberstatistic
- The list of fiber statistics for each connection.labelpair
- The list of connections represented by each set of fiber statistics.labels
- The list of labels.stat
- The statistic to compute across fibers for every connection.
- Returns:
- The connectivity matrix.