Description

Signal compressed using classical compression methods can be acquired using brute force (i.e. searching for non-zero entries in component-wise). However, sparse solutions require combinatorial searches of high computations. In this thesis, instead, two Bayesian approaches are considered to recover a sparse vector from underdetermined noisy measurements.

Downloads
pdf (1.1 MB)

Download count: 0

Details

Contributors
Date Created
2019
Resource Type
  • Text
  • Collections this item is in
    Note
    • Masters Thesis Computer Engineering 2019

    Machine-readable links