摘要
针对传统的显著区域的分割方法存在的频谱泄露、无法达到亚像素精度的问题,提出了一种新的基于显著性区域的图像分割算法。利用Lucas-Kanade图像配准算法对大量重复出现模式的最小周期进行估计,从而准确地重建出背景模型;在此基础上,提出了"广义邻域点"的方法,设计自适应尺度的中值滤波器完成前景分量的精确分割;并提出了快速中值滤波器的设计方法,显著降低了计算复杂度。实验证明了该算法能够准确、高效地分割图像,适用于大量重复背景中前景目标的提取。
To overcome problems existing in traditional segmentation methods based on salient regions （such as spectral leakage, unreached subpixel accuracy）, this paper proposes a novel segmentation algorithm based on salient regions. First, we utilize the Lucas-Kanade registration method to estimate the minimal period of a large of recurring patterns, where the background model can be reconstructed accurately. Second, “generalized neighboring pixels”are proposed, based on which the median filter with adaptive size is designed for extracting the foreground. Finally, we speed up the traditional median filter to reduce the complexity significantly. Experimental results demonstrate the algorithm deals with the segmentation task precisely and efficiently, which is suitable for extracting the foreground from images with a large of recurring patterns.
出处
《火力与指挥控制》
CSCD
北大核心
2016年第7期48-51,共4页
Fire Control & Command Control
基金
广东省自然科学基金-博士科研启动项目(2014A030310380)
国家教育部重点课题(GJA104009)
东莞职业技术学院重大教学改革基金资助项目(JGZBXM2013002)
关键词
图像分割
显著性区域
中值滤波
金字塔模型
双线性插值
image segmentation
salient regions
median filter
pyramid model
bi-linear interpolation
作者简介
房晓东（1979-）,女,辽宁辽阳人,硕士,副教授.研究方向：计算机技术等.
