finding number of peaks in a noisy signal

I have a 1D signal with a 10^6 dots, which has a gradient that looks as seen in the picture below.

I would like to find the number of peaks without knowing that distance between them and without find-peaks because its not accurate and count also peaks that are not relevant. Is there a way?

[Image Analyst]

You forgot to attach your data in a .mat file with the paper clip icon, so no one can use your data to try to help you.

Answer 1

[jonas]

"...find-peaks because its not accurate and count also peaks that are not relevant"

That is because you do not know how to use it. You should not write off a function as inaccurate just because it cannot guess what your desired output is. Sometimes you have to filter the data prior to analysis. In this case, it is probably enough for you to look up the MinPeakProminence argument. A value of 10^-3 should give you the 7 most distinguished peaks.

[meny menashes]

thank you for your help, i did read more about findpeaks after your answer but i still want to know how did you get this number 10^-3 how can i find this number for a different graph like this one which has 3 peaks that i need to count i put 10^-3 and i didnt got the right answer .