Methods › Computer Vision › Instance Segmentation Models › K-Net
K-Net
Introduced by Wenwei Zhang et al. in K-Net: Towards Unified Image Segmentation
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
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 on the image features to obtain the corresponding segmentation predictions.
K-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.
It 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-free and box-free, which is appealing to real-time applications.
Papers archive 2025-07-28
6 shown of 6, 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.
-
Segmenting objects with Bayesian fusion of active contour models and convnet priors 9 Oct 2024 · 0 repositories · arXiv:2410.07421
-
RT-K-Net: Revisiting K-Net for Real-Time Panoptic Segmentation 2 May 2023 · 1 repository · arXiv:2305.01255
-
Tube-Link: A Flexible Cross Tube Framework for Universal Video Segmentation 22 Mar 2023 · 1 repository · arXiv:2303.12782
-
Video K-Net: A Simple, Strong, and Unified Baseline for Video Segmentation 10 Apr 2022 · 1 repository · arXiv:2204.04656
-
Dual-Domain Reconstruction Networks with V-Net and K-Net for fast MRI 11 Mar 2022 · 0 repositories · arXiv:2203.05725
-
K-Net: Towards Unified Image Segmentation 28 Jun 2021 · 1 repository · arXiv:2106.14855Syntology ran 0 of 1 samples · 1 unverified
Tasks archive 2025-07-28
14 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
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
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