In recent years, rapid and reliable interpretation for emergency response to landslides and other geological hazards has become increasingly important. This paper presents DFmamba, an improved deformable dual-branch visual state-space network, to address engineering challenges such as missed large landslide bodies, boundary shifts, and loss of small-scale details. DFmamba mitigates the limited effective receptive field and window-partition constraints that often prevent existing methods from balancing large-area semantic consistency, multi-scale detection, precise boundary delineation, and computational efficiency. It employs a parallel encoder with a convolutional branch and a Visual State-Space Model (VSSM) branch to jointly capture local textures and global context. In the decoder, deformable residual blocks (DRB) enhance geometric modeling of irregular boundaries, while multi-scale feature alignment and a shallow high-frequency injection (MFP) mechanism strengthen boundary responses and preserve fine details. Experiments on the public CAS dataset against representative CNN-, Transformer-, and SSM-based baselines show that DFmamba achieves improved Precision, Recall, F1-score, and IoU, with stable performance across multi-scale scenarios, demonstrating strong robustness for landslide segmentation.
In practical classification tasks, the sample distribution of the dataset is often unbalanced; for example, this is the case in a dataset that contains a massive quantity of samples with weak labels and for which concrete identification is unavailable. Even in samples with exact labels, the number of samples corresponding to many labels is small, resulting in difficulties in learning the concepts through a small number of labeled samples. In addition, there is always a small interclass variance and a large intraclass variance among categories. Weak labels, few-shot problems, and fine-grained analysis are the key challenges affecting the performance of the classification model. In this paper, we develop a progressive training technique to address the few-shot challenge, along with a weak-label boosting method, by considering all of the weak IDs as negative samples of every predefined ID in order to take full advantage of the more numerous weak-label data. We introduce an instance-aware hard ID mining strategy in the classification loss and then further develop the global and local feature-mapping loss to expand the decision margin. We entered the proposed method into the Kaggle competition, which aims to build an algorithm to identify individual humpback whales in images. With a few other common training tricks, the proposed approach won first place in the competition. All three problems (weak labels, few-shot problems, and fine-grained analysis) exist in the dataset used in the competition. Additionally, we applied our method to CUB-2011 and Cars-196, which are the most widely-used datasets for fine-grained visual categorization tasks, and achieved respective accuracies of 90.1% and 94.9%. This experiment shows that the proposed method achieves the optimal effect compared with other common baselines, and verifies the effectiveness of our method. Our solution has been made available as an open source project.