Journal of Northeastern University(Natural Science) ›› 2021, Vol. 42 ›› Issue (2): 189-195.DOI: 10.12068/j.issn.1005-3026.2021.02.006

• Information & Control • Previous Articles     Next Articles

Weak-Selection Backtracking Matching Pursuit Algorithm Based on Dice Coefficient

JI Ce, WANG Jin-zhi, GENG Rong   

  1. School of Computer Science & Engineering, Northeastern University, Shenyang 110169, China.
  • Received:2020-04-10 Revised:2020-04-10 Accepted:2020-04-10 Published:2021-03-05
  • Contact: WANG Jin-zhi
  • About author:-
  • Supported by:
    -

Abstract: In order to further improve the success rate and accuracy of reconstruction of the compressed sensing reconstruction algorithm, a weak-selection backtracking matching pursuit based on Dice coefficient(DWBMP) algorithm is proposed from the perspective of atomic matching criteria and pre-selection stage’s atom selection methods. First, the Dice coefficient matching criterion is used to measure the similarity between two vectors, and the best matching atom is selected to optimize the support set. Then, the backtracking idea is combined with weak-selection idea to eliminate the atoms with small similarity, thus completing the secondary selection of the atoms in the pre-selection stage. The MATLAB simulation results show that under the same conditions, the DWBMP algorithm has better success rate and accuracy of reconstruction than the classic compressed sensing reconstruction algorithm.

Key words: compressed sensing; reconstruction algorithm; greedy algorithm; matching criteria; Dice coefficient; secondary selection

CLC Number: