arXiv subjects

Xiaoli Liu

Publications and source records attributed to Xiaoli Liu.

50 records · Page 3Linked to original sources

arXiv2021

Mobile Augmented Reality: User Interfaces, Frameworks, and Intelligence

Mobile Augmented Reality (MAR) integrates computer-generated virtual objects with physical environments for mobile devices. MAR systems enable users to interact with MAR devices, such as smartphones and head-worn wearables, and performs seamless transitions from the physical world to a mixed world with digital entities. These MAR systems support user experiences by using MAR devices to provide universal accessibility to digital contents. Over the past 20 years, a number of MAR systems have been developed, however, the studies and design of MAR frameworks have not yet been systematically reviewed from the perspective of user-centric design. This article presents the first effort of surveying existing MAR frameworks (count: 37) and further discusses the latest studies on MAR through a top-down approach: 1) MAR applications; 2) MAR visualisation techniques adaptive to user mobility and contexts; 3) systematic evaluation of MAR frameworks including supported platforms and corresponding features such as tracking, feature extraction plus sensing capabilities; and 4) underlying machine learning approaches supporting intelligent operations within MAR systems. Finally, we summarise the development of emerging research fields, current state-of-the-art, and discuss the important open challenges and possible theoretical and technical directions. This survey aims to benefit both researchers and MAR system developers alike.

cs.HC↗

arXiv2021

Low-Cost Outdoor Air Quality Monitoring and Sensor Calibration: A Survey and Critical Analysis

The significance of air pollution and the problems associated with it are fueling deployments of air quality monitoring stations worldwide. The most common approach for air quality monitoring is to rely on environmental monitoring stations, which unfortunately are very expensive both to acquire and to maintain. Hence environmental monitoring stations are typically sparsely deployed, resulting in limited spatial resolution for measurements. Recently, low-cost air quality sensors have emerged as an alternative that can improve the granularity of monitoring. The use of low-cost air quality sensors, however, presents several challenges: they suffer from cross-sensitivities between different ambient pollutants; they can be affected by external factors, such as traffic, weather changes, and human behavior; and their accuracy degrades over time. Periodic re-calibration can improve the accuracy of low-cost sensors, particularly with machine-learning-based calibration, which has shown great promise due to its capability to calibrate sensors in-field. In this article, we survey the rapidly growing research landscape of low-cost sensor technologies for air quality monitoring and their calibration using machine learning techniques. We also identify open research challenges and present directions for future research.

eess.SP↗

arXiv2020

A robust low data solution: dimension prediction of semiconductor nanorods

Precise control over dimension of nanocrystals is critical to tune the properties for various applications. However, the traditional control through experimental optimization is slow, tedious and time consuming. Herein a robust deep neural network-based regression algorithm has been developed for precise prediction of length, width, and aspect ratios of semiconductor nanorods (NRs). Given there is limited experimental data available (28 samples), a Synthetic Minority Oversampling Technique for regression (SMOTE-REG) has been employed for the first time for data generation. Deep neural network is further applied to develop regression model which demonstrated the well performed prediction on both the original and generated data with a similar distribution. The prediction model is further validated with additional experimental data, showing accurate prediction results. Additionally, Local Interpretable Model-Agnostic Explanations (LIME) is used to interpret the weight for each variable, which corresponds to its importance towards the target dimension, which is approved to be well correlated well with experimental observations.

cs.LG↗

arXiv2020

SDMTL: Semi-Decoupled Multi-grained Trajectory Learning for 3D human motion prediction

Predicting future human motion is critical for intelligent robots to interact with humans in the real world, and human motion has the nature of multi-granularity. However, most of the existing work either implicitly modeled multi-granularity information via fixed modes or focused on modeling a single granularity, making it hard to well capture this nature for accurate predictions. In contrast, we propose a novel end-to-end network, Semi-Decoupled Multi-grained Trajectory Learning network (SDMTL), to predict future poses, which not only flexibly captures rich multi-grained trajectory information but also aggregates multi-granularity information for predictions. Specifically, we first introduce a Brain-inspired Semi-decoupled Motion-sensitive Encoding module (BSME), effectively capturing spatiotemporal features in a semi-decoupled manner. Then, we capture the temporal dynamics of motion trajectory at multi-granularity, including fine granularity and coarse granularity. We learn multi-grained trajectory information using BSMEs hierarchically and further capture the information of temporal evolutional directions at each granularity by gathering the outputs of BSMEs at each granularity and applying temporal convolutions along the motion trajectory. Next, the captured motion dynamics can be further enhanced by aggregating the information of multi-granularity with a weighted summation scheme. Finally, experimental results on two benchmarks, including Human3.6M and CMU-Mocap, show that our method achieves state-of-the-art performance, demonstrating the effectiveness of our proposed method. The code will be available if the paper is accepted.

cs.CV↗

arXiv2020

TrajectoryNet: a new spatio-temporal feature learning network for human motion prediction

Human motion prediction is an increasingly interesting topic in computer vision and robotics. In this paper, we propose a new 2D CNN based network, TrajectoryNet, to predict future poses in the trajectory space. Compared with most existing methods, our model focuses on modeling the motion dynamics with coupled spatio-temporal features, local-global spatial features and global temporal co-occurrence features of the previous pose sequence. Specifically, the coupled spatio-temporal features describe the spatial and temporal structure information hidden in the natural human motion sequence, which can be mined by covering the space and time dimensions of the input pose sequence with the convolutional filters. The local-global spatial features that encode different correlations of different joints of the human body (e.g. strong correlations between joints of one limb, weak correlations between joints of different limbs) are captured hierarchically by enlarging the receptive field layer by layer and residual connections from the lower layers to the deeper layers in our proposed convolutional network. And the global temporal co-occurrence features represent the co-occurrence relationship that different subsequences in a complex motion sequence are appeared simultaneously, which can be obtained automatically with our proposed TrajectoryNet by reorganizing the temporal information as the depth dimension of the input tensor. Finally, future poses are approximated based on the captured motion dynamics features. Extensive experiments show that our method achieves state-of-the-art performance on three challenging benchmarks (e.g. Human3.6M, G3D, and FNTU), which demonstrates the effectiveness of our proposed method. The code will be available if the paper is accepted.

cs.CV↗

arXiv2020

Interpretable Machine Learning Model for Early Prediction of Mortality in Elderly Patients with Multiple Organ Dysfunction Syndrome (MODS): a Multicenter Retrospective Study and Cross Validation

Background: Elderly patients with MODS have high risk of death and poor prognosis. The performance of current scoring systems assessing the severity of MODS and its mortality remains unsatisfactory. This study aims to develop an interpretable and generalizable model for early mortality prediction in elderly patients with MODS. Methods: The MIMIC-III, eICU-CRD and PLAGH-S databases were employed for model generation and evaluation. We used the eXtreme Gradient Boosting model with the SHapley Additive exPlanations method to conduct early and interpretable predictions of patients' hospital outcome. Three types of data source combinations and five typical evaluation indexes were adopted to develop a generalizable model. Findings: The interpretable model, with optimal performance developed by using MIMIC-III and eICU-CRD datasets, was separately validated in MIMIC-III, eICU-CRD and PLAGH-S datasets (no overlapping with training set). The performances of the model in predicting hospital mortality as validated by the three datasets were: AUC of 0.858, sensitivity of 0.834 and specificity of 0.705; AUC of 0.849, sensitivity of 0.763 and specificity of 0.784; and AUC of 0.838, sensitivity of 0.882 and specificity of 0.691, respectively. Comparisons of AUC between this model and baseline models with MIMIC-III dataset validation showed superior performances of this model; In addition, comparisons in AUC between this model and commonly used clinical scores showed significantly better performance of this model. Interpretation: The interpretable machine learning model developed in this study using fused datasets with large sample sizes was robust and generalizable. This model outperformed the baseline models and several clinical scores for early prediction of mortality in elderly ICU patients. The interpretative nature of this model provided clinicians with the ranking of mortality risk features.

physics.med-ph↗

arXiv2019

Sleep Stage Classification Using Bidirectional LSTM in Wearable Multi-sensor Systems

Understanding the sleep quality and architecture is essential to human being's health, which is usually represented using multiple sleep stages. A standard sleep stage determination requires Electroencephalography (EEG) signals during the expensive and labor-intensive Polysomnography (PSG) test. To overcome this inconvenience, cardiorespiratory signals are proposed for the same purpose because of the easy and comfortable acquisition by simplified devices. In this paper, we leverage our low-cost wearable multi-sensor system to acquire the cardiorespiratory signals from subjects. Three novel features are designed during the feature extraction. We then apply a Bi-directional Recurrent Neural Network architecture with Long Short-term Memory (BLSTM) to predict the four-class sleep stages. Our prediction accuracy is 80.25% on a large public dataset (417 subjects), and 80.75% on our 32 enrolled subjects, respectively. Our results outperform the previous works which either used small data sets and had the potential over-fitting issues, or used the conventional machine learning methods on large data sets.

eess.SP↗

arXiv2019

PISEP^2: Pseudo Image Sequence Evolution based 3D Pose Prediction

Pose prediction is to predict future poses given a window of previous poses. In this paper, we propose a new problem that predicts poses using 3D joint coordinate sequences. Different from the traditional pose prediction based on Mocap frames, this problem is convenient to use in real applications due to its simple sensors to capture data. We also present a new framework, PISEP^2 (Pseudo Image Sequence Evolution based 3D Pose Prediction), to address this new problem. Specifically, a skeletal representation is proposed by transforming the joint coordinate sequence into an image sequence, which can model the different correlations of different joints. With this image based skeletal representation, we model the pose prediction as the evolution of image sequence. Moreover, a novel inference network is proposed to predict all future poses in one step by decoupling the decoders in a non-recursive manner. Compared with the recursive sequence to sequence model, we can improve the computational efficiency and avoid error accumulation significantly. Extensive experiments are carried out on two benchmark datasets (e.g. G3D and FNTU). The proposed method achieves the state-of-the-art performance on both datasets, which demonstrates the effectiveness of our proposed method.

