Non-Overlapping Moving Sum

17 次查看（过去 30 天）

显示更早的评论

Suman Dhamala 2021-6-27

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/866415-non-overlapping-moving-sum

评论： Suman Dhamala 2021-6-27

采纳的回答： Star Strider

Consider any matrix, say Rain=(1:10)'. I want to compute a non-overlapping moving sum with two element.

Rain=1,2,3,4,5,6,7,8,9,10

Compute=1+2,3+4,5+6,7+8,9+10

With traditional movsum command, the moving sum is overlapping elements. I want to evaluate non-overlapping moving sum. Any in-built function? I have tried with loops and all those, it works but in-built function would be fast to compute.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Star Strider 2021-6-27

2
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/866415-non-overlapping-moving-sum#answer_734555

在 MATLAB Online 中打开

Try this —

Rain = [1,2,3,4,5,6,7,8,9,10];
rRain = reshape(Rain, 2, [])
rRain = 2×5
     1     3     5     7     9
     2     4     6     8    10
sumRain = sum(rRain)
sumRain = 1×5
     3     7    11    15    19

These could be combined into one line, however I kept them separate to demonstrate how it works.

6 个评论
显示 4更早的评论隐藏 4更早的评论

Star Strider 2021-6-27

@Matt J — Thank you! I didn’t think to look in FEX.

Suman Dhamala 2021-6-27

This worked thanks @Matt J and everyone

请先登录，再进行评论。

更多回答（1 个）

Image Analyst 2021-6-27

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/866415-non-overlapping-moving-sum#answer_734600

Since you have an image, you can do it with blockproc. However it only works with 2-D arrays so you'll have to do it once on each slice, then again along the z direction. I'm attaching some blockproc demos. I haven't done it with a 3-D image so you're on your own but I'm pretty sure it can be done.