Event cameras, characterized by high temporal resolution, high dynamic range, low power consumption, and high pixel bandwidth, offer unique capabilities for object detection in specialized contexts. Despite these advantages, the inherent sparsity and asynchrony of event data pose challenges to existing object detection algorithms. Spiking Neural Networks (SNNs), inspired by the way the human brain codes and processes information, offer a potential solution to these difficulties. However, their performance in object detection using event cameras is limited in current implementations. In this paper, we propose the Spiking Fusion Object Detector (SFOD), a simple and efficient approach to SNN-based object detection. Specifically, we design a Spiking Fusion Module, achieving the first-time fusion of feature maps from different scales in SNNs applied to event cameras. Additionally, through integrating our analysis and experiments conducted during the pretraining of the backbone network on the NCAR dataset, we delve deeply into the impact of spiking decoding strategies and loss functions on model performance. Thereby, we establish state-of-the-art classification results based on SNNs, achieving 93.7\% accuracy on the NCAR dataset. Experimental results on the GEN1 detection dataset demonstrate that the SFOD achieves a state-of-the-art mAP of 32.1\%, outperforming existing SNN-based approaches. Our research not only underscores the potential of SNNs in object detection with event cameras but also propels the advancement of SNNs. Code is available at https://github.com/yimeng-fan/SFOD.

Cross-view geo-localization (CVGL) between unmanned aerial vehicle (UAV) imagery and satellite imagery is a key technique for autonomous UAV navigation in Global Navigation Satellite System (GNSS)-denied environments. However, most existing methods rely on energy-intensive Artificial Neural Networks (ANNs), making them difficult to deploy on resource-constrained edge computing platforms. Spiking Neural Networks (SNNs) provide a promising alternative for energy-efficient inference, but their application to CVGL still faces two challenges that remain insufficiently addressed. First, the isotropic computation used by existing SNN backbones is mismatched with the directional characteristics of spike activations. Spike activations tend to form oriented aggregation patterns along elongated geographic structures, and isotropic computation can therefore dilute directional signals. Second, the limited representational capacity of SNNs further increases the sensitivity during training optimization. However, the standard triplet loss adopts a static weighting strategy and assigns the same weight to all triplets that violate the margin constraint, which is unfavorable for learning from hard negatives. To address these challenges, we propose a framework with two core contributions. At the feature extraction level, the Directional Adaptive Convolution Module (DACM) processes spike feature maps by sequentially performing horizontal strip convolution and vertical strip convolution, thereby capturing a more complete geometric structure of directional spike clusters. At the training supervision level, we propose a Dual-dimensional Progressive Reweighting (DPR) loss, which jointly characterizes sample difficulty from pairwise difficulty and positive-pair quality difficulty. A learnable fusion parameter is used to adaptively balance these two types of difficulty information. Experimental results on the University-1652 and SUES-200 benchmarks show that the proposed framework, when equipped with the same representation learning head as its ANN counterparts, achieves competitive and, in many settings, superior performance. In terms of energy efficiency, its estimated theoretical energy consumption is over $8.8\times$ lower than that of published ANN methods under their original configurations. Under a more rigorous matched ANN control that shares the identical architecture, the estimated energy is reduced from 29.84 mJ to 6.36 mJ, an approximately $4.7\times$ reduction obtained at a cost of only 2.29 percentage points in R@1.