Methods › Computer Vision › Proposal Filtering › Matrix NMS

Matrix Non-Maximum Suppression

Matrix NMS

5 papers tagged archive 2025-07-28

Introduced by Xinlong Wang et al. in SOLOv2: Dynamic and Fast Instance Segmentation

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

Matrix NMS, or Matrix Non-Maximum Suppression, performs non-maximum suppression with parallel matrix operations in one shot. It is motivated by Soft-NMS. Soft-NMS decays the other detection scores as a monotonic decreasing function f(iou) of their overlaps. By decaying the scores according to IoUs recursively, higher IoU detections will be eliminated with a minimum score threshold. However, such process is sequential like traditional Greedy NMS and can not be implemented in parallel.

Matrix NMS views this process from another perspective by considering how a predicted mask mⱼ being suppressed. For mⱼ, its decay factor is affected by: (a) The penalty of each prediction mᵢ on mⱼ (sᵢ>sⱼ), where sᵢ and sⱼ are the confidence scores; and (b) the probability of mᵢ being suppressed. For (a), the penalty of each prediction mᵢ on mⱼ could be easily computed by f(. iou ._(i, j)). For (b), the probability of mᵢ being suppressed is not so elegant to be computed. However, the probability usually has positive correlation with the IoUs. So here we directly approximate the probability by the most overlapped prediction on mᵢ as

f( iou. _(, i))=min_(∀sₖ>sᵢ) f( iou _(k, i))

To this end, the final decay factor becomes

decayⱼ=min_(∀sᵢ>sⱼ) (f( iou _(i, j)))/(f( iou _(·, i)))

and the updated score is computed by sⱼ=sⱼ · decay ⱼ . The authors consider the two most simple decremented functions, denoted as linear f(. iou ._(i, j))=1- iou _(i, j), and Gaussian f(. iou ._(i, j))=exp(-(i o u_(i, j)²)/σ).

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 18 in the graph, strongest link: official). This answer is about arXiv:2003.10152, the paper the archive credits with this method.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2003.10152 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 23 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 10 where Syntology's instrument failed) · 15 unverified (of 38 harvested samples) · 24 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 5 · with a code link: 4 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 5 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

15 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
Object Detection3
Object2
Real-Time Object Detection2
object-detection2
2D Object Detection1
Dense Object Detection1
Instance Segmentation1
Multi-Object Tracking1
Multiple Object Tracking1
Online Multi-Object Tracking1
Panoptic Segmentation1
Real-Time Semantic Segmentation1
Real-time Instance Segmentation1
Segmentation1
Semantic Segmentation1

Usage over time archive 2025-07-28

Papers per year tagged with Matrix NMS: 2020 to 2022, peak 2 2 0 2020: 2 papers 2020 2021: 1 paper 2021 2022: 2 papers 2022
Papers per year the archive tags with this method, by the paper's archive date (5 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

Proposal Filtering

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