Methods › Computer Vision › Feature Extractors › Bottom-up Path Augmentation

Bottom-up Path Augmentation

123 papers tagged archive 2025-07-28

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

Bottom-up Path Augmentation is a feature extraction technique that seeks to shorten the information path and enhance a feature pyramid with accurate localization signals existing in low-levels. This is based on the fact that high response to edges or instance parts is a strong indicator to accurately localize instances.

Each building block takes a higher resolution feature map Nᵢ and a coarser map Pᵢ₊₁ through lateral connection and generates the new feature map Nᵢ₊₁ Each feature map Nᵢ first goes through a 3 ×3 convolutional layer with stride 2 to reduce the spatial size. Then each element of feature map Pᵢ₊₁ and the down-sampled map are added through lateral connection. The fused feature map is then processed by another 3 ×3 convolutional layer to generate Nᵢ₊₁ for following sub-networks. This is an iterative process and terminates after approaching P₅. In these building blocks, we consistently use channel 256 of feature maps. The feature grid for each proposal is then pooled from new feature maps, i.e., {N₂, N₃, N₄, N₅}.

Source: Path Aggregation Network for Instance SegmentationSee Code · ShuLiu1993/PANet

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: bottom-up framework; path augmentation scheme; Decoupled Dual-Path CLIP; Path-Coupled Bellman Flows; geometric path augmentation; bottom-up, data-driven framework; geometry-driven path augmentation; Label-Decoupled Style Augmentation.

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: 123 · with a code link: 47 · where Syntology ran a sample: 8 (6 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (8 of 123 tagged: 6 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 123, 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

20 shown of 144 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 Detection69
object-detection63
Object33
Segmentation13
Real-Time Object Detection12
Semantic Segmentation12
GPU8
Autonomous Driving7
Data Augmentation7
Deep Learning7
Instance Segmentation7
2D Object Detection5
Image Classification5
Transfer Learning5
Small Object Detection4
Traffic Sign Detection4
image-classification4
Domain Adaptation3
Object Tracking3
Position3

Usage over time archive 2025-07-28

Papers per year tagged with Bottom-up Path Augmentation: 2018 to 2025, peak 33 33 0 2018: 1 paper 2018 2019: 4 papers 2019 2020: 18 papers 2020 2021: 28 papers 2021 2022: 33 papers 2022 2023: 21 papers 2023 2024: 10 papers 2024 2025: 8 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (123 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 Extractors

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