Square Superpixel Generation and Representation Learning via Granular Ball Computing
Shuyin Xia, Meng Yang, Dawei Dai, Fan Chen, Shilin Zhao, Junwei Han, Xinbo Gao, Guoyin Wang, Wen Lu

TL;DR
This paper introduces a novel square superpixel generation method based on granular-ball computing, enabling efficient, parallel, and end-to-end learnable superpixels for vision tasks.
Contribution
The authors propose a square superpixel approach using multi-scale square blocks and purity scores, improving alignment with regular operators and integration with deep learning models.
Findings
Enhanced superpixel regularity and alignment with convolutional operators.
Improved performance in downstream vision tasks.
Facilitated integration with GNNs and ViTs.
Abstract
Superpixels provide a compact region-based representation that preserves object boundaries and local structures, and have therefore been widely used in a variety of vision tasks to reduce computational cost. However, most existing superpixel algorithms produce irregularly shaped regions, which are not well aligned with regular operators such as convolutions. Consequently, superpixels are often treated as an offline preprocessing step, limiting parallel implementation and hindering end-to-end optimization within deep learning pipelines. Motivated by the adaptive representation and coverage property of granular-ball computing, we develop a square superpixel generation approach. Specifically, we approximate superpixels using multi-scale square blocks to avoid the computational and implementation difficulties induced by irregular shapes, enabling efficient parallel processing and learnable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
