Content deleted Content added
→CUDA implementation: rem dup ref |
→BPBEMD algorithm: move ref out of heading |
||
| (2 intermediate revisions by the same user not shown) | |||
Line 191:
Based on the algorithm of BEMD, the implementation method of FABEMD is really similar to BEMD, but the FABEMD approach just changes the interpolation step into a direct envelope estimation method and restricts the number of iterations for every BIMF to one. As a result, two order statistics, including MAX and MIN, will be used for approximating the upper and lower envelope. The size of the filter will depend on the maxima and minima maps obtained from the input. The steps of the FABEMD algorithm are listed below.
===FABEMD algorithm===
Source:<ref name=":0" /> ;Step 1 – Determine and detect local maximum and minimum
Line 259 ⟶ 260:
Here, we take 2-D PDE-based EMD as an example.
===PDE-based BEMD algorithm===
Source:<ref name=":2" /> ;Step 1 – Extend super diffusion model from 1-D to 2-D
Line 318 ⟶ 320:
There are some problems in BEMD and boundary extending implementation in the iterative sifting process, including time-consuming, shape and continuity of the edges, decomposition results comparison and so on. In order to fix these problems, the '''Boundary Processing in Bidimensional Empirical Decomposition (BPBEMD)''' method was created. The main points of the new method algorithm will be described next.
===BPBEMD algorithm
The few core steps for BPBEMD algorithm are:<ref name=":3" />
;Step 1
| |||