Real-time hierarchical supervoxel segmentation via a minimum spanning tree
Supervoxel segmentation algorithm has been applied as a preprocessing step for many vision tasks. However, existing supervoxel segmentation algorithms cannot generate hierarchical supervoxel segmentation well preserving the spatiotemporal boundaries in real time, which prevents the downstream applic...
Saved in:
Main Authors: | WANG, Bo, CHEN, Yiliang, LIU, Wenxi, QIN, Jing, DU, Yong, HAN, Guoqiang, HE, Shengfeng |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7878 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Average competitive ratios of on-line spanning trees
by: Bao, F., et al.
Published: (2016) -
Scalable parallel minimum spanning forest computation
by: Nobari, S., et al.
Published: (2013) -
Real-time salient object detection with a minimum spanning tree
by: TU, Wei-Chih, et al.
Published: (2016) -
Approximating the Spanning k-Tree Forest Problem
by: Liao, C.-S., et al.
Published: (2014) -
The central limit theorem for weighted minimal spanning trees on random points
by: Kesten, H., et al.
Published: (2014)