A Sparse Feature Extraction Method Based on Improved Quantum Evolutionary Algorithm

被引:0
|
作者
Yu F.-J. [1 ]
Liu Y.-C. [2 ]
机构
[1] School of Electric and Information Engineer, Zhongyuan University of Technology, Zhengzhou, 450007, Henan
[2] School of Mechanical-Electronic and Automobile Engineering, Wuhan Business University, Wuhan, 430056, Hubei
关键词
Feature extraction; Pattern recognition; Quantum evolutionary algorithms; Sparse decomposition;
D O I
10.15918/j.tbit1001-0645.2018.225
中图分类号
学科分类号
摘要
Feature extraction is the key to pattern recognition. Sparse decomposition can be used to express a signal as a combination of atoms with certain structural features, being an effective way to extract the internal feature information of the signal. A sparse feature extraction method based on improved quantum evolutionary algorithm (IQEA) was proposed based on the parallelism and global search ability of IQEA to achieve fast and accurate sparse decomposition of signals on an over-complete atom dictionary. Firstly, the atoms in the dictionary were coded with probabilistic amplitudes of quantum bits, and updated by evolution-mutation cross operation of quantum bits. And then, taking the inner products of signal residual and atoms as the objective function of quantum evolution, the most characteristic atoms with signal structure were selected, and the feature extraction of signals was realized based on sparse reconstruction. Finally, the feature extraction of simulation signal and fault bearing vibration signal were carried out. The results show the effectiveness and superiority of the proposed method. © 2020, Editorial Department of Transaction of Beijing Institute of Technology. All right reserved.
引用
收藏
页码:512 / 518
页数:6
相关论文
共 16 条
  • [1] Mallat S.G., Zhang Z., Matching pursuits with time-frequency dictionaries, IEEE Trans. on Signal Processing, 41, 12, pp. 3397-3415, (1993)
  • [2] Pati Y.C., Rezaiifar R., Krishnaprasad P.S., Orthogonal matching pursuit: recursive function approximation withapplications to wavelet decomposition, Conference Record of the Twenty-seventh Asilomar Conference on Signals, Systems and Computers, pp. 40-44, (1993)
  • [3] Yang B., Li S., Pixel-level image fusion with simultaneous orthogonal matching pursuit, Information Fusion, 13, 1, pp. 10-19, (2012)
  • [4] Chen S., Donoho D.L., Saunders M.A., Automic decomposition by basis pursuit SIAM, Journal on Scientific Computing, 19, 1, pp. 33-61, (1998)
  • [5] Xu S., Yang X., Jiang S., A fast nonlocally centralized sparse representation algorithm for image denoising, Signal Processing, 31, pp. 99-112, (2016)
  • [6] Ventura R.F.I., Vandergheynst P., Matching pursuit through genetic algorithms, (2001)
  • [7] Li C., Su Y., Zhang Y., Et al., Root imaging from ground penetrating radar data by CPSO-OMP compressed sensing, Journal of Forestry Research, 28, 1, pp. 155-162, (2017)
  • [8] Yang M., Liu N., Liu W., Image 1D OMP sparse decomposition with modified fruit-fly optimization algorithm, Cluster Computing, 20, 4, pp. 3015-3022, (2017)
  • [9] Han K.H., Kim J.H., Quantum-inspired evolutionary algorithm for a class of combinatorial optimization, IEEE Transactions on Evolutionary Computation, 6, 6, pp. 580-593, (2002)
  • [10] Lu F., Yang G., Wang S., Et al., The research on controlling the iteration of quantum-inspired evolutionary algorithms for artificial neural networks, Algorithmic Aspects in Information and Management, pp. 253-262, (2014)