- Yanting Li, Liming Zhang, Tao Qian, “2D Partial Unwinding—A Novel Non-Linear Phase Decomposition of Images”, IEEE Trans. on Image Process., 28, № 10, 2019, 4762
- Chady Ghnatios, 2016 3rd International Conference on Advances in Computational Tools for Engineering Applications (ACTEA), 2016, 131
- A. Çivril, “Sparse approximation is provably hard under coherent dictionaries”, Journal of Computer and System Sciences, 84, 2017, 32
- Eugene D. Livshitz, Vladimir N. Temlyakov, “Sparse Approximation and Recovery by Greedy Algorithms”, IEEE Trans. Inform. Theory, 60, № 7, 2014, 3989
- Lin Xu, Shaobo Lin, Jinshan Zeng, Xia Liu, Yi Fang, Zongben Xu, “Greedy Criterion in Orthogonal Greedy Learning”, IEEE Trans. Cybern., 48, № 3, 2018, 955
- Martin Ehler, Massimo Fornasier, Juliane Sigl, “Quasi-linear Compressed Sensing”, Multiscale Model. Simul., 12, № 2, 2014, 725
- Shaobo Lin, Yuanhua Rong, Xingping Sun, Zongben Xu, “Learning Capability of Relaxed Greedy Algorithms”, IEEE Trans. Neural Netw. Learning Syst., 24, № 10, 2013, 1598
- K. T. Poumai, S. K. Kaushik, 2017 International Conference on Sampling Theory and Applications (SampTA), 2017, 212
- Jian Fang, Shaobo Lin, Zongben Xu, “Learning and approximation capabilities of orthogonal super greedy algorithm”, Knowledge-Based Systems, 95, 2016, 86
- Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “Об эффективности ортогонального жадного алгоритма в задаче о сжатых измерениях”, Матем. сб., 203, № 2, 2012, 33