2019
DOI: 10.1111/1365-2478.12767
|View full text |Cite
|
Sign up to set email alerts
|

Time‐frequency decomposition of seismic signals via quantum swarm evolutionary matching pursuit

Abstract: Matching pursuit belongs to the category of spectral decomposition approaches that use a pre‐defined discrete wavelet dictionary in order to decompose a signal adaptively. Although disengaged from windowing issues, matching point demands high computational costs as extraction of all local structure of signal requires a large size dictionary. Thus in order to find the best match wavelet, it is required to search the whole space. To reduce the computational cost of greedy matching pursuit, two artificial intelli… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…The quality of decomposition was evaluated using the formula for cross‐correlation ( CC ) between the original seismic trace and the reconstructed trace (Semnani et al ., 2019): truerightCC=n=1N()f()nμf()truef̂()nμf̂n=1Nfnμf2n=1Nf̂nμtruef̂2×100%,where f(n)0.33emnormalis0.33emnormalthe0.33emnormaloriginal0.33emnormalsignal, f̂false(nfalse) denotes the reconstructed signal, μf and μf̂ represent the mean values of f(n) and f̂false(nfalse) respectively, and N is the number of signal samples.…”
Section: Matching Pursuit Decomposition With Gabor Atomsmentioning
confidence: 99%
“…The quality of decomposition was evaluated using the formula for cross‐correlation ( CC ) between the original seismic trace and the reconstructed trace (Semnani et al ., 2019): truerightCC=n=1N()f()nμf()truef̂()nμf̂n=1Nfnμf2n=1Nf̂nμtruef̂2×100%,where f(n)0.33emnormalis0.33emnormalthe0.33emnormaloriginal0.33emnormalsignal, f̂false(nfalse) denotes the reconstructed signal, μf and μf̂ represent the mean values of f(n) and f̂false(nfalse) respectively, and N is the number of signal samples.…”
Section: Matching Pursuit Decomposition With Gabor Atomsmentioning
confidence: 99%
“…Li & Zhang (2017) extended the parallel computation by considering the number of envelope peaks versus the number of computer nodes. Semnani et al (2019) introduced quantum swarm evolutionary matching pursuit to boost the efficiency of the conventional matching pursuit.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, selecting the appropriate family type and DWT decomposition level for the feature representation of a class is important because these two parameters affect the classification performance ( [28]; [29]; [30]; [26]; [31]). Some studies used metaheuristic methods to optimise the selection of family types and DWT decomposition levels, such as genetic algorithms ( [32]; [33]), particle swarm optimisation ( [34]; [26], [32]), whale optimisation algorithm [35], and evolutionary quantum swarm algorithm [36]. Many researchers used metaheuristic methods to obtain the optimal wavelet family and the decomposition level for research in engineering fields.…”
Section: Introductionmentioning
confidence: 99%