30 June 2017 Hierarchical image segmentation via recursive superpixel with adaptive regularity
Author Affiliations +
Abstract
A fast and accurate segmentation algorithm in a hierarchical way based on a recursive superpixel technique is presented. We propose a superpixel energy formulation in which the trade-off between data fidelity and regularization is dynamically determined based on the local residual in the energy optimization procedure. We also present an energy optimization algorithm that allows a pixel to be shared by multiple regions to improve the accuracy and appropriate the number of segments. The qualitative and quantitative evaluations demonstrate that our algorithm, combining the proposed energy and optimization, outperforms the conventional k -means algorithm by up to 29.10% in F -measure. We also perform comparative analysis with state-of-the-art algorithms in the hierarchical segmentation. Our algorithm yields smooth regions throughout the hierarchy as opposed to the others that include insignificant details. Our algorithm overtakes the other algorithms in terms of balance between accuracy and computational time. Specifically, our method runs 36.48% faster than the region-merging approach, which is the fastest of the comparing algorithms, while achieving a comparable accuracy.
© 2017 SPIE and IS&T
Kensuke Nakamura, Byung-Woo Hong, "Hierarchical image segmentation via recursive superpixel with adaptive regularity," Journal of Electronic Imaging 26(6), 061602 (30 June 2017). https://doi.org/10.1117/1.JEI.26.6.061602 . Submission: Received: 1 February 2017; Accepted: 24 April 2017
Received: 1 February 2017; Accepted: 24 April 2017; Published: 30 June 2017
JOURNAL ARTICLE
12 PAGES


SHARE
Back to Top