一种图像分割的快速不动点算法

李伟斌; 易贤; 宋松和

doi:10.11999/JEIT150112

一种图像分割的快速不动点算法

doi: 10.11999/JEIT150112

基金项目:

国家自然科学基金(11172314)

计量
- 文章访问数: 1257
- HTML全文浏览量: 147
- PDF下载量: 735
- 被引次数: 0
出版历程
- 收稿日期: 2015-01-20
- 修回日期: 2015-05-11
- 刊出日期: 2015-10-19

Fast Fixed-point Algorithm for Image Segmentation

Funds:

The National Natural Science Foundation of China (11172314)

摘要

摘要: 该文在去除背景便能获得目标的分割思想之上，提出了一个凸的无约束最小化问题。证明了问题提出过程中添加惩罚项的合理性，并通过实验验证了证明结果。在最小化求解方面，应用次微分和近似算子的相关理论，构造了求解的不动点算子，进而结合Opial -averaged定理，给出了求解所提凸优化问题的不动点算法，并理论推导出了收敛条件，证明了算法的收敛性。与经典文献方法的对比实验表明所提方法分割结果更精确。同时实验显示该文算法比梯度下降法和分裂Bregman方法更快速。另外，所提算法对初始曲线和噪声有较好的鲁棒性。
- 图像处理 /
- 图像分割 /
- 凸优化问题 /
- 不动点算法
Abstract: Based on the idea that objects in a given image can be segmented by removing the background part, an unconstrained convex minimization problem is proposed. The penalization term added in the construction procedure of the proposed problem is proven to be viable, which is demonstrated by the experiment. At the computational level, a fixed-point operator and the corresponding algorithm are proposed by applying the theory of subdifferential and proximity operators, and Opial -averaged theorem. And then the convergence proof of the algorithm is given. Comparisons with other classical models show that the proposed segmentation model is more accurate. And the experiments also demonstrate that the fixed-point algorithm is faster than the gradient descent method and the split Bregman method. Moreover, the algorithm is robust to the initial curve and noise.
- Image processing /
- Image segmentation /
- Convex optimization /
- Fixed-point algorithm

HTML全文

参考文献(19)

Zhu W, Tai X, and Chan T. Image segmentation using Eulers Elastica as the regularization[J]. Journal of Scientific Computing, 2013, 15(2): 414-438.

Yuan J, Bae E, Tai X, et al.. A spatially continuous max-flow and min-cut framework for binary labeling problems[J]. Numerische Mathmatik, 2014, 126(3): 559-587.

张泽均, 水鹏朗. 一种新的基于网格编码和区域合并的SAR图像快速分割算法[J]. 电子与信息学报, 2014, 36(4): 974-980.

Zhang Ze-jun and Shui Peng-lang. A new fast SAR image segmentation algorithm based on grid coding and region merging[J]. Journal of Electronics Information Technology, 2014, 36(4): 974-980.

赵雪梅, 李玉, 赵泉华. 结合高斯回归模型和隐马尔可夫随机场的模糊聚类图像分割[J]. 电子与信息学报, 2014, 36(11): 2730-2736.

Zhao Xue-mei, Li Yu, and Zhao Quan-hua. Image segmentation by fuzzy clustering algorithm combining hidden Markov random field and Gaussian regression model[J]. Journal of Electronics Information Technology, 2014, 36(11): 2730-2736.

李伟斌, 高二, 宋松和. 一种全局最小化的图像分割方法[J]. 电子与信息学报, 2013, 35(4): 791-796.

Li Wei-bin, Gao Er, and Song Song-he. A global minimization method for image segmentation[J]. Journal of Electronics Information Technology, 2013, 35(4): 791-796.

Li Wei-bin, Song Song-he, and Luo Feng. Fast image segmentation by convex minimisation and split Bregman method[J]. Electronics Letters, 2013, 49(17): 1073-1074.

Goldstein T and Osher S. The split Bregman method for 1 regularized problems[J]. SIAM Journal on Imaging Sciences, 2008, 2(2): 323-343.

Micchelli C, Shen L, and Xu Y. Proximity algorithms for image models: denosing[J]. Inverse Problems, 2011, 27(4): 45009-45038.

Osher S and Fedkiw R. Level Sset Methods and Dynamic Implicit Surfaces[M]. New York: Springer Verlag, 2002: 4-22.

Bertsekas D. Nonlinear Programming[M]. Belmont: Athena Scientific, 2003: 209-210.

Z?linescu C. Convex Analysis in General Vector Spaces[M]. River Edge: World Scientific, 2002: 79-88.

Opial Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings[J]. Bulletin American Mathematical Society, 1967, 73: 591-597.

Chan T, Esedoglu S, and Nikolova M. Algorithms for finding global minimizers of image segmentation and denoising models[J]. SIAM Journal on Applied Mathematics, 2006, 66(5): 1632-1648.

Bresson X, Esedoglu S, Vandergheynst P, et al.. Fast global minimization of the active contour/snake models[J]. Journal of Mathematical Imaging and Vision, 2007, 28(2): 151-167.

Goldstein T, Bresson X, and Osher S. Geometric applications of the split Bregman method: segmentation and surface reconstruction[J]. SIAM Journal on Scientific Computing, 2010, 45(1-3): 272-293.

Alpert S, Galun M, Basri R, et al.. Image segmentation by probabilistic bottom-up aggregation and cue integration[C]. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Minneapolis, 2007: 1-8.

施引文献

资源附件(0)

访问统计