pub struct StapleConfig {
pub max_iterations: usize,
pub convergence_threshold: f64,
pub init_sensitivity: f64,
pub init_specificity: f64,
}Expand description
STAPLE (Simultaneous Truth and Performance Level Estimation) algorithm.
Estimates the “ground truth” probabilistic segmentation and each rater’s sensitivity/specificity via expectation-maximisation.
This implementation supports binary (foreground/background) segmentation. Multi-label inputs are binarised by treating label > 0 as foreground.
Fields§
§max_iterations: usizeMaximum number of EM iterations (default 20).
convergence_threshold: f64Convergence threshold on the max absolute parameter change (default 1e-5).
init_sensitivity: f64Initial sensitivity estimate for each rater (default 0.99).
init_specificity: f64Initial specificity estimate for each rater (default 0.99).
Trait Implementations§
Source§impl Clone for StapleConfig
impl Clone for StapleConfig
Source§fn clone(&self) -> StapleConfig
fn clone(&self) -> StapleConfig
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for StapleConfig
impl Debug for StapleConfig
Source§impl Default for StapleConfig
impl Default for StapleConfig
Source§fn default() -> StapleConfig
fn default() -> StapleConfig
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for StapleConfig
impl RefUnwindSafe for StapleConfig
impl Send for StapleConfig
impl Sync for StapleConfig
impl Unpin for StapleConfig
impl UnsafeUnpin for StapleConfig
impl UnwindSafe for StapleConfig
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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>
Converts
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>
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.