Non-Overlapping Moving Sum
17 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Suman Dhamala
il 27 Giu 2021
Commentato: Suman Dhamala
il 27 Giu 2021
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 Commenti
Risposta accettata
Star Strider
il 27 Giu 2021
Try this —
Rain = [1,2,3,4,5,6,7,8,9,10];
rRain = reshape(Rain, 2, [])
sumRain = sum(rRain)
These could be combined into one line, however I kept them separate to demonstrate how it works.
.
6 Commenti
Più risposte (1)
Image Analyst
il 27 Giu 2021
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.
0 Commenti
Vedere anche
Categorie
Scopri di più su Introduction to Installation and Licensing in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!