24 June 2022 in IEEE Transactions on Intelligent Transportation Systems
Most existing studies modeled Adaptive Cruise Control (ACC) car-following (CF) behavior using conventional CF models which were originally built for human-driving vehicles (HVs) and calibrated with HV data. In this paper, firstly a learnable CF model is proposed by resorting to Long Short-Term Memory (LSTM) for ACC systems, which utilizes the ACC data for model construction and offers extraordinary adaptability and accuracy. Nevertheless, the applicability of the LSTM CF model is hindered by the scarce ACC data problem, as training the model requires a large amount of data. To address the ACC data scarcity problem, a transfer learning strategy for the LSTM model is further developed, leveraging on the large-scale open-source HV data and the similar driving patterns hidden in HV and ACC-equipped vehicles. In the transfer learning based LSTM model, a unified framework incorporating an alignment layer is developed to transfer the useful features from HV data and meanwhile calibrating the CF model with ACC data. Comparison results show that the proposed model outperforms other CF models which are built with only ACC data or using simple transfer learning methods. Further, microscopic simulations are performed to verify the applicability of the transfer learning based LSTM CF model.
14 July 2017 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity search is essential to many important applications and often involves searching at scale on high-dimensional data based on their similarity to a query. In biometric applications, recent vulnerability studies have shown that adversarial machine learning can compromise biometric recognition systems by exploiting the biometric similarity information. Existing methods for biometric privacy protection are in general based on pairwise matching of secured biometric templates and have inherent limitations in search efficiency and scalability. In this paper, we propose an inference-based framework for privacy-preserving similarity search in Hamming space. Our approach builds on an obfuscated distance measure that can conceal Hamming distance in a dynamic interval. Such a mechanism enables us to systematically design statistically reliable methods for retrieving most likely candidates without knowing the exact distance values. We further propose to apply Montgomery multiplication for generating search indexes that can withstand adversarial similarity analysis, and show that information leakage in randomized Montgomery domains can be made negligibly small. Our experiments on public biometric datasets demonstrate that the inference-based approach can achieve a search accuracy close to the best performance possible with secure computation methods, but the associated cost is reduced by orders of magnitude compared to cryptographic primitives.
1 March 2015 in Neurocomputing
25 September 2020 in Neural Processing Letters
1 August 2021 in Accident Analysis & Prevention
18 July 2022 in Expert Systems with Applications