Gait recognition has attracted increasing attention in both academia and industry as a non-intrusive human recognition technology from a distance without requiring cooperation. Triplet loss, which enforces relative distance constraints, is a fundamental component in gait recognition. Recently, several gait-specific triplet losses have been introduced to gait recognition. However, they only focus on sample selection and weighting to enhance constraints without exploring the gradient properties of Cosine/Euclidean metrics, which fundamentally influence the model training efficiency and feature discriminability. In this paper, we theoretically analyze triplet loss gradients combined with weight decay and identify inherent limitations due to inadequate norm-control: Cosine metric triplet loss (Lcos) exhibits excessive gradients resulting from small feature norms, while Euclidean metric triplet loss (Leuc) suffers from a small margin-to-norm ratio due to large feature norms. To address these issues, we propose two norm-control approaches to constrain the feature norm in a stable range: 1) Norm-Variance-Regularized Collaboration. 2) Norm-Based Regularization. Extensive experiments show that our methods outperform state-of-the-art results under both Cosine and Euclidean evaluation metrics on three in-the-wild datasets: Gait3D, GREW, and BUAA-Duke-Gait. The code will be available at https://github.com/bgdpgz/TL-Gait.

Gait recognition aims to identify individuals based on their body shape and walking patterns. Though much progress has been achieved driven by deep learning, gait recognition in real-world surveillance scenarios remains quite challenging to current methods. Conventional approaches, which rely on periodic gait cycles and controlled environments, struggle with the non-periodic and occluded silhouette sequences encountered in the wild. In this paper, we propose a novel framework,TrackletGait, designed to address these challenges in the wild. We propose Random Tracklet Sampling, a generalization of existing sampling methods, which strikes a balance between robustness and representation in capturing diverse walking patterns. Next, we introduce Haar Wavelet-based Downsampling to preserve information during spatial downsampling. Finally, we present a Hardness Exclusion Triplet Loss, designed to exclude low-quality silhouettes by discarding hard triplet samples. TrackletGait achieves state-of-the-art results, with 77.8% and 80.4% rank-1 accuracy on the Gait3D and GREW datasets, respectively, while using only 10.3M backbone parameters. Extensive experiments are also conducted to further investigate the factors affecting gait recognition in the wild.

Gait recognition has attracted increasing attention from academia and industry as a human recognition technology from a distance in non-intrusive ways without requiring cooperation. Although advanced methods have achieved impressive success in lab scenarios, most of them perform poorly in the wild. Recently, some Convolution Neural Networks (ConvNets) based methods have been proposed to address the issue of gait recognition in the wild. However, the temporal receptive field obtained by convolution operations is limited for long gait sequences. If directly replacing convolution blocks with visual transformer blocks, the model may not enhance a local temporal receptive field, which is important for covering a complete gait cycle. To address this issue, we design a Global-Local Temporal Receptive Field Network (GLGait). GLGait employs a Global-Local Temporal Module (GLTM) to establish a global-local temporal receptive field, which mainly consists of a Pseudo Global Temporal Self-Attention (PGTA) and a temporal convolution operation. Specifically, PGTA is used to obtain a pseudo global temporal receptive field with less memory and computation complexity compared with a multi-head self-attention (MHSA). The temporal convolution operation is used to enhance the local temporal receptive field. Besides, it can also aggregate pseudo global temporal receptive field to a true holistic temporal receptive field. Furthermore, we also propose a Center-Augmented Triplet Loss (CTL) in GLGait to reduce the intra-class distance and expand the positive samples in the training stage. Extensive experiments show that our method obtains state-of-the-art results on in-the-wild datasets, i.e., Gait3D and GREW. The code is available at https://github.com/bgdpgz/GLGait.

Gait is considered the walking pattern of human body, which includes both shape and motion cues. However, the main-stream appearance-based methods for gait recognition rely on the shape of silhouette. It is unclear whether motion can be explicitly represented in the gait sequence modeling. In this paper, we analyzed human walking using the Lagrange's equation and come to the conclusion that second-order information in the temporal dimension is necessary for identification. We designed a second-order motion extraction module based on the conclusions drawn. Also, a light weight view-embedding module is designed by analyzing the problem that current methods to cross-view task do not take view itself into consideration explicitly. Experiments on CASIA-B and OU-MVLP datasets show the effectiveness of our method and some visualization for extracted motion are done to show the interpretability of our motion extraction module.

Gait is considered an attractive biometric identifier for its non-invasive and non-cooperative features compared with other biometric identifiers such as fingerprint and iris. At present, cross-view gait recognition methods always establish representations from various deep convolutional networks for recognition and ignore the potential dynamical information of the gait sequences. If assuming that pedestrians have different walking patterns, gait recognition can be performed by calculating their dynamical features from each view. This paper introduces the Koopman operator theory to gait recognition, which can find an embedding space for a global linear approximation of a nonlinear dynamical system. Furthermore, a novel framework based on convolutional variational autoencoder and deep Koopman embedding is proposed to approximate the Koopman operators, which is used as dynamical features from the linearized embedding space for cross-view gait recognition. It gives solid physical interpretability for a gait recognition system. Experiments on a large public dataset, OU-MVLP, prove the effectiveness of the proposed method.

Since the development of computer science, our lives have become increasingly dependent on software. While we enjoy the benefits and convenience that software programs provide, we cannot ignore issues with software reliability, complexity, and security. Since the introduction of complex networks, people have been using software network to analyze software problems; however, traditional software network models are not currently capable of analyzing software with large scale and complex structures. In this paper, a new software network model is proposed, with which each node in the network can be assigned a set of coordinates that reflect its function-call information and make the disorder of the network graph more orderly. Additionally, characteristics and derivatives of the model are thoroughly examined and analyzed. A case study using the coordinate model combined with bug information is then conducted to analyze five different software programs. The results show that the proposed model can be used to analyze the relationship between nodes or defects distribution and software network parameters, as well as high-risk module excavation through a defect density analysis. Compared to traditional software network models, the model maintains the inner logic relationship of the software systems better, which makes it easier to analyze many aspects of software.

With the increase of scale and complexity of software systems as well as the long existing threats of software accidents such as Therac-25 radiation exposure and the Toyota Prius braking system failure, improving the reliability and quality has become the major pressure in developing safety-or security-critical software systems. Since more and more large-scale software systems exhibit the properties of complex network, how can we employ the concepts and metrics of complex networks to the area of software engineering? What structural patterns can be used as indications for software quality and reliability? Though applying the concept of complex network to the field of software engineering has attracted attentions from both the academia and industry, these questions have not been researched thoroughly with satisfactory unanimity. In this study, we analyzed the bug distribution in 1,047 versions of four open source software projects downloaded from GitHub with complex network theory and focused on the correlation between software bugs and a specific type of software network structure -- network motifs. Our results indicate that the functions containing bugs are more likely to be involved in feedforward loop motifs, one type of network motifs with highest degree of uniqueness. This paper could serve as a guide to further investigate the nature of software failures and a powerful tool for software fault prediction and quality evaluation.