Filter out Gaussian noise from data curve

Gerenuk
Messages
1,027
Reaction score
5
What is the best way to filter out Gaussian noise from points in a data curve? (i.e. each point of the x-y-graph is displaced in y by a random amount)

A simple running mean does it, but on the other hand it also changes the shape of the underlying real curve.

Is it possible to use the "non-correlation properties" of the noise and some smooth-behaviour-property of the data to preserve the shape the the real data curve?
 
Physics news on Phys.org
Gerenuk said:
A simple running mean does it, but on the other hand it also changes the shape of the underlying real curve.

Generally you will have to trade off the two effects. The goal should be lots of noise reduction with minimal disturbance to the 'real' curve. But the only way to take out the noise without changing the 'real' curve is if you already know what the real curve looks like, in which case you don't need to de-noise corrupted data in the first place.

Gerenuk said:
Is it possible to use the "non-correlation properties" of the noise and some smooth-behaviour-property of the data to preserve the shape the the real data curve?

Well, for Gaussian noise, the correlation properties completely characterize it. I.e., there aren't any other independent noise properties. The key will be using assumptions on how the "real" data should behave: smoothness, correlation, monotonicity, something along those lines. The way to proceed is to figure out exactly what you DO know about the data (which is presumably less than exactly what the real curve looks like), and then apply that. But for anyone to help, you'll first have to tell us what you already know about the data.
 
quadraphonics said:
...
Well, for Gaussian noise, the correlation properties completely characterize it. I.e., there aren't any other independent noise properties. The key will be using assumptions on how the "real" data should behave: smoothness, correlation, monotonicity, something along those lines. The way to proceed is to figure out exactly what you DO know about the data (which is presumably less than exactly what the real curve looks like), and then apply that. But for anyone to help, you'll first have to tell us what you already know about the data.

I have approximately 30 points of data. The real curve is one or two mostly Gaussian bumps spreading over 15 of the central points. Usually the remaining 15 points form a quadric background, so it's fairly smooth. The amplitude of the big bumps is about 20 times the errorbar (standard deviation) of one point.

So I'm usually interested in long wavelength structures.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top