检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]空军工程大学工程学院信号与信息处理实验室,陕西西安710038
出 处:《西安电子科技大学学报》2012年第5期132-139,196,共9页Journal of Xidian University
基 金:国家部委科技重点实验室基金资助项目(9140C610301080C6106);航空科学基金资助项目(20101996009)
摘 要:针对快速水平集算法用于图像分割时存在着阈值设置的困难,提出了一种新的改进思路.将曲线演化的过程看成对曲线上的点不断进行模式分类的过程,对控制曲线演化的外部速度函数进行重新设计.新算法通过引入贝叶斯分类决策和最小距离分类决策交替工作,间接从图像数据中获取外部速度函数所需的驱动力,使驱动力不再产生于划分图像数据所采用的阈值,同时将两种分类决策的失效条件作为新算法迭代停止的条件.仿真实验结果表明,新的分割算法不仅拥有较强的鲁棒性,能够自适应地根据图像灰度信息自动演化,而且对噪声影响也具有较强的抑制性.同时保留了原算法执行效率快的优点,在分割速度方面明显优于其他几种经典的水平集算法。In the application of image segmentation based on Shi's fast level set algorithm, there exist difficulties of setting thresholds, so a new approach is presented. In this new approach, the process of curve evolution can be seen as the pattern classification for the points of the curve constantly, so that the external velocity function for controlling curve evolution is redesigned, Both of the Bayesian classification rule and the Minimal distance classification rule are introduced by this new algorithm to work alternatively, in order to obtain the driving force of the external velocity acquired from image data indirectly, and therefore, the driving force does not come from thresholds anymore which are used for partitioning the image data, and the invalidation conditions for both of the classification rules are set as the iteration stop conditions in our new algorithm. Simulation experiments show that the new partition algorithm is not only more robust, which could evolve automatically by itself being adaptive to the image intensity information, but also has stronger anti-noise capability under the effect of noise; in the aspect of speed, it also executes much faster than several existing level set algorithms.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15