Saturday, December 03, 2011

The Sensor Calibration Problem (part 2)

In my previous definition of sensor calibration, I forgot to complexify the problem in the case where the signal is known to be sparse in some basis. The previous entry, formulated the calibration problem as if the signal were sparse in the canonical basis. What we are really generally solving for is something like this:

y = (A+E) B x + epsilon

where y is the set of measurements, x is the (unknown or known) probings, A is the measurement matrix as modeled or known, E is the uncertainty associated with elements of A, B is the sparsifying transform and epsilon another error term. Previously, B was the identity.



Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.

No comments:

Printfriendly