z-logo
open-access-imgOpen Access
Fast superpixel segmentation by iterative edge refinement
Author(s) -
Zhu Song,
Cao Danhua,
Jiang Shixiong,
Wu Yubin,
Hu Pan
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.3379
Subject(s) - pixel , segmentation , enhanced data rates for gsm evolution , computer science , artificial intelligence , iterative method , computer vision , boundary (topology) , iterative and incremental development , process (computing) , image segmentation , image (mathematics) , algorithm , mathematics , mathematical analysis , software engineering , operating system
The superpixel, as an important pre‐processing technique, has been successfully used in many vision applications. Introduced is a fast superpixel method called iterative edge refinement (IER). The image was first initialised as regular grids, and then concentration was on unstable pixels and relabelling them iteratively so called unstable pixels, are edge pixels around the moving boundary. It is found that the unstable pixels decrease rapidly during the iterative process, which results in a high speed‐up. Experimental results on the Berkeley BSDS500 dataset show that IER achieves a segmentation performance comparable with the state‐of‐the‐art, and moreover, runs in real‐time on a single Intel i3 CPU at 2.5 GHz.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here