Methods › Computer Vision › Instance Segmentation Models › Deep-MAC

Deep-MAC

1 paper tagged archive 2025-07-28

Introduced by Vighnesh Birodkar et al. in The surprising impact of mask-head architecture on novel class segmentation

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Deep-MAC, or Deep Mask-heads Above CenterNet, is a type of anchor-free instance segmentation model based on CenterNet. The motivation for this new architecture is that boxes are much cheaper to annotate than masks, so the authors address the “partially supervised” instance segmentation problem, where all classes have bounding box annotations but only a subset of classes have mask annotations.

For predicting bounding boxes, CenterNet outputs 3 tensors: (1) a class-specific heatmap which indicates the probability of the center of a bounding box being present at each location, (2) a class-agnostic 2-channel tensor indicating the height and width of the bounding box at each center pixel, and (3) since the output feature map is typically smaller than the image (stride 4 or 8), CenterNet also predicts an x and y direction offset to recover this discretization error at each center pixel.

For Deep-MAC, in parallel to the box-related prediction heads, we add a fourth pixel embedding branch P. For each bounding box b, we crop a region P_b from P corresponding to b via ROIAlign which results in a 32 × 32 tensor. We then feed each P_b to a mask-head. The final prediction at the end is a class-agnostic 32 × 32 tensor which we pass through a sigmoid to get per-pixel probabilities. We train this mask-head via a per-pixel cross-entropy loss averaged over all pixels and instances. During post-processing, the predicted mask is re-aligned according to the predicted box and resized to the resolution of the image.

In addition to this 32 × 32 cropped feature map, we add two inputs for improved stability of some mask-heads: (1) Instance embedding: an additional head is added to the backbone that predicts a per-pixel embedding. For each bounding box b we extract its embedding from the center pixel. This embedding is tiled to a size of 32 × 32 and concatenated to the pixel embedding crop. This helps condition the mask-head on a particular instance and disambiguate it from others. (2) Coordinate Embedding: Inspired by CoordConv, the authors add a 32 × 32 × 2 tensor holding normalized (x, y) coordinates relative to the bounding box b.

PaperSource

Papers archive 2025-07-28

1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Instance Segmentation1
Segmentation1
Semantic Segmentation1

Usage over time archive 2025-07-28

Papers per year tagged with Deep-MAC: 2021 to 2021, peak 1 1 0 2021: 1 paper 2021
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Instance Segmentation Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections