Coarse-to-Fine Adaptive People Detection for Video Sequences by Maximizing Mutual Information

Applying people detectors to unseen data is challenging since patterns distributions, such as viewpoints, motion, poses, backgrounds, occlusions and people sizes, may significantly differ from the ones of the training dataset. In this paper, we propose a coarse-to-fine framework to adapt frame by frame people detectors during runtime classification, without requiring any additional manually labeled ground truth apart from the offline training of the detection model. Such adaptation make use of multiple detectors mutual information, i.e., similarities and dissimilarities of detectors estimated and agreed by pair-wise correlating their outputs. Globally, the proposed adaptation discriminates between relevant instants in a video sequence, i.e., identifies the representative frames for an adaptation of the system. Locally, the proposed adaptation identifies the best configuration (i.e., detection threshold) of each detector under analysis, maximizing the mutual information to obtain the detection threshold of each detector. The proposed coarse-to-fine approach does not require training the detectors for each new scenario and uses standard people detector outputs, i.e., bounding boxes. The experimental results demonstrate that the proposed approach outperforms state-of-the-art detectors whose optimal threshold configurations are previously determined and fixed from offline training dataThis work has been partially supported by the Spanish government under the project TEC2014-53176-R (HAVideo

Entropy of Overcomplete Kernel Dictionaries

In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the orthogonality condition of the atoms, yielding overcomplete dictionaries with an extended number of atoms. More generally than the linear decomposition, overcomplete kernel dictionaries provide an elegant nonlinear extension by defining the atoms through a mapping kernel function (e.g., the gaussian kernel). Models based on such kernel dictionaries are used in neural networks, gaussian processes and online learning with kernels. The quality of an overcomplete dictionary is evaluated with a diversity measure the distance, the approximation, the coherence and the Babel measures. In this paper, we develop a framework to examine overcomplete kernel dictionaries with the entropy from information theory. Indeed, a higher value of the entropy is associated to a further uniform spread of the atoms over the space. For each of the aforementioned diversity measures, we derive lower bounds on the entropy. Several definitions of the entropy are examined, with an extensive analysis in both the input space and the mapped feature space.Comment: 10 page

Adaptive Multiscale Weighted Permutation Entropy for Rolling Bearing Fault Diagnosis

© 2020 The Author(s). This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.Bearing vibration signals contain non-linear and non-stationary features due to instantaneous variations in the operation of rotating machinery. It is important to characterize and analyze the complexity change of the bearing vibration signals so that bearing health conditions can be accurately identified. Entropy measures are non-linear indicators that are applicable to the time series complexity analysis for machine fault diagnosis. In this paper, an improved entropy measure, termed Adaptive Multiscale Weighted Permutation Entropy (AMWPE), is proposed. Then, a new rolling bearing fault diagnosis method is developed based on the AMWPE and multi-class SVM. For comparison, experimental bearing data are analyzed using the AMWPE, compared with the conventional entropy measures, where a multi-class SVM is adopted for fault type classification. Moreover, the robustness of different entropy measures is further studied for the analysis of noisy signals with various Signal-to-Noise Ratios (SNRs). The experimental results have demonstrated the effectiveness of the proposed method in fault diagnosis of rolling bearing under different fault types, severity degrees, and SNR levels.Peer reviewedFinal Accepted Versio