返回
Graph-based image segmentation using directional nearest neighbor graph
DOI:10.1007/s11432-012-4706-4.png)
摘要
En 中文
Graph-based image segmentation techniques generally represent the problem in terms of a graph. In this work, we present a novel graph, called the directional nearest neighbor graph. The construction principle of this graph is that each node corresponding to a pixel in the image is connected to a fixed number of nearest neighbors measured by color value and the connected neighbors are distributed in four directions. Compared with the classical grid graph and the nearest neighbor graph, our method can capture low-level texture information using a less-connected edge topology. To test the performance of the proposed method, a comparison with other graph-based methods is carried out on synthetic and real-world images. Results show an improved segmentation for texture objects as well as a lower computational load.
Keyword:
image segmentation
interactive segmentation
graph topology
graph cuts
random walker
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
Differentiation of vegetation zones and species strategies in the subalpine region of Mt. Fuji
Vegetatio
IF0
Burkholderia cenocepacia Type VI Secretion System Mediates Escape of Type II Secreted Proteins into the Cytoplasm of Infected Macrophages
PLoS ONE
IF0
The effect of spin dilution on magnetism of the linear chain system β-Cu2−x Zn x V2O7自旋稀释对线性链体系 β-cu2-x Zn x V2O7磁性的影响
Pramana
IF0
没有更多内容

