SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2103.13757 · CVPR · 2021

I 3 Net: Implicit Instance-Invariant Network for Adapting One-Stage Object Detectors

Hong Kong, Chaoqi Chen, Yue Huang, Yizhou Yu, Xinghao Ding, Zebiao Zheng

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Instance-Invariant Network (I 3 Net), which is tailored for adapting one-stage detectors and implicitly learns instanceinvariant features via exploiting the natural characteristics of deep features in different layers. Specifically, we facilitate the adaptation from three aspects: (1) Dynamic and Class-Balanced Reweighting (DCBR) strategy, which considers the coexistence of intra-domain and intra-class variations to assign larger weights to those sample-scarce categories and easy-to-adapt samples; (2) Category-aware Object Pattern Matching (COPM) module, which boosts the cross-domain foreground objects matching guided by the categorical information and suppresses the uninformative background features; (3) Regularized Joint Category Alignment (RJCA) module, which jointly enforces the category alignment at different domain-specific layers with a consistency regularization. Experiments reveal that I 3 Net exceeds the state-of-the-art performance on benchmark datasets.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2103.13757")
get_code_for_paper("2103.13757")
have("2103.13757")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2103.13757.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2103.13757.svg)](https://syntology.ai/paper/2103.13757)

Connect an agent — have() is free.