Methods › Computer Vision › Instance Segmentation Models › K-Net

K-Net

6 papers tagged archive 2025-07-28

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.

PaperSourceSee Code · ZwwWayne/K-Net

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.

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.

TaskPapers
Instance Segmentation4
Segmentation4
Semantic Segmentation4
Panoptic Segmentation3
Image Segmentation2
Video Instance Segmentation2
Video Panoptic Segmentation2
Video Segmentation2
Video Semantic Segmentation2
Contrastive Learning1
Decoder1
GPU1
Image Reconstruction1
Scene Parsing1

Usage over time archive 2025-07-28

Papers per year tagged with K-Net: 2021 to 2024, peak 2 2 0 2021: 1 paper 2021 2022: 2 papers 2022 2023: 2 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (6 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

Instance Segmentation ModelsSemantic Segmentation Models

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