Multidimensional discrete convolution: Difference between revisions

Revision as of 12:24, 4 May 2018

Revision as of 17:37, 16 May 2018

Line 329:

<math> h(n) = -1, 0, ... , 0, -1, 4, 1, 0, ..., 0, -1, 0, ...</math>

Notice in the one-dimensional filter that there are no leading zeroes as illustrated in the one-dimensional filtering strip after being unwound. The entire one-dimensional strip could have been convolved with; however, it is less computationally expensive to simply ignore the leading zeroes. In addition, none of these backside zero values will need to be stored in memory, preserving precious memory resources.<ref name=":2">{{Cite journal|url = |title = Multidimensional recursive filters via a helix|last = Claerbout|first = Jon|date = September 1998|journal = Geophysics|doi = 10.1190/1.1444449|pmid = |access-date = |page = 9|citeseerx = 10.1.1.76.1193}}</ref>

===Applications===