Efficient moving average of scattered data
10 ビュー (過去 30 日間)
古いコメントを表示
I have some scattered data and I'd like to take something similar to a moving average, where I average all values with in some radius of each point. I can do this with a loop, but I'd like a more efficient approach. Any ideas?
Here's a working example I'd like to make more efficient:
x = randi(100,45,1) + 20+3*randn(45,1) ;
y = 15*sind(x) + randn(size(x)) + 3;
figure
plot(x,y,'bo')
radius = 10;
ymean = NaN(size(x));
for k = 1:length(x)
% Indicies of all points within specified radius:
ind = abs(x-x(k))<radius;
% Mean of y values within radius:
ymean(k) = mean(y(ind));
end
hold on
plot(x,ymean,'ks')
legend('scattered data','radial average','location','southeast')
1 件のコメント
Walter Roberson
2016 年 6 月 28 日
When I read the title I thought you might mean "sparse", and was thinking about how I might do an efficient moving average on sparse data.
採用された回答
その他の回答 (2 件)
Chris Turnes
2017 年 3 月 9 日
If you can upgrade to R2017a, this functionality can now be achieved through the 'SamplePoints' name-value pair in the moving statistics. For your example, you would do something like movmean(y, 2*radius, 'SamplePoints', x); (though you'd need to sort your x values first).
0 件のコメント
Walter Roberson
2016 年 6 月 28 日
pdist() to get all of the distances simultaneously. Compare to the radius. Store the resulting mask. Multiply the mask by repmat() of the y value, and sum along a dimension. sum the mask along the same dimension and divide the value sum by that count. Result should be the moving average.
3 件のコメント
Walter Roberson
2016 年 6 月 30 日
編集済み: Walter Roberson
2016 年 6 月 30 日
I wonder if looping pdist2() would be efficient? Eh, it probably just adds unnecessary overhead to a simple Euclidean calculation.
参考
カテゴリ
Help Center および File Exchange で Matrix Indexing についてさらに検索
製品
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!