Superpixel Hierarchy

DOI10.1109/TIP.2018.2836300zbMATH Open1409.94654arXiv1605.06325OpenAlexW4212803998WikidataQ89403590 ScholiaQ89403590MaRDI QIDQ4617486FDOQ4617486

Authors: Xing Wei, Qingxiong Yang, Yihong Gong, Narendra Ahuja, Ming-Hsuan Yang

Publication date: 6 February 2019

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Abstract: Superpixel segmentation is becoming ubiquitous in computer vision. In practice, an object can either be represented by a number of segments in finer levels of detail or included in a surrounding region at coarser levels of detail, and thus a superpixel segmentation hierarchy is useful for applications that require different levels of image segmentation detail depending on the particular image objects segmented. Unfortunately, there is no method that can generate all scales of superpixels accurately in real-time. As a result, a simple yet effective algorithm named Super Hierarchy (SH) is proposed in this paper. It is as accurate as the state-of-the-art but 1-2 orders of magnitude faster. The proposed method can be directly integrated with recent efficient edge detectors like the structured forest edges to significantly outperforms the state-of-the-art in terms of segmentation accuracy. Quantitative and qualitative evaluation on a number of computer vision applications was conducted, demonstrating that the proposed method is the top performer.

Full work available at URL: https://arxiv.org/abs/1605.06325

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (4)

This page was built for publication: Superpixel Hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617486)