pub fn lpcnn_tiled(
local_field_ppm: &[f64],
mask: &[u8],
grid: &Grid,
bdir: (f64, f64, f64),
gen_onnx: &[u8],
cfg: &TileConfig,
progress: impl FnMut(usize, usize),
) -> Result<Vec<f64>, OnnxError>Expand description
Memory-bounded LPCNN via whole-algorithm overlap-tiling — the entire unrolled net is run on
each patch sub-volume so peak memory is bounded (for the 32-bit WASM heap). LPCNN’s k-space
data-consistency step is global, so tiling is strongly off-design and approximate; for
real work run whole-volume (e.g. in QSMxT). See crate::inversion::tiled::tiled_volume_algorithm.