downsample data adapively/"intelligently"
50 ビュー (過去 30 日間)
古いコメントを表示
I have a set of data that contains ~7800 data points (the red curve in the figure). I have reduced the number of data points with downsample() to 19 data points (blue curve). However, I would like to position the points more "intelligently". Is there a function in Matlab where the points are placed with some kind of least square minimization/adaptive spacing? The data is currently stored in a struct (data.Stress and data.Strain).
The number of data points must be possible to fix by the user (e.g. =19 in this case).
The most important part of the curve is the beginning, but I think that a general minimization would give a good enough result.
Adding a point between the first and second point and remoing one point where the curve is more or less linear would give a good-enough result. But modifying the curve manually isn't so attractive as there are quite a few curves to process.
1 件のコメント
Mathieu NOE
2021 年 9 月 17 日
hello
I would suggest you do a linear interpolation, but the new x vector should have more points in the beginning compared to the end of the curve
you can try different x axis distributions (linear decreasing or exponential) ....
採用された回答
Jan
2021 年 9 月 17 日
編集済み: Jan
2021 年 9 月 17 日
This is not a trivial problem. In the general case it is a global optimization problem and there can be a huge number of equivalent solutions.
The Douglas-Peuker-algorithm is a fair approach, if the input is given as discrete set of points, see: https://www.mathworks.com/help/images/ref/reducepoly.html or https://www.mathworks.com/matlabcentral/fileexchange/61046-douglas-peucker-algorithm
An alternative: Calculate the cumulative sum of the absolute values of the 2nd derivative. Now find rounded equidistant steps on this line. The higher the curvature, the more points you get:
x = linspace(0, 4*pi, 500);
y = sin(x);
n = 21; % Number of points
ddy = gradient(gradient(y, x), x); % 2nd derivative
sy = cumsum(abs(ddy));
idx = interp1(sy, 1:numel(x), linspace(sy(1), sy(end), n), 'nearest');
plot(x, y);
hold on
plot(x(idx), y(idx), 'ro');
This looks very nice even for a small number of points. To my surprise it looks such good, that this must be a standard approach. Does anybody know, how this algorithm is called?
1 件のコメント
Wolfie
2022 年 7 月 28 日
This is nice, but if it's possible for the 2nd derivative to be zero then interp1 will complain about grid vectors not being unique. Adding some small steady increment to sy can avoid this e.g.
sy = sy + linspace(0,max(sy)/10,numel(sy));
その他の回答 (1 件)
参考
カテゴリ
Help Center および File Exchange で Colormaps についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!