首页> 外文期刊>Image Processing, IEEE Transactions on >Discrete Region Competition for Unknown Numbers of Connected Regions
【24h】

Discrete Region Competition for Unknown Numbers of Connected Regions

机译:离散数量的连通区域的离散区域竞争

获取原文
获取原文并翻译 | 示例
       

摘要

We present a discrete unsupervised multiregion-competition algorithm for image segmentation over different energy functionals. The number of regions present in an image does not need to be known a priori, nor their photometric properties. The algorithm jointly estimates the number of regions, their photometries, and their contours. The required regularization is provided by defining a region as a connected set of pixels. The evolving contours in the image are represented by computational particles that move as driven by an energy-minimization algorithm. We present an efficient discrete algorithm that allows minimizing a range of well-known energy functionals under the topological constraint of regions being connected components. The presented framework and algorithms are implemented in the open-source Insight Toolkit image-processing library.
机译:我们提出了一种离散的无监督多区域竞争算法,用于在不同能量功能上的图像分割。图像中存在的区域数量不必事先知道,也不必知道其光度特性。该算法共同估计区域的数量,其光度和轮廓。通过将区域定义为一组相连的像素来提供所需的正则化。图像中不断变化的轮廓由能量最小化算法驱动的运动粒子表示。我们提出了一种有效的离散算法,该算法允许在被连接的区域的拓扑约束下将一系列众所周知的能量函数最小化。提出的框架和算法在开源的Insight工具包图像处理库中实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号