arrow
返回

Superpixel Hierarchy

delete2018-10-01
delete79
delete
OA
AI
X
Xing Wei
Q
Qingxiong Yang
Y
Yihong Gong
N
Narendra Ahuja
M
Ming–Hsuan Yang *
DOI:10.1109/TIP.2018.2836300delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Superpixel segmentation has been one of the most important tasks in computer vision. In practice, an object can be represented by a number of segments at finer levels with consistent details or included in a surrounding region at coarser levels. Thus, a superpixel segmentation hierarchy is of great importance for applications that require different levels of image details. However, there is no method that can generate all scales of superpixels accurately in real time. In this paper, we propose the superhierarchy algorithm which is able to generate multiscale superpixels as accurately as the state-of-the-art methods but with one to two orders of magnitude speed-up. The proposed algorithm can be directly integrated with recent efficient edge detectors to significantly outperform the state-of-the-art methods in terms of segmentation accuracy. Quantitative and qualitative evaluations on a number of applications demonstrate that the proposed algorithm is accurate and efficient in generating a hierarchy of superpixels.
Keyword:
Superpixel
segmentation
Boruvka algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Image Processing 封面图
IEEE Transactions on Image Processing
IF:
13.7
论文数:
1.0W
被引数:
8.4W

机构

X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
U
University of Illinois Urbana-Champaign
学者数:
2.4W
论文数: 2.0W
被引数: 35
University of Illinois System 封面图
University of Illinois System
学者数:
6.8W
论文数: 6.2W
被引数: 644
学者 查看更多机构