Time-frequency decomposition of seismic signals via quantum swarm evolutionary matching pursuit |
| |
| Authors: | Amir Semnani Liang Wang Mehdi Ostadhassan Majid Nabi-Bidhendi Babak Nadjar Araabi |
| |
| Institution: | 1. Southwest Petroleum University, Chengdu, Sichuan, 610500 China;2. University of North Dakota, Grand Forks, ND, 58203 USA;3. University of Tehran, Tehran, Tehran, 1417466191 Iran |
| |
| 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 intelligence methods, (1) quantum inspired evolutionary algorithm and (2) particle swarm optimization, are introduced for two successive steps: (a) initial estimation and (b) optimization of wavelet parameters. We call this algorithm quantum swarm evolutionary matching pursuit. Quantum swarm evolutionary matching pursuit starts with a small colony of population at which each individual, is potentially a transformed form of a time-frequency atom. To attain maximum pursuit of the potential candidate wavelets with the residual, the colony members are adjusted in an evolutionary way. In addition, the quantum computing concepts such as quantum bit, quantum gate, and superposition of states are introduced into the method. The algorithm parameters such as social and cognitive learning factors, population size and global migration period are optimized using seismic signals. In applying matching pursuit to geophysical data, typically complex trace attributes are used for initial estimation of wavelet parameters, however, in this study it was shown that using complex trace attributes are sensitive to noisy data and would have lower rate of convergence. The algorithm performance over noisy signals, using non-orthogonal dictionaries are investigated and compared with other methods such as orthogonal matching pursuit. The results illustrate that quantum swarm evolutionary matching pursuit has the least sensitivity to noise and higher rate of convergence. Finally, the algorithm is applied to both modelled seismograms and real data for detection of low frequency anomalies to validate the findings. |
| |
| Keywords: | Time-frequency analysis Algorithm Optimization |
|
|
