Search

This paper presents a control algorithm for a micro-electro-mechanical system (MEMS) fast steering mirror (FSM), whose performance is poor in open loop control mode. Based on the characterization and parameter identification of MEMS FSM, an improved double step algorithm is proposed to shorten the settling time and improve its quasi-static working bandwidth. A characterization system is set up, in which an optical sensor is utilized to monitor the tilt angle of FSM. The performance of the FSM in the time and frequency domain are both acquired, while the critical parameters of the FSM model are identified. Finally, the closed-loop experiments for the FSM are done to verify the effectiveness of the control algorithm. The experimental results demonstrate that the settling time (98%) of the FSM is effectively reduced from 398 ms to 0.4 ms under the improved double step control mode, which has a better tracking performance and tiny overshoot, compared with the open loop control mode.

Recent research advances in salient object detection (SOD) could largely be attributed to ever-stronger multi-scale feature representation empowered by the deep learning technologies. The existing SOD deep models extract multi-scale features via the off-the-shelf encoders and combine them smartly via various delicate decoders. However, the kernel sizes in this commonly-used thread are usually “fixed”. In our new experiments, we have observed that kernels of small size are preferable in scenarios containing tiny salient objects. In contrast, large kernel sizes could perform better for images with large salient objects. Inspired by this observation, we advocate the “dynamic” scale routing (as a brand-new idea) in this paper. It will result in a generic plug-in that could directly fit the existing feature backbone. This paper’s key technical innovations are two-fold. First, instead of using the vanilla convolution with fixed kernel sizes for the encoder design, we propose the dynamic pyramid convolution (DPConv), which dynamically selects the best-suited kernel sizes w.r.t. the given input. Second, we provide a self-adaptive bidirectional decoder design to accommodate the DPConv-based encoder best. The most significant highlight is its capability of routing between feature scales and their dynamic collection, making the inference process scale-aware. As a result, this paper continues to enhance the current SOTA performance. Both the code and dataset are publicly available at https://github.com/wuzhenyubuaa/DPNet. [ABSTRACT FROM AUTHOR]

We investigate privacy-preserving, video-based action recognition in deep learning, a problem with growing importance in smart camera applications. A novel adversarial training framework is formulated to learn an anonymization transform for input videos such that the trade-off between target utility task performance and the associated privacy budgets is explicitly optimized on the anonymized videos. Notably, the privacy budget, often defined and measured in task-driven contexts, cannot be reliably indicated using any single model performance because strong protection of privacy should sustain against any malicious model that tries to steal private information. To tackle this problem, we propose two new optimization strategies of model restarting and model ensemble to achieve stronger universal privacy protection against any attacker models. Extensive experiments have been carried out and analyzed. On the other hand, given few public datasets available with both utility and privacy labels, the data-driven (supervised) learning cannot exert its full power on this task. We first discuss an innovative heuristic of cross-dataset training and evaluation, enabling the use of multiple single-task datasets (one with target task labels and the other with privacy labels) in our problem. To further address this dataset challenge, we have constructed a new dataset, termed PA-HMDB51, with both target task labels (action) and selected privacy attributes (skin color, face, gender, nudity, and relationship) annotated on a per-frame basis. This first-of-its-kind video dataset and evaluation protocol can greatly facilitate visual privacy research and open up other opportunities. Our codes, models, and the PA-HMDB51 dataset are available at: https://github.com/VITA-Group/PA-HMDB51 [ABSTRACT FROM AUTHOR]

A new testing method (oscillating wave method) has been proposed as a solution to the problem of short maintenance time in the traction power supply system, which could complete tests of winding and insulation via one connection and improve the maintenance efficiency of the transformer. Through the method being proved highly sensitive to winding faults, the variation under different winding states, however, remains unclear. This article aims to analyze oscillating wave signatures in the occurrence of axial displacement (AD). First, the modeling method will be proposed that can simulate oscillating wave signatures in different winding states. Then, the time-domain feature and the new proposed frequency-domain feature are applied to analyze the fault extent and location of AD fault. The results show that this model accurately simulates oscillating wave signatures. Moreover, the time-domain feature [Euclidean distance (ED)] is closely related to fault extent. The combined use of the time-domain feature (ED) and the frequency-domain feature (W-Energy entropy in Z-Score) is effective in the identification of fault location. These features, therefore, can provide the reference for winding state evaluation. [ABSTRACT FROM AUTHOR]

Repetitive or ambiguous environment, where structures are highly similar and distinct geometric features are not sufficient, is one of the critical and challenging scenarios for mobile robots to perform global localization or simultaneous localization and mapping (SLAM) tasks. The robots are easy to get lost or mismatched to wrong places in such environments. The existing solutions either rely heavily on pre-installed infrastructures which are inflexible and expensive or rely on single sensor-based global localization methods whose initialization module is not capable enough to provide distinctive information. Thus, this article proposes a hierarchical probabilistic framework that addresses the problem of infrastructure-free mobile robot global localization in GPS-challenged repetitive environments by leveraging both the measured magnetic field (MF) and Light Detection and Ranging (LiDAR) information. The proposed hierarchical system mainly consists of: 1) coarse localization: MF-based localization and 2) fine localization: LiDAR-based localization (LBL). The ambient MF functions as a substitute for the GPS signal, which is considered not available or severely challenged in indoor/semi-indoor local environments. Based on the pre-built MF database, multiple coarse candidate robot poses can first be determined by the proposed initial pose estimation algorithm, which incorporates multivariate Gaussian observation model and random sample consensus (RANSAC) algorithm. Then, using the obtained multiple candidate poses as initialization, the robot can be localized more accurately by LiDAR-based fine localization. Extensive real-world experiments demonstrate that the proposed system achieves over 95% localization success rate and takes less than 2.0-m average traveling distance to localize the mobile robot. [ABSTRACT FROM AUTHOR]