Expand description
An implementation of smoothing filters and transformations
Structs§
- Moving average over a window of size
N
- An iterator used internally by
MovingAverage::average_into
and exposed byMovingAverage::average_over
- A basic opaque polynomial for Savitsky-Golay
- An opaque implementation of a non-negative Savitsky-Golay filter. The implementation details depend upon which linear algebra backend is enabled. Implementation details were adapted from
<https://github.com/tpict/savgol-rs/>
Enums§
- All the ways a Savitsky-Golay filter can go wrong
Functions§
- Compute a moving average over a window of size
N
on either side of each point using a compile time-known window size. - Compute a moving average over a window of size
N
on either side of each point. This uses dynamic dispatch to a fixed window size implementation. This maxes out at 20 currently. - A wrapper around
SavitskyGolay
for thenalgebra
backend.