.png){kind=icon}
返回
Eikonal-based region growing for efficient clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.imavis.2014.10.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe an Eikonal-based algorithm for computing dense oversegmentation of an image, often called supeipixels. This oversegmentation respects local image boundaries while limiting undersegmentation. The proposed algorithm relies on a region growing scheme, where the potential map used is not fixed and evolves during the diffusion. Refinement steps are also proposed to enhance at low cost the first oversegmentation. Quantitative comparisons on the Berkeley dataset show good performance on traditional metrics over current state-of-the art superpixel methods. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Superpixels
Segmentation
Clustering
Eikonal equation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
引用论文
.png){kind=icon}
Health Literacy – a review of research using the European Health Literacy Questionnaire (HLS-EU-Q16) in 2010-2018健康素养-2010-2018使用欧洲健康素养问卷 (HLS-EU-Q16) 进行的研究综述
OAAI
OAAI分享收藏
查看更多内容