For the extremely high complexity of usual algorithms for sparse decomposition, a new group matching pursuit algorithm is presented based on a redundant dictionary with several orthonormal bases.
针对目前冗余字典下信号稀疏分解常用算法计算复杂度高的问题,提出一种分组匹配追踪算法。
For the extremely high complexity of usual algorithms for sparse decomposition, a new group matching pursuit algorithm is presented based on a redundant dictionary with several orthonormal bases.
针对目前冗余字典下信号稀疏分解常用算法计算复杂度高的问题,提出一种分组匹配追踪算法。
应用推荐