Research on Medical Image Clustering Based on Approximate Density Function

Song Yuqing; Xie Conghua; Zhu Yuquan; Li Cunhua; Chen Jianmei; Wang Lijun

Journal of Computer Research and Development > 2006 > 43(11): 1947-1952.

Song Yuqing, Xie Conghua, Zhu Yuquan, Li Cunhua, Chen Jianmei, Wang Lijun. Research on Medical Image Clustering Based on Approximate Density Function[J]. Journal of Computer Research and Development, 2006, 43(11): 1947-1952.

Citation:

PDF (516 KB)

Research on Medical Image Clustering Based on Approximate Density Function

1(School of Computer Science and Communications Engineering, Jiangsu University, Zhenjiang 212013) 2(Department of Computer Science , Changshu Institute of Technology, Changshu 215500) 3(Department of Computer Science, Huaihai Institute of Technology, Lianyungang 222005)

More Information

Published Date: November 14, 2006

Graphical Abstract

Abstract

Abstract

It is difficult to represent and cluster medical image data by mathematic model. In order to address this problem, an medical image clustering analysis method based on approximate density function is designed. This method uses kernel density estimation model to construct the approximate density function, and takes hill climbing strategy to extract clustering patterns. Results of experiments show that it can achieve good effect on real human abdomen medical images.
- density estimation,
- medical image,
- clustering analysis,
- hill climbing

FullText(HTML)

References (0)

[1]	Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
[2]	Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
[3]	Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
[4]	Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
[5]	Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
[6]	Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
[7]	Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
[8]	Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
[9]	Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
[10]	Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.