{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/matrix-nms","slug":"matrix-nms","name":"Matrix NMS","full_name":"Matrix Non-Maximum Suppression","full_name_withheld":false,"description_markdown":"**Matrix NMS**, or **Matrix Non-Maximum Suppression**,  performs [non-maximum suppression](https://paperswithcode.com/method/non-maximum-suppression) with parallel matrix operations in one shot. It is motivated by [Soft-NMS](https://paperswithcode.com/method/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.\r\n\r\nMatrix NMS views this process from another perspective by considering how a predicted mask $m\\_{j}$ being suppressed. For $m\\_{j}$, its decay factor is affected by: (a) The penalty of each prediction $m\\_{i}$ on $m\\_{j}$ $\\left(s\\_{i}>s\\_{j}\\right)$, where $s\\_{i}$ and $s\\_{j}$ are the confidence scores; and (b) the probability of $m\\_{i}$ being suppressed. For (a), the penalty of each prediction $m\\_{i}$ on $m\\_{j}$ could be easily computed by $f\\left(\\right.$ iou $\\left.\\_{i, j}\\right)$. For (b), the probability of $m\\_{i}$ 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\\_{i}$ as\r\n\r\n$$\r\nf\\left(\\text { iou. }\\_{, i}\\right)=\\min\\_{\\forall s\\_{k}>s\\_{i}} f\\left(\\text { iou }\\_{k, i}\\right)\r\n$$\r\n\r\nTo this end, the final decay factor becomes\r\n\r\n$$\r\n\\operatorname{decay}\\_{j}=\\min\\_{\\forall s\\_{i}>s\\_{j}} \\frac{f\\left(\\text { iou }\\_{i, j}\\right)}{f\\left(\\text { iou }\\_{\\cdot, i}\\right)}\r\n$$\r\n\r\nand the updated score is computed by $s\\_{j}=s\\_{j} \\cdot$ decay $\\_{j} .$ The authors consider the two most simple decremented functions, denoted as linear $f\\left(\\right.$ iou $\\left.\\_{i, j}\\right)=1-$ iou $\\_{i, j}$, and Gaussian $f\\left(\\right.$ iou $\\left.\\_{i, j}\\right)=\\exp \\left(-\\frac{i o u\\_{i, j}^{2}}{\\sigma}\\right)$.","description_state":"present","introduced_year":null,"introduced_by":{"title":"SOLOv2: Dynamic and Fast Instance Segmentation","paper":"/paper/solov2-dynamic-faster-and-stronger","first_author":"Xinlong Wang","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/solov2-dynamic-faster-and-stronger"},"source":{"url":"https://arxiv.org/abs/2003.10152v3","title":"SOLOv2: Dynamic and Fast Instance Segmentation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Proposal Filtering","url":"/methods/category/proposal-filtering","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":"/paper/pp-yoloe-an-evolved-version-of-yolo","slug":"pp-yoloe-an-evolved-version-of-yolo","title":"PP-YOLOE: An evolved version of YOLO","date":"2022-03-30","arxiv_id":"2203.16250","n_code_links":8,"syntology":{"ran":22,"of":27,"n_ran_checked":19,"n_instrument":3,"unverified":5,"pointer_only":1,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","official":{"repos":["PaddlePaddle/PaddleDetection"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"in-defense-of-kalman-filtering-for-polyp","title":"In Defense of Kalman Filtering for Polyp Tracking from Colonoscopy Videos","date":"2022-01-27","arxiv_id":"2201.11450","n_code_links":0,"syntology":null},{"paper":"/paper/pp-yolov2-a-practical-object-detector","slug":"pp-yolov2-a-practical-object-detector","title":"PP-YOLOv2: A Practical Object Detector","date":"2021-04-21","arxiv_id":"2104.10419","n_code_links":1,"syntology":null},{"paper":"/paper/pp-yolo-an-effective-and-efficient","slug":"pp-yolo-an-effective-and-efficient","title":"PP-YOLO: An Effective and Efficient Implementation of Object Detector","date":"2020-07-23","arxiv_id":"2007.12099","n_code_links":5,"syntology":null},{"paper":"/paper/solov2-dynamic-faster-and-stronger","slug":"solov2-dynamic-faster-and-stronger","title":"SOLOv2: Dynamic and Fast Instance Segmentation","date":"2020-03-23","arxiv_id":"2003.10152","n_code_links":18,"syntology":{"ran":23,"of":38,"n_ran_checked":13,"n_instrument":10,"unverified":15,"pointer_only":24,"phrase":"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","official":{"repos":["WXinlong/SOLO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":4,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/matrix-nms/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/matrix-nms/papers/ran/1","json":"/method/matrix-nms/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/object-detection","name":"Object Detection","papers":3},{"task":"/task/object","name":"Object","papers":2},{"task":"/task/real-time-object-detection","name":"Real-Time Object Detection","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/2d-object-detection","name":"2D Object Detection","papers":1},{"task":"/task/dense-object-detection","name":"Dense Object Detection","papers":1},{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":1},{"task":"/task/multi-object-tracking","name":"Multi-Object Tracking","papers":1},{"task":"/task/multiple-object-tracking","name":"Multiple Object Tracking","papers":1},{"task":"/task/online-multi-object-tracking","name":"Online Multi-Object Tracking","papers":1},{"task":"/task/panoptic-segmentation","name":"Panoptic Segmentation","papers":1},{"task":"/task/real-time-semantic-segmentation","name":"Real-Time Semantic Segmentation","papers":1},{"task":"/task/real-time-instance-segmentation","name":"Real-time Instance Segmentation","papers":1},{"task":"/task/segmentation","name":"Segmentation","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1}],"tasks_shown":15,"n_tasks":15,"usage_by_year":[{"year":"2020","papers":2},{"year":"2021","papers":1},{"year":"2022","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/matrix-nms"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Matrix%20NMS","read_at":"2026-10-05T00:58:57+00:00","query":"Matrix NMS","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Matrix NMS","origin_arxiv_id":"2003.10152"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2003.10152","repositories":{"listed":5,"in_graph":18,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2003.10152","citations":103},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Matrix NMS'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"Matrix Encoding Network (MatNet)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Matrix Encoding Network (MatNet)')","origin_arxiv_id":"2106.11113"},{"name":"Truncated Matrix Power Iteration","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Truncated Matrix Power Iteration')","origin_arxiv_id":"2208.14571"},{"name":"matrix mechanism for the counting matrix","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='matrix mechanism for the counting matrix')","origin_arxiv_id":"2211.05006"},{"name":"Adjacency Matrix-Aware (AMA) data formatting method","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Adjacency Matrix-Aware (AMA) data formatting method')","origin_arxiv_id":"2209.11904"}],"code_nearby_caption":"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":{"arxiv_id":"2003.10152","page":"/paper/solov2-dynamic-faster-and-stronger","syntology_url":"https://syntology.ai/paper/2003.10152","in_graph_layer":true,"samples":38,"ran":23,"n_ran_checked":13,"n_instrument":10,"unverified":15,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"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.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["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)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"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."}},"syntology_have_state":"loaded","record_sha256":"feb64549ecb6c0dd1c8d30605eef66a064d8a0af839c6a6c2649135a604d9b8e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}