直流输电线路故障行波波速不确定、波头提取困难以及噪声干扰等因素制约了直流电网中故障测距技术的应用。为了降低上述因素对定位准确性的影响,提出一种基于局部特征有理样条插值均值分解(LMD based on characteristic rational spline...直流输电线路故障行波波速不确定、波头提取困难以及噪声干扰等因素制约了直流电网中故障测距技术的应用。为了降低上述因素对定位准确性的影响,提出一种基于局部特征有理样条插值均值分解(LMD based on characteristic rational spline,CRS-LMD)和奇异值分解(singular value decomposition,SVD)的故障测距方法。首先,利用特征尺度选取最优极点系数,结合有理样条插值调节拟合曲线的松紧程度,实现对故障电压行波的局部均值分解。其次,采用奇异值分解对故障行波波头进行准确提取。最后,在PSCAD/EMTDC中搭建了张北±500 kV柔性直流电网的仿真模型,模拟各种故障情况并输出故障数据,利用Matlab对故障数据进行处理并验证定位算法。最后,仿真结果表明,所提故障测距算法在不同故障距离和故障类型下均能实现故障测距,且在叠加噪声和过渡电阻的情况下也能保障较高的精确性。展开更多
针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别...针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。展开更多
针对移动机器人噪声模型不确定性导致定位算法鲁棒性弱、精度低的问题,提出一种基于奇异值分解(Singular Value Decomposition,SVD)的自适应无迹H_(∞)滤波定位算法。该算法利用无迹H_(∞)滤波融合多传感器数据估计移动机器人位姿,并通...针对移动机器人噪声模型不确定性导致定位算法鲁棒性弱、精度低的问题,提出一种基于奇异值分解(Singular Value Decomposition,SVD)的自适应无迹H_(∞)滤波定位算法。该算法利用无迹H_(∞)滤波融合多传感器数据估计移动机器人位姿,并通过自适应调节滤波器参数γ,提高了移动机器人的定位精度。同时为了提高算法的鲁棒性,采用SVD分解代替常规Cholesky分解,避免了误差协方差矩阵在数值迭代过程中出现负定的情况。实验结果表明:相较于扩展H_(∞)滤波和粒子滤波算法,基于SVD分解的自适应无迹H_(∞)滤波定位算法具有精度高、鲁棒性强的优势。展开更多
Artificial Intelligence(AI)is being increasingly used for diagnosing Vision-Threatening Diabetic Retinopathy(VTDR),which is a leading cause of visual impairment and blindness worldwide.However,previous automated VTDR ...Artificial Intelligence(AI)is being increasingly used for diagnosing Vision-Threatening Diabetic Retinopathy(VTDR),which is a leading cause of visual impairment and blindness worldwide.However,previous automated VTDR detection methods have mainly relied on manual feature extraction and classification,leading to errors.This paper proposes a novel VTDR detection and classification model that combines different models through majority voting.Our proposed methodology involves preprocessing,data augmentation,feature extraction,and classification stages.We use a hybrid convolutional neural network-singular value decomposition(CNN-SVD)model for feature extraction and selection and an improved SVM-RBF with a Decision Tree(DT)and K-Nearest Neighbor(KNN)for classification.We tested our model on the IDRiD dataset and achieved an accuracy of 98.06%,a sensitivity of 83.67%,and a specificity of 100%for DR detection and evaluation tests,respectively.Our proposed approach outperforms baseline techniques and provides a more robust and accurate method for VTDR detection.展开更多
When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain ada...When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.展开更多
文摘直流输电线路故障行波波速不确定、波头提取困难以及噪声干扰等因素制约了直流电网中故障测距技术的应用。为了降低上述因素对定位准确性的影响,提出一种基于局部特征有理样条插值均值分解(LMD based on characteristic rational spline,CRS-LMD)和奇异值分解(singular value decomposition,SVD)的故障测距方法。首先,利用特征尺度选取最优极点系数,结合有理样条插值调节拟合曲线的松紧程度,实现对故障电压行波的局部均值分解。其次,采用奇异值分解对故障行波波头进行准确提取。最后,在PSCAD/EMTDC中搭建了张北±500 kV柔性直流电网的仿真模型,模拟各种故障情况并输出故障数据,利用Matlab对故障数据进行处理并验证定位算法。最后,仿真结果表明,所提故障测距算法在不同故障距离和故障类型下均能实现故障测距,且在叠加噪声和过渡电阻的情况下也能保障较高的精确性。
文摘针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。
文摘针对移动机器人噪声模型不确定性导致定位算法鲁棒性弱、精度低的问题,提出一种基于奇异值分解(Singular Value Decomposition,SVD)的自适应无迹H_(∞)滤波定位算法。该算法利用无迹H_(∞)滤波融合多传感器数据估计移动机器人位姿,并通过自适应调节滤波器参数γ,提高了移动机器人的定位精度。同时为了提高算法的鲁棒性,采用SVD分解代替常规Cholesky分解,避免了误差协方差矩阵在数值迭代过程中出现负定的情况。实验结果表明:相较于扩展H_(∞)滤波和粒子滤波算法,基于SVD分解的自适应无迹H_(∞)滤波定位算法具有精度高、鲁棒性强的优势。
基金This research was funded by the National Natural Science Foundation of China(Nos.71762010,62262019,62162025,61966013,12162012)the Hainan Provincial Natural Science Foundation of China(Nos.823RC488,623RC481,620RC603,621QN241,620RC602,121RC536)+1 种基金the Haikou Science and Technology Plan Project of China(No.2022-016)the Project supported by the Education Department of Hainan Province,No.Hnky2021-23.
文摘Artificial Intelligence(AI)is being increasingly used for diagnosing Vision-Threatening Diabetic Retinopathy(VTDR),which is a leading cause of visual impairment and blindness worldwide.However,previous automated VTDR detection methods have mainly relied on manual feature extraction and classification,leading to errors.This paper proposes a novel VTDR detection and classification model that combines different models through majority voting.Our proposed methodology involves preprocessing,data augmentation,feature extraction,and classification stages.We use a hybrid convolutional neural network-singular value decomposition(CNN-SVD)model for feature extraction and selection and an improved SVM-RBF with a Decision Tree(DT)and K-Nearest Neighbor(KNN)for classification.We tested our model on the IDRiD dataset and achieved an accuracy of 98.06%,a sensitivity of 83.67%,and a specificity of 100%for DR detection and evaluation tests,respectively.Our proposed approach outperforms baseline techniques and provides a more robust and accurate method for VTDR detection.
基金supported by the National Natural Science Foundation of China (62206204,62176193)the Natural Science Foundation of Hubei Province,China (2023AFB705)the Natural Science Foundation of Chongqing,China (CSTB2023NSCQ-MSX0932)。
文摘When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.
