Options#
|
CLI |
default |
|
|---|---|---|---|
|
|
required |
threads |
|
|
required |
memory budget, bytes or e.g. |
|
|
off |
spatial first moments: narrower, more accurate bundles; about 5× slower |
|
|
|
remaining walker mass at which the solves stop |
|
|
|
maximum turn per one-voxel hop (degrees) |
|
|
doubleODF |
|
|
|
all in pyAFQ’s bundle dictionary |
pyAFQ names, e.g. |
|
– |
|
also write each bundle’s core |
Choosing them#
max_mem. Each bundle needs one column per pair (avoid set, end kind) (see
11. Many bundles in one solve and 10. ROIs). A column costs about
\(12 \times 8\) bytes per state, or 4× that with moments, and a state is a white-matter voxel
times 26 direction classes. Columns that fit together share every product with the
transition matrix, so a larger budget means fewer passes. Packing does not change any
result.
tol. A typical bundle loses about 10% of its walker mass per step, so \(10^{-10}\) takes
300–500 steps.
Solves that crawl switch to a Krylov solver automatically; there is no setting for it. When nearly everything is walkable (all white matter, say), walkers circle for thousands of steps. Once power iteration would need 500 or more further steps, or stalls, the rest of the series is solved with BiCGSTAB. Each bundle’s summary reports the step at which this happened and the number of products it took.
double_odf. doubleODF weights each hop by how well the next voxel’s fODF supports it
(similar to iFOD2). singleODF follows the current voxel’s fODF only, like pyAFQ’s first-order
probabilistic tracker. Figure 6 shows the difference.
moments. Without moments, every voxel restarts its paths from a uniform distribution of
positions, which widens bundles that run obliquely to the grid (Figure 12).