Segmentation for extended target in complex backgrounds based on clustering and fractal

ZHANG Kun-hua; YANG Xuan

doi:null

您当前的位置：

首页 >

文章列表页 >

Segmentation for extended target in complex backgrounds based on clustering and fractal

Article | 更新时间：2020-08-12

- Segmentation for extended target in complex backgrounds based on clustering and fractal
- Optics and Precision Engineering Vol. 17, Issue 7, Pages: 1665-1671(2009)
- 作者机构：
  
  深圳大学信息工程学院,广东深圳,518060
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Received：15 August 2008，
  
  Revised：09 October 2008，
  
  Published Online：25 July 2009，
  
  Published：25 July 2009
- 稿件说明：
移动端阅览
张坤华, 杨烜. 应用聚类和分形实现复杂背景下的扩展目标分割[J]. 光学精密工程, 2009,17(7): 1665-1671

ZHANG Kun-hua, YANG Xuan. Segmentation for extended target in complex backgrounds based on clustering and fractal[J]. Editorial Office of Optics and Precision Engineering, 2009,17(7): 1665-1671
张坤华, 杨烜. 应用聚类和分形实现复杂背景下的扩展目标分割[J]. 光学精密工程, 2009,17(7): 1665-1671 DOI：

ZHANG Kun-hua, YANG Xuan. Segmentation for extended target in complex backgrounds based on clustering and fractal[J]. Editorial Office of Optics and Precision Engineering, 2009,17(7): 1665-1671 DOI：

摘要

将K-均值聚类方法与分形理论相结合

提出了一种分两个阶段对扩展目标进行分割的方法。在预分割阶段

运用粗糙集理论求取初始聚类中心

在K-均值聚类分割和区域连通的基础上

检测图像边缘并进行边界跟踪

对于获得的目标和背景团块根据扩展目标特性确定目标潜在区域。在进一步分割阶段

给出图像分维数随尺度变化的函数

利用自适应阈值

根据分形理论的尺度不变性进一步抑制预分割结果中的自然背景

并运用形态学开运算消除背景粘连。实验表明该方法能有效并可靠地实现复杂背景下扩展目标的精确分割

分割出的扩展目标轮廓细节保持良好。

Abstract

A new segmentation algorithm which was divided into two steps was proposed for an extended target in complex backgrounds by utilizing the K-means clustering and fractal theory. Firstly

the K-means clustering algorithm was improved by using the rough set theory to determine initial cluster centroids. On the basis of K-means clustering segmentation and region connection

the edges of the target and backgrounds were extracted accurately and intactly. After boundary tracking

the potential target regions were detected according to the characteristics of the extended target. Secondly

by giving the function of a fractal dimension changing with the scale

the natural backgrounds in potential target regions were removed by the fractal scale invariance. Then

the background conglutination was eliminated by a mathematical morphology method. The experimental results indicate that the algorithm can segment the extended target in complex backgrounds correctly and reliably

and the segmented target reserves a good contour.

关键词

Keywords

references

彭真明,蒋彪,肖峻. 基于脉冲耦合神经网络的空中扩展目标检测 [J]. 强激光与粒子束,2007,19(12):2011-2016. PENG ZH M, JIANG B, XIAO J. Aerial extended target detection based on unit-linking pulse coupled neural networks [J]. High Power Laser and Particle Beams, 2007,19(12):2011-2016. (in Chinese)[2] 孔刚,张启衡. 复杂背景下扩展目标多尺度小波分割策略 [J]. 光电子激光,2004,15(2):216-220. KONG G, ZHANG Q H. Mutiscale wavelet based segmentation of extended target in complex environment [J]. Journal of OptoelectronicsLaser , 2004,15(2):216-220. (in Chinese)[3] 宿丁,张启衡,谢盛华. 复杂背景下扩展目标双尺度分形分割算法 [J]. 仪器仪表学报,2006,27(6):2103-2106. SU D,ZHANG Q H,XIE SH H. Double-scale fractal segmentation for extended target in complex background [J]. Chinese Journal of Scientific Instrument, 2006,27(6):2103-2106. (in Chinese)[4] 刘韬,蔡淑琴,曹丰文,等. 基于距离浓度的K-均值聚类算法[J]. 华中科技大学学报(自然科学版), 2007,35(10):50-52. LIU T, CAI SH Q, CAO F W, et al.. K-means clustering algorithm based on distance concentration [J]. Journal of Huazhong University of Science and Technology Nature Science, 2007,35(10):50-52.(in Chinese)[5] 刘艳丽,刘希. 一种基于密度的K-均值算法[J]. 计算机工程与应用, 2007,43(32):153-155. LIU Y L, LIU X. K-means clustering algorithm based on density [J]. Computer Engineering and Applications, 2007,43(32):153-155.(in Chinese)[6] 边肇棋,张学工.模式识别[M]. 北京:清华大学出版社,2000. BIAN ZH Q, ZHANG X G. Pattern Recognition [M]. Beijing: Qinghua University Press, 2000. (in Chinese)[7] 邵锐,巫兆聪,钟世明. 基于粗糙集的K-均值聚类算法在图像分割中的应用[J]. 测绘信息与工程,2005,30(5):1-2. SHAO R, WU ZH C, ZHONG SH M. Application of rough sets and k-means clustering to image segmentation [J].Journal Geomatics, 2005,30(5):1-2. (in Chinese)[8] 王国胤. Rough集理论与知识获取 [M]. 西安:西安交通大学出版社,2001. WANG G Y. Rough Set Theory and Knowledge Acquisition [M]. Xi'an: Xi'an Jiaotong University press, 2001. (in Chinese)[9] 史册. 对一种快速边缘跟踪算法的讨论 [J]. 小型微型计算机系统, 2002,12(6):641-645. SHI C. A discussion of a fast algorithm for boundary tracking [J]. Minicomputer System, 2002,12(6):641-645. (in Chinese)[10] PENTLAND A. Fractal-based description of natural scenes [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984,6(6):661-674.[11] PELEG S. Multiple resolution texture analysis and classification [J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984,6(4):518-523.

Views

540

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Computed tomography image segmentation of cell pole piece via strip attention mechanism

Sand microscopic image segmentation with enhanced tuna swarm optimization exponential entropy

Brain tumor image segmentation based on Semantic Flow Guided Sampling and Attention Mechanism

Automatic segmentation of aggregate images with MET optimized by chaos SSA

Skin lesion segmentation based on high-resolution composite network

Related Author

LIU Zefang

LONG Chao

LIU Xueshuan

HAN Yan

TAN Chuandong

TAN Hui

DUAN Liming

WANG Mengfei

Related Institution

Project Management Center， Equipment Department of Rocket Force

College of Optoelectronic Engineering， Chongqing University

ICT Research Center， Key Laboratory of Optoelectronic Technology and Systems of Ministry of Education， Chongqing University

College of Information， Chang'an University

School of Electrical and Electronic Engineering， Wenzhou University

AI问答

Address：No.3888 Dong Nanhu Road, Changchun, Jilin, China Postal code：130033
Tel：0431-86176855 Email：gxjmgc@ciomp.ac.cn
Technical support is provided by Beijing Founder electronics co., LTD 吉ICP备11002662号-17 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