• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Machine Vision and Applications >GRowing Algorithm for Intersection Detection (GRAID) in branching patterns
【24h】

GRowing Algorithm for Intersection Detection (GRAID) in branching patterns

机译：分支模式中交叉点检测的GRowing算法（GRAID）

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Analysis of branching structures represents a very important task in fields such as medical diagnosis, road detection or biometrics. Detecting intersection landmarks becomes crucial when capturing the structure of a branching pattern. We present a very simple geometrical model to describe intersections in branching structures based on two conditions: Bounded Tangency (BT) condition and Shortest Branch (SB) condition. The proposed model precisely sets a geometrical characterization of intersections and allows us to introduce a new unsupervised operator for intersection extraction. We propose an implementation that handles the consequences of digital domain operation that, unlike existing approaches, is not restricted to a particular scale and does not require the computation of the thinned pattern. The new proposal, as well as other existing approaches in the bibliography, are evaluated in a common framework for the first time. The performance analysis is based on two manually segmented image data sets: DRIVE retinal image database and COLON-VESSEL data set, a newly created data set of vascular content in colonoscopy frames. We have created an intersection landmark ground truth for each data set besides comparing our method in the only existing ground truth. Quantitative results confirm that we are able to outper- form state-of-the-art performance levels with the advantage that neither training nor parameter tuning is needed.
机译：在医学诊断，道路检测或生物识别等领域，分支结构的分析代表着非常重要的任务。当捕获分支图案的结构时，检测相交界标变得至关重要。我们提供了一个非常简单的几何模型来描述基于两个条件的分支结构中的相交：边界切线（BT）条件和最短分支（SB）条件。提出的模型精确设置了相交的几何特征，并允许我们引入新的无监督算子进行相交提取。我们提出一种处理数字域操作后果的实现方式，与现有方法不同，该方法不限于特定规模，并且不需要计算稀疏模式。新建议以及参考书目中的其他现有方法首次在一个通用框架中进行了评估。性能分析基于两个手动分割的图像数据集：DRIVE视网膜图像数据库和COLON-VESSEL数据集，这是在结肠镜检查框架中新创建的血管含量数据集。除了在仅有的现有地面实况中比较我们的方法外，我们还为每个数据集创建了一个路口界标地面实况。定量结果证实，我们能够超越最新的性能水平，其优点是不需要训练或参数调整。

著录项

  • 来源
    《Machine Vision and Applications》 |2015年第3期|387-400|共14页
  • 作者

    Joan M. Nunez; Jorge Bernal; F. Javier Sanchez; Fernando Vilarino;

  • 作者单位

    Computer Vision Center and Computer Science Department,Universitat Aut6noma de Barcelona, Edifici O, Campus UAB,08193 Bellaterra (Cerdanyola), Barcelona, Spain;

    Computer Vision Center and Computer Science Department,Universitat Aut6noma de Barcelona, Edifici O, Campus UAB,08193 Bellaterra (Cerdanyola), Barcelona, Spain;

    Computer Vision Center and Computer Science Department,Universitat Aut6noma de Barcelona, Edifici O, Campus UAB,08193 Bellaterra (Cerdanyola), Barcelona, Spain;

    Computer Vision Center and Computer Science Department,Universitat Aut6noma de Barcelona, Edifici O, Campus UAB,08193 Bellaterra (Cerdanyola), Barcelona, Spain;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Bifurcation; Crossroad; Intersection; Retina; Vessel;

    机译：分叉;十字路口路口;视网膜;容器;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号