cs.CV↗

arXiv2019

Two-block vs. Multi-block ADMM: An empirical evaluation of convergence

Alternating Direction Method of Multipliers (ADMM) has become a widely used optimization method for convex problems, particularly in the context of data mining in which large optimization problems are often encountered. ADMM has several desirable properties, including the ability to decompose large problems into smaller tractable sub-problems and ease of parallelization, that are essential in these scenarios. The most common form of ADMM is the two-block, in which two sets of primal variables are updated alternatingly. Recent years have seen advances in multi-block ADMM, which update more than two blocks of primal variables sequentially. In this paper, we study the empirical question: {\em Is two-block ADMM always comparable with sequential multi-block ADMM solving an equivalent problem?} In the context of optimization problems arising in multi-task learning, through a comprehensive set of experiments we surprisingly show that multi-block ADMM consistently outperformed two-block ADMM on optimization performance, and as a consequence on prediction performance, across all datasets and for the entire range of dual step sizes. Our results have an important practical implication: rather than simply using the popular two-block ADMM, one may considerably benefit from experimenting with multi-block ADMM applied to an equivalent problem.

stat.ML↗

arXiv2019

Near-field imaging of locally perturbed periodic surfaces

This paper concerns the inverse scattering problem to reconstruct a locally perturbed periodic surface. Different from scattering problems with quasi-periodic incident fields and periodic surfaces, the scattered fields are no longer quasi-periodic. Thus the classical method for quasi-periodic scattering problems no longer works. In this paper, we apply a Floquet-Bloch transform based numerical method to reconstruct both the unknown periodic part and the unknown local perturbation from the near-field data. By transforming the original scattering problem into one defined in an infinite rectangle, the information of the surface is included in the coefficients. The numerical scheme contains two steps. The first step is to obtain an initial guess, i.e., the locations of both the periodic surfaces and the local perturbations, from a sampling method. The second step is to reconstruct the surface. As is proved in this paper, for some incident fields, the corresponding scattered fields carry little information of the perturbation. In this case, we use this scattered field to reconstruct the periodic surface. Then we could apply the data that carries more information of the perturbation to reconstruct the local perturbation. The Newton-CG method is applied to solve the associated optimization problems. Numerical examples are given at the end of this paper to show the efficiency of the numerical method.

math.NA↗

arXiv2018

Highly Efficient 8-bit Low Precision Inference of Convolutional Neural Networks with IntelCaffe

High throughput and low latency inference of deep neural networks are critical for the deployment of deep learning applications. This paper presents the efficient inference techniques of IntelCaffe, the first Intel optimized deep learning framework that supports efficient 8-bit low precision inference and model optimization techniques of convolutional neural networks on Intel Xeon Scalable Processors. The 8-bit optimized model is automatically generated with a calibration process from FP32 model without the need of fine-tuning or retraining. We show that the inference throughput and latency with ResNet-50, Inception-v3 and SSD are improved by 1.38X-2.9X and 1.35X-3X respectively with neglectable accuracy loss from IntelCaffe FP32 baseline and by 56X-75X and 26X-37X from BVLC Caffe. All these techniques have been open-sourced on IntelCaffe GitHub1, and the artifact is provided to reproduce the result on Amazon AWS Cloud.

cs.CV↗

arXiv2018

A direct imaging method for inverse scattering by unbounded rough surfaces

This paper is concerned with the inverse scattering problem by an unbounded rough surface. A direct imaging method is proposed to reconstruct the rough surface from the scattered near-field Cauchy data generating by point sources and measured on a horizontal straight line segment at a finite distance above the rough surface. Theoretical analysis of the imaging algorithm is given for the case of a penetrable rough surface, but the imaging algorithm also works for impenetrable surfaces with Dirichlet or impedance boundary conditions. Numerical experiments are presented to show that the direct imaging algorithm is fast, accurate and very robust with respect to noise in the data.

math.NA↗

arXiv2018

Near-field imaging of an unbounded elastic rough surface with a direct imaging method

This paper is concerned with the inverse scattering problem of time-harmonic elastic waves by an unbounded rigid rough surface. A direct imaging method is developed to reconstruct the unbounded rough surface from the elastic scattered near-field Cauchy data generated by point sources. A Helmholtz-Kirchhoff-type identity is derived and then used to provide a theoretical analysis of the direct imaging algorithm. Numerical experiments are presented to show that the direct imaging algorithm is fast, accurate and robust with respect to noise in the data.

math.NA↗

arXiv2018

A direct imaging method for inverse elastic scattering by unbounded rigid rough surfaces

This paper is concerned with the inverse time-harmonic elastic scattering problem of recovering unbounded rough surfaces in two dimensions. We assume that elastic plane waves with different directions are incident onto a rigid rough surface in a half plane. The elastic scattered field is measured on a horizontal straight line segment within a finite distance above the rough surface. A direct imaging algorithm is proposed to recover the unbounded rough surface from the scattered near-field data, which involves only inner products between the data. Numerical experiments are presented to show that the inversion scheme is not only efficient but also accurate and robust with respect to noise.

math.NA↗