Blind Recovery of Mixing Matrix with Sparse Sources Based on Improved K-means Clustering and Hough Transform

FU Ning; QIAO Li-yan; PENG Xi-yuan

您当前的位置：

首页 >

文章列表页 >

Blind Recovery of Mixing Matrix with Sparse Sources Based on Improved K-means Clustering and Hough Transform

更新时间：2025-07-16

- Blind Recovery of Mixing Matrix with Sparse Sources Based on Improved K-means Clustering and Hough Transform
- Acta Electronica Sinica Vol. 37, Issue S1, Pages: 92-96(2009)
- 作者机构：
  
  哈尔滨工业大学自动化测试与控制系, 哈尔滨工业大学, 3033信箱,黑龙江,哈尔滨,150080
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN911
- Published：2009
- 稿件说明：
移动端阅览
FU Ning, QIAO Li-yan, PENG Xi-yuan. Blind Recovery of Mixing Matrix with Sparse Sources Based on Improved K-means Clustering and Hough Transform[J]. Acta Electronica Sinica, 2009, 37(S1): 92-96.
DOI：

FU Ning, QIAO Li-yan, PENG Xi-yuan. Blind Recovery of Mixing Matrix with Sparse Sources Based on Improved K-means Clustering and Hough Transform[J]. Acta Electronica Sinica, 2009, 37(S1): 92-96. DOI：

摘要

混合矩阵的估计是稀疏源盲分离的关键组成部分

其估计精度直接影响到源信号的估计精度.本文首先针对K-means聚类算法依赖初始值选取的问题

将微分进化算法思想引入到K-means聚类算法中

提出了一种改进的K-means聚类算法.利用该算法

对稀疏源混合信号数据进行聚类

保证了聚类结果的鲁棒性.然后利用霍夫变换

对每一类数据的聚类中心进行修正

从而估计出混合矩阵

提高了混合矩阵的估计精度.仿真实验表明

相比于经典的稀疏源混合矩阵盲估计算法

本文算法具有更强的鲁棒性和更高的估计精度.

Abstract

Blind mixing matrix recovery is one of the most important steps in blind separation of sparse sources

which impacts significantly on the recovery accuracy of source signals.A novel improved K-means clustering algorithm is proposed based on differential evolution

to avoid the partial convergence problem of the K-means algorithm.The proposed algorithm is applied to allocate the sparse mixture data to several clusters

thus guaranteeing the robustness of the clustering.Then the cluster centers are amended through Hough transform to recover the mixing matrix.Experimental results show that the proposed mixing matrix recovery algorithm has advantages of high robustness and accuracy compared with conventional algorithms.

关键词

Keywords

references

Views

1500

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Honey-Bee Mating Optimization Clustering Algorithm

A Temporal-Pulse Amplitude Clustering-Based Unknown Radar Emitter Signal Sorting Method

Continuous Relation Extraction Technique Based on Dynamic Relational Prototypes

Pseudo-label Denoising and SAM Optimization for Large-scale Unsupervised Semantic Segmentation

Heuristic Clustering Algorithm Based on Sub-Game Perfect Equilibrium

Related Author

LUO Ke

LI Lian

ZHOU Bo-xiang

LIN Jin-jian

HUANG Ming-jun

SUN Hui-bo

LIN Zi-han

XIE Kai

Related Institution

Institute of Computer and Communication Engineering, Changsha University of Sciences and Technology

Deptment of Electronics and Communication Engineering, Sun Yat-sen University of China

The 29th Research Institute of China Electronics Technology Group Corporation

School of Computer Science, Chongqing University

Key Laboratory of Dependable Service Computing in Cyber Physical Society, Chongqing University

⁰