arXiv subjects

Xin Xu

Publications and source records attributed to Xin Xu.

At least 271 records · Page 15Linked to original sources

arXiv2021

A Dual-level Model Predictive Control Scheme for Multi-timescale Dynamical Systems--Extended Version

So far, many control algorithms have been developed for singularly perturbed systems. However, in many industrial processes, enforcing closed-loop fast-slow dynamics for peculiarly non-separable ones is a prior request and a crucial issue to be resolved. Aiming at the above problem, this paper presents two dual-level model predictive control (MPC) algorithms for two-timescale dynamical systems with unknown bounded disturbance and input constraint. The proposed algorithms, each one composed of two regulators working in slow and fast time scales, are designed to generate closed-loop separable dynamics at the high and low levels. As a key feature, the proposed algorithms are not only suitable for singularly perturbed systems, but also capable of imposing separable closed-loop performance for dynamics that are non-separable and strongly coupled. The recursive feasibility and convergence properties are proven under suitable assumptions. The simulation results on controlling a Boiler Turbine (BT) system, including the comparisons with other classic controllers are reported, which show the effectiveness of the proposed algorithms.

eess.SY↗

arXiv2021

Galaxy Clusters from the DESI Legacy Imaging Surveys. I. Cluster Detection

Based on the photometric redshift catalog of Zou H. et al. (2019), we apply a fast clustering algorithm to identify 540,432 galaxy clusters at $z\lesssim1$ in the DESI legacy imaging surveys, which cover a sky area of about 20,000 deg$^2$. Monte-Carlo simulations indicate that the false detection rate of our detecting method is about 3.1\%. The total masses of galaxy clusters are derived using a calibrated richness--mass relation that are based on the observations of X-ray emission and Sunyaev \& Zel'dovich effect. The median redshift and mass of our detected clusters are about 0.53 and $1.23\times10^{14} M_\odot$, respectively. Comparing with previous clusters identified using the data of the Sloan Digital Sky Survey (SDSS), we can recognize most of them, especially those with high richness. Our catalog will be used for further statistical studies on galaxy clusters and environmental effects on the galaxy evolution, etc.

astro-ph.GA↗

arXiv2020

RTFN: Robust Temporal Feature Network

Time series analysis plays a vital role in various applications, for instance, healthcare, weather prediction, disaster forecast, etc. However, to obtain sufficient shapelets by a feature network is still challenging. To this end, we propose a novel robust temporal feature network (RTFN) that contains temporal feature networks and attentional LSTM networks. The temporal feature networks are built to extract basic features from input data while the attentional LSTM networks are devised to capture complicated shapelets and relationships to enrich features. In experiments, we embed RTFN into supervised structure as a feature extraction network and into unsupervised clustering as an encoder, respectively. The results show that the RTFN-based supervised structure is a winner of 40 out of 85 datasets and the RTFN-based unsupervised clustering performs the best on 4 out of 11 datasets in the UCR2018 archive.

cs.LG↗

arXiv2020

RTFN: A Robust Temporal Feature Network for Time Series Classification

Time series data usually contains local and global patterns. Most of the existing feature networks pay more attention to local features rather than the relationships among them. The latter is, however, also important yet more difficult to explore. To obtain sufficient representations by a feature network is still challenging. To this end, we propose a novel robust temporal feature network (RTFN) for feature extraction in time series classification, containing a temporal feature network (TFN) and an LSTM-based attention network (LSTMaN). TFN is a residual structure with multiple convolutional layers. It functions as a local-feature extraction network to mine sufficient local features from data. LSTMaN is composed of two identical layers, where attention and long short-term memory (LSTM) networks are hybridized. This network acts as a relation extraction network to discover the intrinsic relationships among the extracted features at different positions in sequential data. In experiments, we embed RTFN into a supervised structure as a feature extractor and into an unsupervised structure as an encoder, respectively. The results show that the RTFN-based structures achieve excellent supervised and unsupervised performance on a large number of UCR2018 and UEA2018 datasets.

cs.LG↗

arXiv2020

Asymptotic proximal point methods: finding the global minima with linear convergence for a class of multiple minima problems

We propose and analyze asymptotic proximal point (APP) methods to find the global minimizer for a class of nonconvex, nonsmooth, or even discontinuous multiple minima functions. The method is based on an asymptotic representation of nonconvex proximal points so that it can find the global minimizer without being trapped in saddle points, local minima, or even discontinuities. Our main result shows that the method enjoys the global linear convergence for such a class of functions. Furthermore, the method is derivative-free and its per-iteration cost, i.e., the number of function evaluations, is also bounded, so it has a complexity bound $\mathcal{O}(\log\frac{1}ε)$ for finding a point such that the gap between this point and the global minimizer is less than $ε>0$. Numerical experiments and comparisons in various dimensions from $2$ to $500$ demonstrate the benefits of the method.

math.OC↗

arXiv2020

Identifiability of Bifactor Models

The bifactor model and its extensions are multidimensional latent variable models, under which each item measures up to one subdimension on top of the primary dimension(s). Despite their wide applications to educational and psychological assessments, this type of multidimensional latent variable models may suffer from non-identifiability, which can further lead to inconsistent parameter estimation and invalid inference. The current work provides a relatively complete characterization of identifiability for the linear and dichotomous bifactor models and the linear extended bifactor model with correlated subdimensions. In addition, similar results for the two-tier models are also developed. Illustrative examples are provided on checking model identifiability through inspecting the factor loading structure. Simulation studies are reported that examine estimation consistency when the identifiability conditions are/are not satisfied.

math.ST↗

arXiv2020

On Periodical Damping Ratio of a Controlled Dynamical System with Parametric Resonances

This report provides an interpretation on the periodically varying damping ratio of a dynamical system with direct control of oscillation or vibration damping. The principal parametric resonance of the system and a new type of parametric resonance, named "zero-th order" parametric resonance, are investigated by using the method of multiple scales to find approximate, analytical solutions of the system, which provide an interpretation on such damping variations.

math.DS↗

arXiv2020

New Determination of Fundamental Properties of Palomar 5 Using Deep DESI Imaging Data

The legacy imaging surveys for the Dark Energy Spectroscopic Instrument project provides multiplecolor photometric data, which are about 2 mag deeper than the SDSS. In this study, we redetermine the fundamental properties for an old halo globular cluster of Palomar 5 based on these new imaging data, including structure parameters, stellar population parameters, and luminosity and mass functions. These characteristics, together with its tidal tails, are key for dynamical studies of the cluster and constraining the mass model of the Milky Way. By fitting the King model to the radial surface density profile of Palomar 5, we derive the core radius of $r_c$ = 2.96' $\pm$ 0.11', tidal radius of $r_t$ = 17.99' $\pm$ 1.49', and concentration parameter of $c$ = 0.78 $\pm$ 0.04. We apply a Bayesian analysis method to derive the stellar population properties and get an age of 11.508 $\pm$ 0.027 Gyr, metallicity of [Fe/H] = -1.798 $\pm$ 0.014, reddening of $E(B-V)$ = 0.0552 $\pm$ 0.0005, and distance modulus of $(m-M)_0$ = 16.835 $\pm$ 0.006. The main-sequence luminosity and mass functions for both the cluster center, and tidal tails are investigated. The luminosity and mass functions at different distances from the cluster center suggest that there is obvious spatial mass segregation. Many faint low-mass stars have been evaporated at the cluster center and the tidal tails are enhanced by low-mass stars. Both the concentration and relaxation times suggest that Palomar 5 is a totally relaxed system.

astro-ph.GA↗

arXiv2020

Re-identification = Retrieval + Verification: Back to Essence and Forward with a New Metric

Re-identification (re-ID) is currently investigated as a closed-world image retrieval task, and evaluated by retrieval based metrics. The algorithms return ranking lists to users, but cannot tell which images are the true target. In essence, current re-ID overemphasizes the importance of retrieval but underemphasizes that of verification, \textit{i.e.}, all returned images are considered as the target. On the other hand, re-ID should also include the scenario that the query identity does not appear in the gallery. To this end, we go back to the essence of re-ID, \textit{i.e.}, a combination of retrieval and verification in an open-set setting, and put forward a new metric, namely, Genuine Open-set re-ID Metric (GOM). GOM explicitly balances the effect of performing retrieval and verification into a single unified metric. It can also be decomposed into a family of sub-metrics, enabling a clear analysis of re-ID performance. We evaluate the effectiveness of GOM on the re-ID benchmarks, showing its ability to capture important aspects of re-ID performance that have not been taken into account by established metrics so far. Furthermore, we show GOM scores excellent in aligning with human visual evaluation of re-ID performance. Related codes are available at https://github.com/YuanXinCherry/Person-reID-Evaluation

cs.CV↗

arXiv2020

A Liouville theorem for an integral equation of the Ginzburg-Landau type

In this paper, we are concerned with a Liouville-type result of the nonlinear integral equation \begin{equation*} u(x)=\overrightarrow{l}+C_*\int_{\mathbb{R}^{n}}\frac{u(1-|u|^{2})}{|x-y|^{n-α}}dy. \end{equation*} Here $u: \mathbb{R}^{n} \to \mathbb{R}^{k}$ is a bounded, uniformly continuous and differentiable function with $k \geq 1$ and $1<α<n$, $\overrightarrow{l} \in \mathbb{R}^{k}$ is a constant vector, and $C_*$ is a real constant. If $u$ is the finite energy solution, we prove that $|\overrightarrow{l}| \in \{0,1\}$. Furthermore, we also give a Liouville type theorem (i.e., $u \equiv \overrightarrow{l}$).

math.AP↗

arXiv2020

Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix

Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data by performing clustering on the learned optimal embedding across views. Though demonstrating promising performance in various applications, most of existing methods usually linearly combine a group of pre-specified first-order Laplacian matrices to construct the optimal Laplacian matrix, which may result in limited representation capability and insufficient information exploitation. Also, storing and implementing complex operations on the $n\times n$ Laplacian matrices incurs intensive storage and computation complexity. To address these issues, this paper first proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix, and then extends it to the late fusion version for accurate and efficient multi-view clustering. Specifically, our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base Laplacian matrices simultaneously. By this way, the representative capacity of the learned optimal Laplacian matrix is enhanced, which is helpful to better utilize the hidden high-order connection information among data, leading to improved clustering performance. We design an efficient algorithm with proved convergence to solve the resultant optimization problem. Extensive experimental results on nine datasets demonstrate the superiority of our algorithm against state-of-the-art methods, which verifies the effectiveness and advantages of the proposed algorithm.

cs.LG↗

arXiv2020

SymmetryNet: Learning to Predict Reflectional and Rotational Symmetries of 3D Shapes from Single-View RGB-D Images

We study the problem of symmetry detection of 3D shapes from single-view RGB-D images, where severely missing data renders geometric detection approach infeasible. We propose an end-to-end deep neural network which is able to predict both reflectional and rotational symmetries of 3D objects present in the input RGB-D image. Directly training a deep model for symmetry prediction, however, can quickly run into the issue of overfitting. We adopt a multi-task learning approach. Aside from symmetry axis prediction, our network is also trained to predict symmetry correspondences. In particular, given the 3D points present in the RGB-D image, our network outputs for each 3D point its symmetric counterpart corresponding to a specific predicted symmetry. In addition, our network is able to detect for a given shape multiple symmetries of different types. We also contribute a benchmark of 3D symmetry detection based on single-view RGB-D images. Extensive evaluation on the benchmark demonstrates the strong generalization ability of our method, in terms of high accuracy of both symmetry axis prediction and counterpart estimation. In particular, our method is robust in handling unseen object instances with large variation in shape, multi-symmetry composition, as well as novel object categories.

cs.CV↗

arXiv2020

Planning and Operations of Mixed Fleets in Mobility-on-Demand Systems

Automated vehicles (AVs) are expected to be beneficial for Mobility-on-Demand (MoD), thanks to their ability of being globally coordinated. To facilitate the steady transition towards full autonomy, we consider the transition period of AV deployment, whereby an MoD system operates a mixed fleet of automated vehicles (AVs) and human-driven vehicles (HVs). In such systems, AVs are centrally coordinated by the operator, and the HVs might strategically respond to the coordination of AVs. We devise computationally tractable strategies to coordinate mixed fleets in MoD systems. Specifically, we model an MoD system with a mixed fleet using a Stackelberg framework where the MoD operator serves as the leader and human-driven vehicles serve as the followers. We develop two models: 1) a steady-state model to analyze the properties of the problem and determine the planning variables (e.g., compensations, prices, and the fleet size of AVs), and 2) a time-varying model to design a real-time coordination algorithm for AVs. The proposed models are validated using a case study inspired by real operational data of a MoD service in Singapore. Results show that the proposed algorithms can significantly improve system performance.

eess.SY↗

arXiv2020

Exploring Image Enhancement for Salient Object Detection in Low Light Images

Low light images captured in a non-uniform illumination environment usually are degraded with the scene depth and the corresponding environment lights. This degradation results in severe object information loss in the degraded image modality, which makes the salient object detection more challenging due to low contrast property and artificial light influence. However, existing salient object detection models are developed based on the assumption that the images are captured under a sufficient brightness environment, which is impractical in real-world scenarios. In this work, we propose an image enhancement approach to facilitate the salient object detection in low light images. The proposed model directly embeds the physical lighting model into the deep neural network to describe the degradation of low light images, in which the environment light is treated as a point-wise variate and changes with local content. Moreover, a Non-Local-Block Layer is utilized to capture the difference of local content of an object against its local neighborhood favoring regions. To quantitative evaluation, we construct a low light Images dataset with pixel-level human-labeled ground-truth annotations and report promising results on four public datasets and our benchmark dataset.

cs.CV↗

arXiv2020

Derivative-free global minimization for a class of multiple minima problems

We prove that the finite-difference based derivative-free descent (FD-DFD) methods have a capability to find the global minima for a class of multiple minima problems. Our main result shows that, for a class of multiple minima objectives that is extended from strongly convex functions with Lipschitz-continuous gradients, the iterates of FD-DFD converge to the global minimizer $x_*$ with the linear convergence $\|x_{k+1}-x_*\|_2^2\leqslantρ^k \|x_1-x_*\|_2^2$ for a fixed $0<ρ<1$ and any initial iteration $x_1\in\mathbb{R}^d$ when the parameters are properly selected. Since the per-iteration cost, i.e., the number of function evaluations, is fixed and almost independent of the dimension $d$, the FD-DFD algorithm has a complexity bound $\mathcal{O}(\log\frac{1}ε)$ for finding a point $x$ such that the optimality gap $\|x-x_*\|_2^2$ is less than $ε>0$. Numerical experiments in various dimensions from $5$ to $500$ demonstrate the benefits of the FD-DFD method.

math.OC↗

arXiv2020

LSTM Networks for Music Generation

The paper presents a method of the music generation based on LSTM (Long Short-Term Memory), contrasts the effects of different network structures on the music generation and introduces other methods used by some researchers.

eess.AS↗

arXiv2020

PointNet on FPGA for Real-Time LiDAR Point Cloud Processing

LiDAR sensors have been widely used in many autonomous vehicle modalities, such as perception, mapping, and localization. This paper presents an FPGA-based deep learning platform for real-time point cloud processing targeted on autonomous vehicles. The software driver for the Velodyne LiDAR sensor is modified and moved into the on-chip processor system, while the programmable logic is designed as a customized hardware accelerator. As the state-of-art deep learning algorithm for point cloud processing, PointNet is successfully implemented on the proposed FPGA platform. Targeted on a Xilinx Zynq UltraScale+ MPSoC ZCU104 development board, the FPGA implementations of PointNet achieve the computing performance of 182.1 GOPS and 280.0 GOPS for classification and segmentation respectively. The proposed design can support an input up to 4096 points per frame. The processing time is 19.8 ms for classification and 34.6 ms for segmentation, which meets the real-time requirement for most of the existing LiDAR sensors.

eess.SP↗

arXiv2020

Coordinated Path Following Control of Fixed-wing Unmanned Aerial Vehicles

In this paper, we investigate the problem of coordinated path following for fixed-wing UAVs with speed constraints in 2D plane. The objective is to steer a fleet of UAVs along the path(s) while achieving the desired sequenced inter-UAV arc distance. In contrast to the previous coordinated path following studies, we are able through our proposed hybrid control law to deal with the forward speed and the angular speed constraints of fixed-wing UAVs. More specifically, the hybrid control law makes all the UAVs work at two different levels: those UAVs whose path following errors are within an invariant set (i.e., the designed coordination set) work at the coordination level; and the other UAVs work at the single-agent level. At the coordination level, we prove that even with speed constraints, the proposed control law can make sure the path following errors reduce to zero, while the desired arc distances converge to the desired value. At the single-agent level, the convergence analysis for the path following error entering the coordination set is provided. We develop a hardware-in-the-loop simulation testbed of the multi-UAV system by using actual autopilots and the X-Plane simulator. The effectiveness of the proposed approach is corroborated with both MATLAB and the testbed.

eess.SY↗