期刊文献+

基于区域的活动轮廓图像分割模型的变步长优化算法

A variable step-size optimization algorithm based on active contour model
原文传递
导出
摘要 基于偏微分方程图像分割的活动轮廓模型,基本思想是将图像分割归结为最小化一个封闭曲线的能量泛函,图像分割问题实质上是一个无约束最优化问题.传统最小化算法的数值实现过程中采用固定时间步长的方法,时间步长选取较大,迭代过程容易出现震荡现象影响分割结果,而时间步长选取较小,又会减慢收敛速度.利用Wolfe-Powell线搜索方法,提出了一种变时间步长的优化算法,在迭代过程中根据搜索方向自动调整时间步长大小,有效克服了固定时间步长出现的震荡现象和收敛速度慢的问题. The basic idea of PDE- based image segmentation based on the active contour model is to minimize the energy functional on a closed curve. Thus,the image segmentation problem is in essence an unconstrained optimization problem. The traditional minimization uses,a fix time step which may produce some problems. The large time step may lead to the oscillation of energy functional,while the small time step will slow down the convergence speed. A variable step- size method is proposed by using the Wolfe- Powell line search method. Our method will adjust time step at each iteration according to the search direction which effectively overcome the oscillation of energy functional and the defect on convergence speed.
出处 《福州大学学报(自然科学版)》 CAS 北大核心 2016年第3期419-423,共5页 Journal of Fuzhou University(Natural Science Edition)
基金 国家自然科学基金资助项目(11071270)
关键词 图像分割 非精确线搜索 活动轮廓 时间步长 image segmentation inexact line search active contour time step
  • 相关文献

参考文献8

  • 1KASS M, WITKIN A, TERZOPOULOS D. Snakes: active contour models[ J]. International Journal of Computer Vision, 1988, 1(4): 321 -331.
  • 2MUMFORD D, StlAH J. Optimal approximation by piece - wise smooths functions and associated variational problems [ J ]. Communications on Pure and Applied Mathematies, 1989, 42(5) : 677 - 685.
  • 3CHAN T F, VESE L A. Active contours without edges[J]. Image Processing, IEEE Transactions on, 2001, 10(2) : 266 -277.
  • 4LI C, KAO C Y, GORE J C, e! al. Implicit active contours driven by local binary fitting energy[ C]//Computer Vision and Pattern Recognition. Minneapolis: IEEE Conference Publieations, 2007:1 -7.
  • 5GOI,DSTEIN T, BRESSON X, OSHER S. Geometric applications of the split Bregman method : segmentation and surface recon- struction[ J]. Journal of Scientific Computing, 2010, 45(1/2/3) : 272 -293.
  • 6CHANT F, ESEDOGLU S, NIKOLOVA M. Algorilhms tbr finding glohal minimizers of image segmentalion and denoising models[J]. SIAM Journal on Applied Mathematics, 2006, 66(5) : 1 632 - 1 648.
  • 7BOYD S P, VANDENBERGHE I,. Convex optimization[ M]. Cambridge: Cambridge University Press, 2004.
  • 8朱训芝,唐焕文.一种新的无约束优化线搜索算法[J].运筹与管理,2005,14(5):18-23. 被引量:5

二级参考文献8

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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