检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汤伟[1,2] 王权 刘嫣[1] 王玲利 Tang Wei;Wang Quan;Liu Yan;Wang Lingli(College of Electrical and Information Engineering,Shaanxi University of Science and Technology,Xi’an 710021,Shaanxi,China;Institute of Industrial Automation,Shaanxi University of Science and Technology,Xi’an 710021,Shaanxi,China)
机构地区:[1]陕西科技大学电气与信息工程学院,陕西西安710021 [2]陕西科技大学工业自动化研究所,陕西西安710021
出 处:《计算机应用与软件》2019年第10期293-298,共6页Computer Applications and Software
基 金:陕西省重点科技创新团队计划项目(2014KCT-15);陕西省科技统筹创新工程计划项目(2012KTCQ01-19)
摘 要:心电信号的采集、传输在医学研究心脏性疾病具有重要意义,利用稀疏分解方法对其进行去噪仍存在诸多问题。针对广义正交匹配追踪(Generalized Orthogonal Matching Pursuit,GOMP)算法选择字典原子时在残差取值最小的非最优性,以及在稀疏信号过程中选择过多原子导致的重构精度问题,提出一种新的优化算法。通过增加阈值的方式来根据噪声干扰程度不同实现迭代次数的变化。利用Jaccard系数相似性来替换GOMP算法中内积余弦算法准测,优化了字典矩阵与残差匹配原子的方式。实验结果表明,改进GOMP算法明显提高了信噪比,且均方根误差最低,在时效性上达到最优。The acquisition and transmission of ECG signals are of great significance in the medical research of cardiac diseases.There are still many problems in denoising by sparse decomposition method.Aiming at the non-optimality of the minimum residual value when selecting dictionary atoms in the generalized orthogonal matching pursuit algorithm and the reconstruction accuracy caused by choosing too many atoms in the sparse signal process,we proposed a new optimization algorithm.The number of iterations was changed according to the degree of noise interference by increasing the threshold.The similarity of Jaccard coefficients was used to replace the inner product cosine algorithm in GOMP algorithm and the method of matching atoms with dictionary matrix and residual was optimized.The experimental results show that the improved GOMP algorithm significantly improves the signal-to-noise ratio,and the root mean square error is the lowest and the timeliness is the best.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.45.232