paper-with-me

홈 › Papers

SDPL: Shifting-Dense Partition Learning for UAV-View Geo-Localization

2024-03-07 · Quan Chen, Tingyu Wang, Zihao Yang, Haoran Li, Rongfeng Lu, Yaoqi Sun, Bolun Zheng, Chenggang Yan

Cross-view geo-localization aims to match images of the same target from different platforms, e.g., drone and satellite. It is a challenging task due to the changing appearance of targets and environmental content from different views. Most methods focus on obtaining more comprehensive information through feature map segmentation, while inevitably destroying the image structure, and are sensitive to the shifting and scale of the target in the query. To address the above issues, we introduce simple yet effective part-based representation learning, shifting-dense partition learning (SDPL). We propose a dense partition strategy (DPS), dividing the image into multiple parts to explore contextual information while explicitly maintaining the global structure. To handle scenarios with non-centered targets, we further propose the shifting-fusion strategy, which generates multiple sets of parts in parallel based on various segmentation centers, and then adaptively fuses all features to integrate their anti-offset ability. Extensive experiments show that SDPL is robust to position shifting, and performs com-petitively on two prevailing benchmarks, University-1652 and SUES-200. In addition, SDPL shows satisfactory compatibility with a variety of backbone networks (e.g., ResNet and Swin). https://github.com/C-water/SDPL release.

📄 PDF Abstract BibTeX arXiv:2403.04172

Code (1)

c-water/sdpl_release 공식 구현 pytorch

Tasks

geo-localizationPart-based Representation LearningRepresentation Learning

Methods 이 논문이 사용한 방법론

Average Pooling 설명 없음
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Kaiming Initialization 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Focus 설명 없음

Similar Papers 제목 키워드 기반

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+

2024-06-14 · Yufan Huang, David F. Gleich

Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science. Designing scalable SDP solvers is challenging because by standard the positive semidefinite d…

EmbedPart: Embedding-Driven Graph Partitioning for Scalable Graph Neural Network Training

2026-04-01 · Nikolai Merkel, Ruben Mayer, Volker Markl, Hans-Arno Jacobsen arxiv

Graph Neural Networks (GNNs) are widely used for learning on graph-structured data, but scaling GNN training to massive graphs remains challenging. To enable scalable distributed training, graphs are divided into smaller…

Graph Neural Networkgraph partitioning

LoD-Loc v3: Generalized Aerial Localization in Dense Cities using Instance Silhouette Alignment

2026-03-20 · Shuaibang Peng, Juelin Zhu, Xia Li, Kun Yang 외 arxiv

We present LoD-Loc v3, a novel method for generalized aerial visual localization in dense urban environments. While prior work LoD-Loc v2 achieves localization through semantic building silhouette alignment with low-deta…

Synthetic Data GenerationZero-shot GeneralizationInstance SegmentationVisual Localization

Relative Distance Guided Dynamic Partition Learning for Scale-Invariant UAV-View Geo-Localization

2024-12-16 · Quan Chen, Tingyu Wang, Rongfeng Lu, Bolun Zheng 외

UAV-view Geo-Localization~(UVGL) presents substantial challenges, particularly due to the disparity in visual appearance between drone-captured imagery and satellite perspectives. Existing methods usually assume consiste…

geo-localization

Matching with AffNet based rectifications

2022-07-29 · Václav Vávra, Dmytro Mishkin, Jiří Matas

We consider the problem of two-view matching under significant viewpoint changes with view synthesis. We propose two novel methods, minimizing the view synthesis overhead. The first one, named DenseAffNet, uses dense aff…