{"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/k-net","slug":"k-net","name":"K-Net","full_name":"K-Net","full_name_withheld":false,"description_markdown":"**K-Net** is a framework for unified semantic and instance segmentation that segments both instances and semantic categories consistently by a group of learnable kernels, where each kernel is responsible for generating a mask for either a potential instance or a stuff class. It begins with a set of kernels that are randomly initialized, and learns the kernels in accordance to the segmentation targets at hand, namely, semantic kernels for semantic categories and instance kernels for instance identities. A simple combination of semantic kernels and instance kernels allows panoptic segmentation naturally. In the forward pass, the kernels perform [convolution](https://paperswithcode.com/method/convolution) on the image features to obtain the corresponding segmentation predictions.\r\n\r\nK-Net is formulated so that it dynamically updates the kernels to make them conditional to their activations on the image. Such a content-aware mechanism is crucial to ensure that each kernel, especially an instance kernel, responds accurately to varying objects in an image. Through applying this adaptive kernel update strategy iteratively, K-Net significantly improves the discriminative ability of the kernels and boosts the final segmentation performance. It is noteworthy that this strategy universally applies to kernels for all the segmentation tasks.\r\n\r\nIt also utilises a bipartite matching strategy to assign learning targets for each kernel. This training approach is advantageous to conventional training strategies as it builds a one-to-one mapping between kernels and instances in an image. It thus resolves the problem of dealing with a varying number of instances in an image. In addition, it is purely mask-driven without involving boxes. Hence, K-Net is naturally [NMS](https://paperswithcode.com/method/non-maximum-suppression)-free and box-free, which is appealing to real-time applications.","description_state":"present","introduced_year":null,"introduced_by":{"title":"K-Net: Towards Unified Image Segmentation","paper":"/paper/k-net-towards-unified-image-segmentation","first_author":"Wenwei Zhang","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/k-net-towards-unified-image-segmentation"},"source":{"url":"https://arxiv.org/abs/2106.14855v2","title":"K-Net: Towards Unified Image Segmentation","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/ZwwWayne/K-Net","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Instance Segmentation Models","url":"/methods/category/instance-segmentation-models","pwc_aliases":[]},{"area":"Computer Vision","area_id":"computer-vision","collection":"Semantic Segmentation Models","url":"/methods/category/semantic-segmentation-models","pwc_aliases":["segmentation-models"]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"slug":"segmenting-objects-with-bayesian-fusion-of","title":"Segmenting objects with Bayesian fusion of active contour models and convnet priors","date":"2024-10-09","arxiv_id":"2410.07421","n_code_links":0,"syntology":null},{"paper":"/paper/rt-k-net-revisiting-k-net-for-real-time","slug":"rt-k-net-revisiting-k-net-for-real-time","title":"RT-K-Net: Revisiting K-Net for Real-Time Panoptic Segmentation","date":"2023-05-02","arxiv_id":"2305.01255","n_code_links":1,"syntology":null},{"paper":"/paper/tube-link-a-flexible-cross-tube-baseline-for","slug":"tube-link-a-flexible-cross-tube-baseline-for","title":"Tube-Link: A Flexible Cross Tube Framework for Universal Video Segmentation","date":"2023-03-22","arxiv_id":"2303.12782","n_code_links":1,"syntology":null},{"paper":"/paper/video-k-net-a-simple-strong-and-unified","slug":"video-k-net-a-simple-strong-and-unified","title":"Video K-Net: A Simple, Strong, and Unified Baseline for Video Segmentation","date":"2022-04-10","arxiv_id":"2204.04656","n_code_links":1,"syntology":null},{"paper":null,"slug":"dual-domain-reconstruction-networks-with-v","title":"Dual-Domain Reconstruction Networks with V-Net and K-Net for fast MRI","date":"2022-03-11","arxiv_id":"2203.05725","n_code_links":0,"syntology":null},{"paper":"/paper/k-net-towards-unified-image-segmentation","slug":"k-net-towards-unified-image-segmentation","title":"K-Net: Towards Unified Image Segmentation","date":"2021-06-28","arxiv_id":"2106.14855","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zwwwayne/k-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":4,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":6,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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":1,"papers_where_code_ran_first_page":"/method/k-net/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/k-net/papers/ran/1","json":"/method/k-net/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":4},{"task":"/task/segmentation","name":"Segmentation","papers":4},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":4},{"task":"/task/panoptic-segmentation","name":"Panoptic Segmentation","papers":3},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":2},{"task":"/task/video-instance-segmentation","name":"Video Instance Segmentation","papers":2},{"task":"/task/video-panoptic-segmentation","name":"Video Panoptic Segmentation","papers":2},{"task":"/task/video-segmentation","name":"Video Segmentation","papers":2},{"task":"/task/video-semantic-segmentation","name":"Video Semantic Segmentation","papers":2},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":1},{"task":"/task/scene-parsing","name":"Scene Parsing","papers":1}],"tasks_shown":14,"n_tasks":14,"usage_by_year":[{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":1}],"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/k-net"},"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=K-Net","read_at":"2026-10-05T00:58:15+00:00","query":"K-Net","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2106.14855","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2106.14855","title":"K-Net: Towards Unified Image Segmentation","citations":492,"named_by":["title_prefix"],"bearer_name":"K-Net: Towards Unified Image Segmentation","ask_with":"have('2106.14855')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'K-Net' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'K-Net: Towards Unified Image Segmentation' (arXiv:2106.14855, 492 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “K-Net: Towards Unified Image Segmentation” (arXiv:2106.14855, 492 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":["U-Net","W-Net","A*Net","γ-Net","F-Net","R-Net"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"999b50750a0c5631e7fec470fd9e362f613430475a0f6a174cabe80466b613a4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}