首页> 外文会议>International Conference on Computer Analysis of Images and Patterns >A Fast Level Set-Like Algorithm with Topology Preserving Constraint
【24h】

A Fast Level Set-Like Algorithm with Topology Preserving Constraint

机译:一种具有拓扑保存约束的快速级别设置算法

获取原文

摘要

Implicit active contours are widely employed in image processing and related areas. Their implementation using the level set framework brings several advantages over parametric snakes. In particular, a parametrization independence, topological flexibility, and straightforward extension into higher dimensions have led to their popularity. However, in some applications the topological flexibility of the implicit contour is not desirable. Imposing topology-preserving constraints on evolving contours is often more convenient than including additional postprocessing steps. In this paper, we build on the work by Han et al. [1] introducing a topology-preserving extension of the narrow band algorithm involving simple point concept from digital geometry. In order to significantly increase computational speed, we integrate a fast level set-like algorithm by Nilsson and Heyden [2] with the simple point concept to obtain a fast topology-preserving algorithm for implicit active contours. The potential of the new algorithm is demonstrated on both synthetic and real image data.
机译:隐含的活动轮廓广泛用于图像处理和相关领域。他们使用级别集框架的实现会带来参数​​蛇的几个优点。特别是,参数化独立性,拓扑灵活性和直接延伸到更高尺寸的延伸导致了他们的普及。然而,在一些应用中,隐式轮廓的拓扑灵活性是不可取的。对演变轮廓上的拓扑保存约束施加拓扑结构通常比包括其他后处理步骤更方便。在本文中,我们通过Han等人建立了工作。 [1]介绍涉及从数字几何概念的窄带算法的拓扑保存延伸。为了显着提高计算速度,我们将Nilsson和Heyden [2]的快速级别设置算法与简单的点概念集成,以获得用于隐式活动轮廓的快速拓扑保存算法。在合成和真实图像数据上都证明了新算法的潜力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号