On Feature Decorrelation in Cloth-Changing Person Re-identification

Hongjun Wang, Jiyuan Chen, Renhe Jiang, Xuan Song, Yinqiang ZhengarXiv 2024 · arXiv · OpenReview

Abstract

Traditional flood forecasting models often fail to capture the complex physical connectedness of river systems, leading to significant delays in warnings. This paper identifies "over-squashing" in Graph Neural Networks (GNNs) as a primary bottleneck, where information from upstream tributaries is lost as it passes through sparse, tree-like network structures. By transforming these networks into dense, reachability-based graphs, we reduce effective resistance and enable AI models to capture long-range dependencies. Our results demonstrate a 10-hour lead-time advantage over state-of-the-art baselines, significantly improving the predictive horizon for emergency management.

Introduction

Timely flood warnings are essential for saving lives and property. While deep learning, particularly Long Short-Term Memory (LSTM) networks, has advanced the field, these models often treat monitoring stations as isolated entities, ignoring the inherent physical "connectedness" of river systems. Graph Neural Networks (GNNs) are theoretically suited for this task, but their application has been hindered by the dendritic (tree-like) nature of river networks, which creates informational bottlenecks.

The Over-squashing Problem

The core challenge in applying GNNs to river networks is "over-squashing." In a typical river system, information from distant upstream tributaries must pass through a series of bottleneck nodes to reach downstream stations. Mathematically, this results in high "resistance distances." As signals travel through these bottlenecks, the information becomes so compressed and distorted that it fails to influence long-term predictions at the main river gauges.

Conceptual overview of the over-squashing problem (c) and the dense graph solution (e) compared to traditional topology (d).

Methodology: Reachability-based Graph Transformation

To overcome over-squashing, we introduce a Reachability-based Graph Transformation. Instead of representing the river network by its literal physical connections, we densify the graph based on hydrological reachability:

  1. Topological Distance Calculation: We determine the actual travel distance of water between any two nodes in the network.
  2. Dense Adjacency Matrix: We use a Gaussian Radial Basis Function (RBF) kernel to create a new adjacency matrix where every node is "connected" to others based on reachability. This effectively provides "shortcuts" for information flow.
  3. Resistance Reduction: This transformation mathematically reduces the "effective resistance" between nodes. By providing these shortcuts, we prevent the Jacobian matrix of the node features from vanishing, ensuring that upstream signals remain sharp and influential even over long distances.

Experimental Setup and Datasets

The study utilized the LamaH-CE (Large-Sample DAta for Hydrology and Environmental Sciences for Central Europe) dataset, covering approximately 170,000 km² including Austria and surrounding regions. We focused on a connected subgraph of 358 stations with high-quality, continuous hourly data from 2000 to 2017. The dataset includes streamflow discharge and 15 meteorological variables, plus 60 catchment attributes like topography and land use.

Visualization of the river network subgraph from the LamaH-CE dataset.

Results and Discussion

Our dense-GNN approach demonstrated a clear superiority in long-term forecasting compared to the high-performing Entity-Aware LSTM (EA-LSTM) baseline:

  • 10-Hour Lead Time Advantage: GNNs using the dense graph transformation achieved the same accuracy at a 24-hour horizon as the baseline EA-LSTM did at 14 hours.
  • Predictive Horizon Improvement: This represents a 71% improvement in the long-term predictive horizon while maintaining equivalent accuracy.
  • Handling Extreme Events: The method is particularly robust during "spiked" floods, where rapid convergence from multiple distant tributaries often overwhelms traditional models. The Graph Attention Network (GAT) architecture emerged as the top performer, maintaining superior accuracy with a 13.3-hour lead time advantage in some scenarios.
  • High Discharge Robustness: While all models lose accuracy as discharge volume increases, the dense-GNNs maintained significantly higher Nash-Sutcliffe Efficiency (NSE) values during extreme high-flow events compared to "isolated" models that ignored topology.

Conclusion

By reimagining river networks as dense, reachable graphs, we can mitigate the mathematical limitations of standard GNNs in hydrological contexts. This approach not only proves that river topology is a vital feature for AI models but also provides emergency managers with critical extra hours of lead time, potentially transforming flood response strategies globally. Future work will explore the generalizability of this method across different climates and the potential for hybrid modeling with traditional hydrodynamic simulations.

Summary updated

Abstract

Cloth-changing person re-identification (CC-ReID) poses a significant challenge in computer vision. A prevailing approach is to prompt models to concentrate on causal attributes, like facial features and hairstyles, rather than confounding elements such as clothing appearance. Traditional methods to achieve this involve integrating multi-modality data or employing manually annotated clothing labels, which tend to complicate the model and require extensive human effort. In our study, we demonstrate that simply reducing feature correlations during training can significantly enhance the baseline model's performance. We theoretically elucidate this effect and introduce a novel regularization technique based on density ratio estimation. This technique aims to minimize feature correlation in the training process of cloth-changing ReID baselines. Our approach is model-independent, offering broad enhancements without needing additional data or labels. We validate our method through comprehensive experiments on prevalent CC-ReID datasets, showing its effectiveness in improving baseline models' generalization capabilities.
BibTeX
@misc{wang2024feature,
  author = {Hongjun Wang and Jiyuan Chen and Renhe Jiang and Xuan Song and Yinqiang Zheng},
  title = {{On Feature Decorrelation in Cloth-Changing Person Re-identification}},
  year = {2024},
  eprint = {2410.05536},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2410.05536},
}
Figure