Skip to main content

DiscreteWaveletTransform

oxiphysics_core::wavelets

Struct DiscreteWaveletTransform 

Source 
pub struct DiscreteWaveletTransform;
Expand description

Collection of discrete wavelet transform (DWT) utility functions.

Includes single-level and multi-level Haar DWT, energy, and entropy computations.

Implementations§

Source§

impl DiscreteWaveletTransform

Source

pub fn dwt_haar(signal: &[f64]) -> Vec<f64>

Compute the full Haar DWT of a signal.

Returns a coefficient vector in the standard DWT layout: [approx_coarsest ... detail_level1].

Source

pub fn idwt_haar(coeffs: &[f64]) -> Vec<f64>

Invert the Haar DWT produced by DiscreteWaveletTransform::dwt_haar.

Source

pub fn dwt_level(signal: &[f64], level: usize) -> Vec<f64>

Compute the DWT coefficients at a specific decomposition level.

Returns only the approximation coefficients after level Haar forward steps.

Source

pub fn wavelet_energy(coeffs: &[f64]) -> f64

Compute the total energy (sum of squared coefficients) of a wavelet coefficient array.

Source

pub fn wavelet_entropy(coeffs: &[f64]) -> f64

Compute the Shannon entropy of a normalized wavelet coefficient array.

Coefficients are normalized by total energy before computing entropy.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.