RankSEG: A Consistent Ranking-based Framework for Segmentation
Ben Dai, Chunlin Li

TL;DR
This paper introduces a theoretically grounded, consistent ranking-based framework for segmentation that improves over traditional thresholding methods, with proven calibration and strong empirical results on multiple datasets.
Contribution
It develops a novel ranking-based segmentation framework, RankDice/RankIoU, with theoretical guarantees and practical algorithms for large-scale applications.
Findings
Framework is Dice-/IoU-calibrated
Achieves state-of-the-art results on benchmark datasets
Provides convergence rates and statistical properties
Abstract
Segmentation has emerged as a fundamental field of computer vision and natural language processing, which assigns a label to every pixel/feature to extract regions of interest from an image/text. To evaluate the performance of segmentation, the Dice and IoU metrics are used to measure the degree of overlap between the ground truth and the predicted segmentation. In this paper, we establish a theoretical foundation of segmentation with respect to the Dice/IoU metrics, including the Bayes rule and Dice-/IoU-calibration, analogous to classification-calibration or Fisher consistency in classification. We prove that the existing thresholding-based framework with most operating losses are not consistent with respect to the Dice/IoU metrics, and thus may lead to a suboptimal solution. To address this pitfall, we propose a novel consistent ranking-based framework, namely RankDice/RankIoU,…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRemote-Sensing Image Classification · Advanced Image and Video Retrieval Techniques · Advanced Neural Network Applications
