Skip to main content

WaveletTransform

oxiphysics_core::spectral_methods

Struct WaveletTransform 

Source 
pub struct WaveletTransform;
Expand description

Haar wavelet multi-level decomposition and reconstruction.

The Haar wavelet is the simplest orthogonal wavelet. The transform iteratively applies the single-level forward transform to the approximation coefficients, producing a hierarchy of detail sub-bands.

Implementations§

Source§

impl WaveletTransform

Source

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

Forward single-level Haar transform.

Returns (approx, detail) each of length signal.len() / 2.

Source

pub fn haar_inverse(approx: &[f64], detail: &[f64]) -> Vec<f64>

Inverse single-level Haar transform.

Reconstructs a signal of length 2 * approx.len().

Source

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

Multi-level Haar decomposition.

Returns a Vec of length levels + 1:

  • index 0: final (coarsest) approximation
  • indices 1..=levels: detail coefficients (finest at index 1)
Source

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

Multi-level Haar reconstruction from decomposed coefficients.

Input coeffs must be in the same format as returned by WaveletTransform::decompose.

Source

pub fn soft_threshold(coeffs: &mut Vec<Vec<f64>>, lambda: f64)

Soft thresholding (denoising) on wavelet detail coefficients.

Applies the soft-threshold function sign(x) * max(|x| - lambda, 0) to each detail coefficient in coeffs[1..].

Source

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

Compute the energy in each sub-band of a decomposition.

Returns one energy value per sub-band.

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.