TY - JOUR
T1 - Superpixel Segmentation Based on Square-Wise Asymmetric Partition and Structural Approximation
AU - Li, Hua
AU - Kwong, Sam
AU - Chen, Chuanbo
AU - Jia, Yuheng
AU - Cong, Runmin
PY - 2019/10
Y1 - 2019/10
N2 - Superpixel segmentation aims at grouping discretizing pixels into high-level correlative units and reducing the complexity of subsequent tasks, e.g., saliency detection and object tracking. Existing superpixel segmentation algorithms mainly focus on maintaining the geometrical information, while neglecting the irregular structure of superpixels. In this paper, a superpixel segmentation method is proposed to generate approximately structural superpixels with sharp boundary adherence and comprehensive semantic information. The superpixel segmentation is formulated as a square-wise asymmetric partition problem, where the semantic perceptual superpixels are recorded in a square level to preserve abundant semantic information and save storage simultaneously. Moreover, in order to achieve regular-shape superpixel units to better adhere to image boundaries and contours, a combinatorial optimization strategy is devised to achieve an optimal combination of squares and isolated pixels. Experimental comparisons with some state-of-the-art superpixel segmentation methods on the public benchmarks demonstrate the effectiveness of the proposed method quantitatively and qualitatively. In addition, we have applied the method to brain tissue segmentation to illustrate superior performance.
AB - Superpixel segmentation aims at grouping discretizing pixels into high-level correlative units and reducing the complexity of subsequent tasks, e.g., saliency detection and object tracking. Existing superpixel segmentation algorithms mainly focus on maintaining the geometrical information, while neglecting the irregular structure of superpixels. In this paper, a superpixel segmentation method is proposed to generate approximately structural superpixels with sharp boundary adherence and comprehensive semantic information. The superpixel segmentation is formulated as a square-wise asymmetric partition problem, where the semantic perceptual superpixels are recorded in a square level to preserve abundant semantic information and save storage simultaneously. Moreover, in order to achieve regular-shape superpixel units to better adhere to image boundaries and contours, a combinatorial optimization strategy is devised to achieve an optimal combination of squares and isolated pixels. Experimental comparisons with some state-of-the-art superpixel segmentation methods on the public benchmarks demonstrate the effectiveness of the proposed method quantitatively and qualitatively. In addition, we have applied the method to brain tissue segmentation to illustrate superior performance.
KW - combinatorial optimization
KW - square-wise asymmetric partition
KW - structural approximation
KW - Superpixel
UR - http://www.scopus.com/inward/record.url?scp=85072757230&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85072757230&origin=recordpage
U2 - 10.1109/TMM.2019.2907047
DO - 10.1109/TMM.2019.2907047
M3 - RGC 21 - Publication in refereed journal
SN - 1520-9210
VL - 21
SP - 2625
EP - 2637
JO - IEEE Transactions on Multimedia
JF - IEEE Transactions on Multimedia
IS - 10
M1 - 8673630
ER -