1. 陕西师范大学计算机科学学院,陕西,西安,710062
2. 中国科学院深圳先进技术研究院生物医学与健康工程研究所,广东,深圳,518055
3. 陕西师范大学计算机科学学院,陕西,西安,710062
4. 中国科学院深圳先进技术研究院生物医学与健康工程研究所,广东,深圳,518055
网络出版:2019-10-25,
纸质出版:2019
移动端阅览
范虹, 张程程, 侯存存, 等. 结合双树复小波变换和改进密度峰值快速搜索聚类的乳腺MR图像分割[J]. 电子学报, 2019,47(10):2149-2157.
FAN Hong, ZHANG Cheng-cheng, HOU Cun-cun, et al. Dual-Tree Complex Wavelet Transform and Improved Density Peak Fast Search and Clustering Method for Breast MR Image Segmentation[J]. Acta Electronica Sinica, 2019, 47(10): 2149-2157.
范虹, 张程程, 侯存存, 等. 结合双树复小波变换和改进密度峰值快速搜索聚类的乳腺MR图像分割[J]. 电子学报, 2019,47(10):2149-2157. DOI: 10.3969/j.issn.0372-2112.2019.10.017.
FAN Hong, ZHANG Cheng-cheng, HOU Cun-cun, et al. Dual-Tree Complex Wavelet Transform and Improved Density Peak Fast Search and Clustering Method for Breast MR Image Segmentation[J]. Acta Electronica Sinica, 2019, 47(10): 2149-2157. DOI: 10.3969/j.issn.0372-2112.2019.10.017.
针对乳腺MR图像组织复杂、灰度不均匀、难分割的特点,本文提出双树复小波(DTCWT)变换结合密度聚类的图像分割方法.首先利用复小波域双变量模型结合各向异性扩散函数对图像进行去噪处理;进而通过简单线性迭代聚类(SLIC)算法将图像划分成一定数量的超像素区域,根据事先设置的阈值搜索每个超像素的近邻,从而降低基于K近邻的密度峰值快速搜索聚类(KNN-DPC)算法寻找每个样本近邻的时间;最终,引入超像素区域的近邻信息度量样本密度,采用KNN-DPC算法的分配策略自适应聚类.仿真和临床数据分割结果表明,所提算法能有效的实现乳腺MR图像的分割.
Breast MR image segmentation is difficult because of complex organization and intensity inhomogeneity. This paper proposes a segmentation method based on dual-tree complex wavelet transform and density clustering. Firstly
the image is denoised by using complex wavelet domain bivariate model combined with anisotropic diffusion function; Then simple linear iterative clustering (SLIC) algorithm is used to obtain the neighbors of each superpixel
thereby reducing the time of searching for the nearest neighbor of each sample in KNN-DPC algorithm. Finally
nearest neighbor sample density information of superpixel region is introduced
and distribution strategies from KNN-DPC algorithm are used for adaptive clustering. The segmentation results of simulation and clinical data show that the proposed algorithm can segment breast MR images effectively.
0
浏览量
183
下载量
7
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621