← Latest papers
💻 computer science

Instance Awareness of Multi-class Semantic Segmentation Loss Functions

This paper proposes extending instance-sensitive losses like blob and CC loss to multi-class semantic segmentation via one-vs-rest decomposition and per-component inverse-size weighting, demonstrating that these adaptations effectively address both instance and class imbalances to improve Dice scores and Panoptic Quality on the BraTS-METS 2025 dataset.

Original authors: Soumya Snigdha Kundu, Florian Kofler, Marina Ivory, Hendrik Moller, Jonathan Shapey, Tom Vercauteren

Published 2026-04-28
📖 4 min read☕ Coffee break read

Original authors: Soumya Snigdha Kundu, Florian Kofler, Marina Ivory, Hendrik Moller, Jonathan Shapey, Tom Vercauteren

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are training a robot to look at a 3D map of a human brain and find all the tumors. The problem is that the brain has two very different types of "unfairness" that make this job incredibly hard for the robot.

The Two Big Problems

  1. The "Tiny vs. Giant" Problem (Instance Imbalance):
    Imagine the robot is looking for tumors. Some are huge, like a grapefruit. Others are tiny, like a grain of sand.

    • The Old Way: If the robot tries to learn from the whole picture at once, it gets distracted by the giant grapefruit. It thinks, "Oh, I got the big one right, good job!" and ignores the tiny grain of sand. The robot never learns to find the small ones because they are too small to matter in the big picture.
    • The Paper's Fix: The authors created a new rulebook (a "loss function") that forces the robot to treat every single tumor as its own separate task. It's like giving the robot a magnifying glass for each tumor individually. Now, whether the tumor is a grapefruit or a grain of sand, the robot has to get it right to pass the test.
  2. The "Rare vs. Common" Problem (Class Imbalance):
    Now imagine the brain has different types of tumors.

    • Type A (Common): There are thousands of these.
    • Type B (Rare): There are only a few of these (like a specific type of resection cavity).
    • The Old Way: When the robot learns, it gets so much practice on Type A that it becomes an expert at finding them. But because Type B is so rare, the robot barely sees them during training. It effectively forgets to look for them.
    • The Paper's Fix: The authors realized that if you force the robot to treat every type of tumor as a separate "one-vs-rest" game (where it learns to find Type A while ignoring everything else, then learns to find Type B while ignoring everything else), it levels the playing field. Suddenly, the rare Type B gets just as much attention as the common Type A, even if there are only 10 of them compared to 1,000.

The Secret Sauce: "Local" vs. "Global" Reweighting

The paper also tried a trick called "Inverse-Size Weighting." Think of this as giving the robot a bonus score for finding small things.

  • The Mistake (Global): If you give the bonus score to the whole brain at once, the robot goes crazy. A tiny, rare tumor gets a massive bonus, while a huge common tumor gets a tiny bonus. The math gets so unbalanced that the robot crashes (or learns nothing useful).
  • The Success (Local): The authors found that if you only give the bonus score inside the specific area of that one tiny tumor, it works perfectly. It's like giving a student a gold star for finishing a small puzzle, but only looking at that specific puzzle, not the whole classroom. This keeps the robot focused without breaking the math.

The Results: A Trade-off

The paper tested this on a dataset of brain scans (BraTS-METS 2025). Here is what happened:

  • Finding the Rare Stuff: The new methods were amazing at finding the rare, hard-to-see tumors (the "resection cavities"). The success rate jumped from 15% (with old methods) to 31% or even 44% with the new tricks.
  • The Catch: There is a trade-off. By making the robot so obsessed with finding the tiny, rare tumors, it sometimes got a little "noisy" when looking at the big, common tumors.
    • Think of it like a security guard who is so hyper-focused on catching a tiny pickpocket that they accidentally trip over a large suitcase.
    • The "Blob" and "CC" methods (the new rules) found a good balance: they found the rare tumors much better without tripping over the common ones too much.
    • The "Inverse-Size" method found the rarest tumors best of all, but it made the robot slightly worse at spotting the big, obvious ones.

The Bottom Line

The paper proves that by changing how we teach the robot to look at the brain—specifically by treating every tumor as its own individual challenge and every tumor type as its own separate game—we can solve the problem of missing rare and tiny tumors.

They didn't just fix the "small vs. big" problem; they accidentally fixed the "rare vs. common" problem too. The result is a smarter robot that doesn't ignore the small, rare details just because they are hard to see.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →