RankED: Addressing Imbalance and Uncertainty in Edge Detection Using Ranking-based Losses

Bedrettin Çetinkaya, S. Kalkan, Emre Akbas
2/9/2026

No official code found. Best implementation: Bedrettin-Cetinkaya/RankED (36 stars, MIT, last commit 2025-02-21).

Abstract

Detecting edges in images suffers from the problems of (PI) heavy imbalance between positive and negative classes as well as (P2) label uncertainty owing to disagreement be-tween different annotators. Existing solutions address PI using class-balanced cross-entropy loss and dice loss and P2 by only predicting edges agreed upon by most annota-tors. In this paper, we propose RankED, a unified ranking-based approach that addresses both the imbalance problem (P 1) and the uncertainty problem (P2). RankED tackles these two problems with two components: One component which ranks positive pixels over negative pixels, and the second which promotes high confidence edge pixels to have more label certainty. We show that RankED outperforms previous studies and sets a new state-of-the-art on NYUD-v2, BSDS500 and Multi-cue datasets. Code is available at https://ranked-cvpr24.github.io.

View on arXivView PDF

Code Implementations(1)

MIT
364Shell, PythonFeb 29, 20241 years agoMIT

Similar Papers

Cite this paper

@article{etinkaya2026ranked,
  title  = {RankED: Addressing Imbalance and Uncertainty in Edge Detection Using Ranking-based Losses},
  author = {Bedrettin Çetinkaya and S. Kalkan and Emre Akbas},
  year   = {2026},
  eprint = {2403.01795},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2403.01795},
  journal = {CVPR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.01795.svg)](https://codeofpaper.com/paper/2403.01795)

Discussion