Enum EndEffectStrategy
#[non_exhaustive]pub enum EndEffectStrategy {
LinearSlope,
MirrorExtrema {
num_extrema: usize,
},
SymmetricExtension {
num_extrema: usize,
},
AutoRegressive {
order: usize,
extension_length: usize,
},
}Expand description
Strategy used to mitigate envelope end effects during EMD sifting.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
LinearSlope
Linearly extrapolate each boundary from the two nearest extrema.
MirrorExtrema
Position-reflect the num_extrema nearest extrema around each boundary
(x → −x on the left, x → 2(n−1) − x on the right) and add them to the
spline knot set with their original y values. Rilling, Flandrin &
Gonçalves (2003) §III.
SymmetricExtension
Like Self::MirrorExtrema but with value-symmetric y values:
y = 2·data[boundary] − data[extremum]. Zeng & He (2004).
AutoRegressive
Fit an AR(p) model and extend the signal extension_length samples on
each side before extrema detection. Dätig & Schlurmann (2004).
Trait Implementations§
§impl Clone for EndEffectStrategy
impl Clone for EndEffectStrategy
§fn clone(&self) -> EndEffectStrategy
fn clone(&self) -> EndEffectStrategy
Returns a duplicate of the value. Read more
1.0.0§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read more§impl Debug for EndEffectStrategy
impl Debug for EndEffectStrategy
§impl PartialEq for EndEffectStrategy
impl PartialEq for EndEffectStrategy
impl Copy for EndEffectStrategy
impl Eq for EndEffectStrategy
impl StructuralPartialEq for EndEffectStrategy
Auto Trait Implementations§
impl Freeze for EndEffectStrategy
impl RefUnwindSafe for EndEffectStrategy
impl Send for EndEffectStrategy
impl Sync for EndEffectStrategy
impl Unpin for EndEffectStrategy
impl UnwindSafe for EndEffectStrategy
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§unsafe fn clone_to_uninit(&self, dest: *mut u8)
unsafe fn clone_to_uninit(&self, dest: *mut u8)
🔬This is a nightly-only experimental API. (
clone_to_uninit)§impl<T> IntoEither for T
impl<T> IntoEither for T
§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 more§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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.