In order to reduce traffic accidents caused by the pedestrian, five kinds of dangerous pedestrian abnormal behaviors are studied in the paper. A behavior model between the pedestrian trajectory and the road is built t...
详细信息
Moving object detection is an important application of computer vision. Commonly used foreground separation algorithms such as Gaussian mixture modeling, ViBe, frame difference method, etc., do not consider the color ...
详细信息
The main appearance difference between different types of vehicles is located in the front face area, so the car face parts detection is a key role in fine-grained vehicle recognition. This paper presents a faster R-C...
详细信息
Group re-identification (G-ReID) aims to re-identify a group of people that is observed from non-overlapping camera systems. The existing literature has mainly addressed RGB-based problems, but RGB-infrared (RGB-IR) c...
Group re-identification (G-ReID) aims to re-identify a group of people that is observed from non-overlapping camera systems. The existing literature has mainly addressed RGB-based problems, but RGB-infrared (RGB-IR) cross-modality matching problem has not been studied yet. In this paper, we propose a metric learning method Closest Permutation Matching (CPM) for RGB-IR G-ReID. We model each group as a set of single-person features which are extracted by MPANet, then we propose the metric Closest Permutation Distance (CPD) to measure the similarity between two sets of features. CPD is invariant with order changes of group members so that it solves the layout change problem in G-ReID. Furthermore, we introduce the problem of G-ReID without person labels. In the weak-supervised case, we design the Relation-aware Module (RAM) that exploits visual context and relations among group members to produce a modality-invariant order of features in each group, with which group member features within a set can be sorted to form a robust group representation against modality change. To support the study on RGB-IR G-ReID, we construct a new large-scale RGB-IR G-ReID dataset CM-Group. The dataset contains 15,440 RGB images and 15,506 infrared images of 427 groups and 1,013 identi-ties. Extensive experiments on the new dataset demonstrate the effectiveness of the proposed models and the complexity of CM-Group. The code and dataset are available at: https://***/WhollyOat/CM-Group.
Moving object detection is an important application of computer vision. Commonly used foreground separation algorithms such as Gaussian mixture modeling, ViBe, frame difference method, etc., do not consider the color ...
详细信息
ISBN:
(数字)9781728152448
ISBN:
(纸本)9781728152455
Moving object detection is an important application of computer vision. Commonly used foreground separation algorithms such as Gaussian mixture modeling, ViBe, frame difference method, etc., do not consider the color of shadow and recognize the shadow of a moving object as a part of the moving object. In many cases, the shadow detection effect is not good. Focus on the detection of moving object shadows in traffic surveillance videos, this paper improves the existing ViBe algorithm, considers the color characteristics of the shadows, recognizes the shadows as part of the background, gains a smaller amount of calculation and better effect of shadow detection with the advantages of ViBe.
Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoi...
详细信息
Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoint of sparse subspace learning. By minimizing the reconstruction residual, the learned feature weight matrix with the l 2,1 -norm and the non-negative constraints not only removes the irrelevant features, but also captures the underlying low dimensional structure of the data points. Meanwhile in order to enhance the model's robustness, l 1 -norm error function is used to resistant to outliers and sparse noise. An efficient iterative algorithm is introduced to optimize this non-convex and non-smooth objective function and the proof of its convergence is given. Although, there is a subtraction item in our multiplicative update rule, we validate its non-negativity. The superiority of our model is demonstrated by comparative experiments on various original datasets with and without malicious pollution.
暂无评论