期刊文献+

基于拟合的亚像素边缘检测的算法比较 被引量:7

Comparison of Algorithms for Sub-pixel Edge Detection Based on Fitting
下载PDF
导出
摘要 针对传统的边缘检测算法精度不高,提出了基于不同核函数的最小二乘拟合的亚像素边缘检测算法。采用Canny算子对图像边缘进行粗定位,再以基于梯度幅值拟合的高斯函数与基于灰度值拟合的反正切函数和双曲正切函数作为拟合核函数,对一幅拍有标准量块图像的边缘进行检测,结果表明该算法能够有效的进行亚像素边缘检测。 In view of the inaccuracy edge detection of traditional algorithm,the sub-pixel edge detection algorithm based on least square fitting different kernel functions is proposed.It adopts Canny operator for the coarse positioning of the image edge,and combines Gauss’ s function based on the gradient amplitude fitting and inverse tangent function and hyperbolic tangent function based on gray value fitting as kernel fitting function.By detecting an image edge with standard gauge,the results show that the sub-pixel edge detection algorithm can perform a sub-pixel edge detection effectively.
作者 王楚 王亚刚
出处 《软件导刊》 2018年第2期60-62,67,共4页 Software Guide
关键词 亚像素边缘检测 CANNY算子 最小二乘拟合 核函数 sub-pixel edge detection Canny operator the least squares fitting kernel function
  • 相关文献

参考文献3

二级参考文献47

  • 1赵卓翔,王轶彤,田家堂,周泽学.社会网络中基于标签传播的社区发现新算法[J].计算机研究与发展,2011,48(S3):8-15. 被引量:37
  • 2Newman M E J. Detecting community structure in networks[J]. Eur. Phys. J. B, 2004(38): 321-330.
  • 3Wang X H, Jiao L C, Wu J S. Adjusting from disjoint to overlapping community detection of complex networks[J ]. Physica A, 2009(388) : 5045 - 5056.
  • 4Clauset A, Newman M E J, Moore C. Finding community structure in very large networks[J ]. Phys. Rev. E, 2004 (70): 066111.
  • 5BlondEL V D, Guillaume J L, Lambiotte R, et al. Fast unfolding of communities in large networks [J ]. J. Stat.Mech., 2008(10): 10008.
  • 6Evans T S, Lambiotte R. Line graphs, link partitions and overlapping communities[ J ]. Phys. Rev. E, 2009 ( 80 ) : 016105.
  • 7Newman M E J, Girvan M. Finding and evaluating community structure in networks[ J ]. Phys. Rev. E, 2004 (6) : 026113.
  • 8Shen H W, Cheng X Q, Cai K, et al. Detect overlapping and hierarchical community structure in networks [J]. Physica A,2009(388) : 1706 - 1712.
  • 9Nicosia V, Mangioni G, Carchiolo V, et al. Extending the definition of modularity to directed graphs with overlapping communities[J]. J. Stat. Mech., 2009(03):03024.
  • 10Gregory S. A fast algorithm to find overlapping communities in networks [ C ]//Springer, HeidELberg. Machine Lemming and Knowledge Discovery in Databases, 2008: 408 423.

共引文献10

同被引文献83

引证文献7

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部