{"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":"/paper/blendmask-top-down-meets-bottom-up-for","title":"BlendMask: Top-Down Meets Bottom-Up for Instance Segmentation","arxiv_id":"2001.00309","date":"2020-01-02","proceeding":"CVPR 2020 6","authors":["Hao Chen","Kunyang Sun","Zhi Tian","Chunhua Shen","Yongming Huang","Youliang Yan"],"abstract":"Instance segmentation is one of the fundamental vision tasks. Recently, fully convolutional instance segmentation methods have drawn much attention as they are often simpler and more efficient than two-stage approaches like Mask R-CNN. To date, almost all such approaches fall behind the two-stage Mask R-CNN method in mask precision when models have similar computation complexity, leaving great room for improvement. In this work, we achieve improved mask prediction by effectively combining instance-level information with semantic information with lower-level fine-granularity. Our main contribution is a blender module which draws inspiration from both top-down and bottom-up instance segmentation approaches. The proposed BlendMask can effectively predict dense per-pixel position-sensitive instance features with very few channels, and learn attention maps for each instance with merely one convolution layer, thus being fast in inference. BlendMask can be easily incorporated with the state-of-the-art one-stage detection frameworks and outperforms Mask R-CNN under the same training schedule while being 20% faster. A light-weight version of BlendMask achieves $ 34.2% $ mAP at 25 FPS evaluated on a single 1080Ti GPU card. Because of its simplicity and efficacy, we hope that our BlendMask could serve as a simple yet strong baseline for a wide range of instance-wise prediction tasks. Code is available at https://git.io/AdelaiDet","url_abs":"https://arxiv.org/abs/2001.00309v3","url_pdf":"https://arxiv.org/pdf/2001.00309v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/Pxtri2156/AdelaiDet_v2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/TengFeiHan0/Instance-Wise-Depth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/aim-uofa/AdelaiDet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/aim-uofa/adet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/blueardour/AdelaiDet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/nerminsamet/houghnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/quangvy2703/ABCNet-ESRGAN-SRTEXT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/zhaozhijie1997/Unifed-Lane-and-Traffic-Sign-detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"blendmask-top-down-meets-bottom-up-for","repo_url":"https://github.com/zhubinQAQ/Ins","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"instance-segmentation","task_name":"Instance Segmentation"},{"task_slug":"real-time-instance-segmentation","task_name":"Real-time Instance Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"blendmask","method_name":"BlendMask"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"fcos","method_name":"FCOS"},{"method_slug":"fpn","method_name":"FPN"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"mask-r-cnn","method_name":"Mask R-CNN"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"non-maximum-suppression","method_name":"Non Maximum Suppression"},{"method_slug":"rpn","method_name":"RPN"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"roi-align","method_name":"RoIAlign"},{"method_slug":"roipool","method_name":"RoIPool"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/instance-segmentation-on-coco","task":"Instance Segmentation","dataset":"COCO test-dev","model":"BlendMask (ResNet-101 + DCN interval=3)","rank_in_archive_order":62,"of":112,"metrics":{"AP50":"63.1","AP75":"44.6","APL":"54.5","APM":"44.1","APS":"22.7","mask AP":"41.3"},"uses_additional_data":false},{"leaderboard":"/sota/real-time-instance-segmentation-on-mscoco","task":"Real-time Instance Segmentation","dataset":"MSCOCO","model":"BlendMask-512 (DLA_34)","rank_in_archive_order":13,"of":22,"metrics":{"Frame (fps)":"33.3","mask AP":"35.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.00309","atlas_url":"https://app.syntology.ai/?focus=2001.00309","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2001.00309"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.00309\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.00309"},"call":"get_concepts_for_paper(arxiv_id=\"2001.00309\")"}],"by_repo":[{"repo":"Pxtri2156/AdelaiDet_v2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.05664"],"harvested_for_calls":[{"arxiv_id":"2003.05664","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.05664"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.05664\")"}]},{"repo":"TengFeiHan0/Instance-Wise-Depth","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aim-uofa/AdelaiDet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aim-uofa/adet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"blueardour/AdelaiDet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"nerminsamet/houghnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"quangvy2703/ABCNet-ESRGAN-SRTEXT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zhaozhijie1997/Unifed-Lane-and-Traffic-Sign-detection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zhubinQAQ/Ins","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c7b2c0f34ba0bf60283fa74413e1b635493489cbc975ad006e877c0ce12d56b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}