Methods › Computer Vision › Feature Pyramid Blocks › Balanced Feature Pyramid

Balanced Feature Pyramid

7 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Balanced Feature Pyramid is a feature pyramid module. It differs from approaches like FPNs that integrate multi-level features using lateral connections. Instead the BFP strengthens the multi-level features using the same deeply integrated balanced semantic features. The pipeline is shown in the Figure to the right. It consists of four steps, rescaling, integrating, refining and strengthening.

Features at resolution level l are denoted as Cₗ. The number of multi-level features is denoted as L. The indexes of involved lowest and highest levels are denoted as lₘᵢₙ and lₘₐₓ. In the Figure, C₂ has the highest resolution. To integrate multi-level features and preserve their semantic hierarchy at the same time, we first resize the multi-level features {C₂, C₃, C₄, C₅} to an intermediate size, i.e., the same size as C₄, with interpolation and max-pooling respectively. Once the features are rescaled, the balanced semantic features are obtained by simple averaging as:

C = 1/L∑^(lₘₐₓ)_(l=lₘᵢₙ)Cₗ

The obtained features are then rescaled using the same but reverse procedure to strengthen the original features. Each resolution obtains equal information from others in this procedure. Note that this procedure does not contain any parameter. The authors observe improvement with this nonparametric method, proving the effectiveness of the information flow.

The balanced semantic features can be further refined to be more discriminative. The authors found both the refinements with convolutions directly and the non-local module work well. But the non-local module works in a more stable way. Therefore, embedded Gaussian non-local attention is utilized as default. The refining step helps us enhance the integrated features and further improve the results.

With this method, features from low-level to high-level are aggregated at the same time. The outputs {P₂, P₃, P₄, P₅} are used for object detection following the same pipeline in FPN.

Source: Libra R-CNN: Towards Balanced Learning for Object DetectionSee Code · open-mmlab/mmdetection

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: BEV pyramid feature decoder; Unbalanced Feature Transport; Feature Pyramid Network (FPN); Feature Pyramid Network (FPN); Scaling Feature Pyramid (SFP); Quantum Feature Pyramid Gating; Feature Shrinkage Pyramid Network (FSPNet); Temporal Dependency Feature Pyramid (TDFP).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 7 · with a code link: 3 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 7 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 7 of 7, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

11 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
Object Detection3
object-detection3
Ensemble Learning1
Fire Detection1
Food recommendation1
Fracture detection1
Management1
Medical Object Detection1
Nutrition1
Object Localization1
Transfer Learning1

Usage over time archive 2025-07-28

Papers per year tagged with Balanced Feature Pyramid: 2019 to 2024, peak 3 3 0 2019: 1 paper 2019 2020: 1 paper 2020 2021: 3 papers 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (7 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

Feature Pyramid Blocks

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