References

• 1. 1)
     • 31. Giryes, R., Elad, M.: ‘Iterative hard thresholding with near optimal projection for signal recovery’. Proc. of the 10th Int. Conf. on Sampling Theory and Applications, 2013, pp. 212–215.
  2. 2)
     • 22. Chen, L., Gu, Y.: ‘Oracle-order recovery performance of greedy pursuits with replacement against general perturbations’, IEEE Trans. Signal Process., 2013, 61, (18), pp. 4625–4636.
  3. 3)
     • 8. Blanchard, J., Tanner, J., Wei, K.: ‘CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion’, Information and Inference, 2015, 4, (4), pp. 289–327.
  4. 4)
     • 21. Ding, J., Chen, L., Gu, Y.: ‘Perturbation analysis of orthogonal matching pursuit’, IEEE Trans. Signal Process., 2013, 61, (2), pp. 398–410.
  5. 5)
     • 24. Wang, D., Liu, H., Ding, F.: ‘Highly efficient identification methods for dual-rate hammerstein systems’, IEEE Trans.Control Syst.Technol., 2015, 23, (5), pp. 1952–1960.
  6. 6)
     • 5. Wang, J., Kwon, S., Shim, B.: ‘Generalized orthogonal matching pursuit’, IEEE Trans. Signal Process., 2012, 60, (12), pp. 6202–6216.
  7. 7)
     • 13. Candès, E., Eldar, Y., Needell, D., et al: ‘Compressed sensing with coherent and redundant dictionaries’, Appl. Comput. Harmon. Anal., 2011, 31, (1), pp. 59–73.
  8. 8)
     • 9. Wei, K.: ‘Fast iterative hard thresholding for compressed sensing’, IEEE Signal Process. Lett., 2015, 22, (5), pp. 593–597.
  9. 9)
     • 1. Candès, E.J., Romberg, J., Tao, T.: ‘Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information’, IEEE Trans. Inf. Theory, 2006, 52, (2), pp. 489–509.
  10. 10)
      • 10. Candès, E., Tao, T.: ‘Decoding by linear programming’, IEEE Trans. Inf. Theory, 2005, 51, (12), pp. 4203–4215.
  11. 11)
      • 11. Giryes, R., Needell, D.: ‘Near oracle performace and block analysis of signal space greedy methods’, J. Approx. Theory, 2015, 194, pp. 157–174.
  12. 12)
      • 27. Gu, Y., Ding, F., Li, J.: ‘State filtering and parameter estimation for linear systems with d-step state-delay’, IET Signal Process., 2014, 8, (6), pp. 639–646.
  13. 13)
      • 6. Foucart, S.: ‘Hard thresholding pursuit: an algorithm for compressive sensing’, SIAM J. Numer. Anal., 2011, 49, (6), pp. 2543–2563.
  14. 14)
      • 19. Davenport, M., Needell, D., Wakin, M.: ‘Signal space CoSaMP for sparse recovery with redundant dictionaries’, IEEE Trans. Inf. Theory, 2013, 59, (10), pp. 6820–6829.
  15. 15)
      • 25. Wang, X., Ding, F.: ‘Recursive parameter and state estimation for an input nonlinear state space system using the hierarchical identification principle’, Signal Process., 2015, 117, pp. 208–218.
  16. 16)
      • 3. Dai, W., Milenkovic, O.: ‘Subspace pursuit for compressive sensing signal reconstruction’, IEEE Trans. Inf. Theory, 2009, 55, (5), pp. 2230–2249.
  17. 17)
      • 28. Hegde, C., Indyk, P., Schmidt, L.: ‘Approximation-tolerant model-based compressive sensing’. Proc. 25th ACM-SIAM Annual Symp. Discrete Algorithms (SODA), 2014, pp. 1544–1561.
  18. 18)
      • 7. Blumensath, T., Davies, M: ‘Normalized iterative hard thresholding: Guaranteed stability and performance’, IEEE Journal of selected topics in signal processing, 2010, 4, (2), pp. 298–309.
  19. 19)
      • 12. Chen, X., Wang, H., Wang, R.: ‘A null space analysis of the ℓ1-synthesis method in dictionary-based compressed sensing’, Appl. Comput. Harmon. Anal., 2014, 37, (3), pp. 492–515.
  20. 20)
      • 2. Tropp, J.: ‘Greed is good: algorithmic results for sparse approximation’, IEEE Trans. Inf. Theory, 2004, 50, (10), pp. 2231–2242.
  21. 21)
      • 20. Giryes, R., Needell, D.: ‘Greedy signal space methods for incoherence and beyond’, Appl. Comput. Harmon. Anal., 2015, 39, (1), pp. 1–20.
  22. 22)
      • 16. Lin, J., Li, S.: ‘Sparse recovery with coherent tight frame via analysis Dantzig selector and analysis lasso’, Appl. Comput. Harmon. Anal., 2014, 37, (1), pp. 126–139.
  23. 23)
      • 14. Prater, A., Shen, L.: ‘Separation of undersampled composite signals using the Dantzig selector with overcomplete dictionaries’, IET Signal Process., 2015, 9, (3), pp. 226–234.
  24. 24)
      • 18. Aldroubi, A., Chen, X., Powell, A.: ‘Perturbations of measurement matrices and dictionaries in compressed sensing’, Appl. Comput. Harmon. Anal., 2012, 33, (1), pp. 282–291.
  25. 25)
      • 15. Rauhut, H., Schnass, K., Vandergheynst, P.: ‘Compressed sensing with coherent dictionaries’, IEEE Trans. Inf. Theory, 2008, 54, (5), pp. 2210–2219.
  26. 26)
      • 26. Ding, F., Duan, H.: ‘Two-stage parameter estimation algorithms for Box-Jenkins systems’, IET Signal Process., 2013, 7, (8), pp. 646–654.
  27. 27)
      • 29. Kyrillidis, A., Cevher, V.: ‘Sublinear time, approximate model-based sparse recovery for all’. arxiv:1203.4746 [cs.IT], 2012.
  28. 28)
      • 17. Shen, Y., Han, B., Braverman, E.: ‘Stable recovery of analysis based approaches’, Appl. Comput. Harmon. Anal., 2015, 39, (1), pp. 161–172.
  29. 29)
      • 30. Blumensath, T.: ‘Sampling and reconstructing signals from a union of linear subspaces’, IEEE Trans. Inf. Theory, 2011, 57, (7), pp. 4660–4671.
  30. 30)
      • 23. Ding, F., Wang, Y., Ding, J.: ‘Recursive least squares parameter identification algorithms for systems with colored noise using the filtering technique and the auxilary model’, Digit. Signal Process., 2015, 37, pp. 100–108.
  31. 31)
      • 4. Needell, D., Tropp, J.: ‘CoSaMP: iterative signal recovery from in-complete and inaccurate samples’, Appl. Comput. Harmon. Anal., 2009, 26, (3), pp. 301–321.