首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于二维相关性的图像分割及快速递推算法
引用本文:唐英干,关新平.基于二维相关性的图像分割及快速递推算法[J].铁道学报,2007,29(5):60-63.
作者姓名:唐英干  关新平
作者单位:燕山大学,电气工程学院,河北,秦皇岛,066004
基金项目:国家自然科学基金;河北省教育厅科研项目;扬州大学校科研和教改项目
摘    要:基于二维直方图提出了二维相关性的阈值分割算法。首先,通过邻域平均得到原始图像的平滑图像,由原始图像和平滑图像构造二维直方图,然后根据相关性最大准则选择最佳的二维阈值向量。由于该方法同时考虑了图像像素的灰度信息及其空间邻域信息,与一维阈值相比能得到更好的分割效果。同时为降低二维阈值算法的复杂性,提出了快速递推算法。该算法将二维相关性的计算写成递推形式,减少了大量的重复计算,使得算法的复杂性从O(L4)降低到O(L2),计算时间大为减少,有利于该算法的实时应用。

关 键 词:图像分割  相关性  快速递推算法
文章编号:1001-8360(2007)05-0060-04
修稿时间:2006-01-24

Two-dimensional Correlation Based Image Segmentation and Its Fast Recursive Algorithm
TANG Ying-gan,GUAN Xin-ping.Two-dimensional Correlation Based Image Segmentation and Its Fast Recursive Algorithm[J].Journal of the China railway Society,2007,29(5):60-63.
Authors:TANG Ying-gan  GUAN Xin-ping
Institution:School of Electrical Engineering, Yanshan University, Qinhuangdao 066004,China
Abstract:A two-dimensional correlation image thresholding algorithm is proposed on the basis of the two-dimensional histogram.First,a smoothed image is obtained using the neighbor smoothing technique.The two-dimensional histogram is constructed using the gray value and average gray value of a pixel.The two-dimensional threshold is obtained according to the maximum correlation criterion.Compared to the one-dimensional case,the two-dimensional correlation thresholding method can get better segmentation results,because it considers not only image-pixel gray information but also spatial neighbor information.To reduce computation complexity,a fast recursive algorithm is presented.In the fast recursive algorithm,the computation of two-dimensional correlation is written in the recursive form.Many repeated calculations are avoided.The computation complexity is reduced from O(L4) to O(L2).The computation time is also reduced dramatically.This facilitates the recursive algorithm application in the real-time image processing system.
Keywords:image segmentation  correlation  fast recursive algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号