Skip to main content

OrthogonalMatchingPursuit

Struct OrthogonalMatchingPursuit 

Source
pub struct OrthogonalMatchingPursuit {
    pub max_k: usize,
}
Expand description

Orthogonal Matching Pursuit (OMP) for sparse signal recovery.

Greedily selects the most correlated column of the measurement matrix at each step and performs a least-squares fit on the selected support.

Fields§

§max_k: usize

Maximum sparsity (number of non-zero coefficients to recover).

Implementations§

Source§

impl OrthogonalMatchingPursuit

Source

pub fn new(max_k: usize) -> Self

Create an OMP solver with sparsity bound max_k.

Source

pub fn solve(&self, a: &[Vec<f64>], b: &[f64]) -> Vec<f64>

Recover a sparse signal from measurements.

  • a — measurement matrix (m × n, row-major)
  • b — measurement vector (length m)

Returns the recovered coefficient vector of length n.

Source

pub fn support(&self, a: &[Vec<f64>], b: &[f64]) -> Vec<usize>

Return the support (indices of non-zero components) for sparsity level k.

Runs OMP for exactly k steps and returns the selected column indices.

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.