Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have a sensor producing bandlimited data at a predictable periodic rate, corrupted by IID white noise (at least over relatively short periods of time). There is also a slowly time-varying bias, which can safely be ignored as it is several orders of magnitude smaller than the white noise.

I want to numerically differentiate the sensor data. The estimate must be causal. Wikipedia has a nice page on the topic along with filter coefficients for deterministic functions.

Is this set of coefficients good in the presence of noise, or is there a better way to perform this estimate? What factors will the new method depend on?

Edit:

Ideally, the method will be computationally cheap as it will be run at a high rate on an embedded platform ...

share|improve this question
add comment

1 Answer 1

I have used the algorithm described in this paper with great success.

This method uses Tikhonov regularization of the total variation of the signal. It is parameterized, so you can easily adjust the sensitivity as needed.

share|improve this answer
    
So, if I understand the thrust of the paper, it's attempting to find some function that, when integrated, minimizes the difference between it and the original function (i.e. data)? –  Damien Aug 27 '12 at 11:10
    
In a manner of speaking, yes. It's actually evolving a function with respect to a fictitious time variable to fit the data in such a way as to minimize the total variation. –  Arkamis Aug 27 '12 at 12:49
    
Based on your edit, this probably will not work; it is a batch algorithm and not terribly fast. –  Arkamis Aug 27 '12 at 13:23
    
That's more or less what I thought of the paper too. Perhaps it may work over a finite period of time (say, the last N samples), but it still missed the "cheap" remark. Apologies for not listing that criterion earlier. –  Damien Aug 27 '12 at 21:58
1  
Yes, google "Chambolle's Algorithm" or "An Algorithm for Total Variation Minimization and Applications". It is designed for 2D image processing, but I have it running on images about 250x250 remarkably quickly. It should be easy to adapt to the 1-D case; in fact the paper says the 1-D case is trivially easy. I intend to do some experiments with it in the next week or so; I'll post an answer if I get good results. –  Arkamis Sep 28 '12 at 13:54
show 2 more comments

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.