pub enum LaplacianSolver {
Dct,
Fft {
pad: [usize; 3],
},
Mirror,
}Expand description
Poisson solver for laplacian_unwrap (names as in QSM.jl’s unwrap_laplacian).
Variants§
Dct
Unweighted least squares (Ghiglia & Romero 1994): finite differences of wrapped
neighbour differences, Poisson solve under a Neumann condition via DCT. Matches QSM.jl
:dct. The default.
Fft
Schofield & Zhu (2003): ∇²φ from the sin/cos identity with spectral derivatives, FFT
Poisson solve on the volume zero-padded by pad voxels per side. Reproduces STI Suite
3.0’s MRPhaseUnwrap with padsize = pad (its default is 12; UK Biobank uses 64).
Mirror
Schofield & Zhu (2003) as Hongfu Sun’s lapunwrap.m does it (QSMART’s Laplacian
unwrapping): ∇²φ from the sin/cos identity with spectral derivatives and an FFT Poisson
solve, on the volume mirrored to twice its size along each axis (so no seam at the edge)
rather than zero-padded. DC → 0 (lapunwrap.m divides it by eps, a constant that
depends only on rounding).
Implementations§
Source§impl LaplacianSolver
impl LaplacianSolver
Sourcepub const FFT_DEFAULT_PAD: LaplacianSolver
pub const FFT_DEFAULT_PAD: LaplacianSolver
LaplacianSolver::Fft with STI Suite’s default padding, 12 voxels per side.
Trait Implementations§
Source§impl Clone for LaplacianSolver
impl Clone for LaplacianSolver
Source§fn clone(&self) -> LaplacianSolver
fn clone(&self) -> LaplacianSolver
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Copy for LaplacianSolver
Source§impl Debug for LaplacianSolver
impl Debug for LaplacianSolver
Source§impl Default for LaplacianSolver
impl Default for LaplacianSolver
Source§fn default() -> LaplacianSolver
fn default() -> LaplacianSolver
impl Eq for LaplacianSolver
Source§impl PartialEq for LaplacianSolver
impl PartialEq for LaplacianSolver
Source§impl Serialize for LaplacianSolver
impl Serialize for LaplacianSolver
impl StructuralPartialEq for LaplacianSolver
Auto Trait Implementations§
impl Freeze for LaplacianSolver
impl RefUnwindSafe for LaplacianSolver
impl Send for LaplacianSolver
impl Sync for LaplacianSolver
impl Unpin for LaplacianSolver
impl UnsafeUnpin for LaplacianSolver
impl UnwindSafe for LaplacianSolver
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneAny for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSend for T
impl<T> DowncastSend for T
§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more