arXiv subjects

Xin Xu

Publications and source records attributed to Xin Xu.

At least 289 records · Page 16Linked to original sources

arXiv2020

Drosophila-Inspired 3D Moving Object Detection Based on Point Clouds

3D moving object detection is one of the most critical tasks in dynamic scene analysis. In this paper, we propose a novel Drosophila-inspired 3D moving object detection method using Lidar sensors. According to the theory of elementary motion detector, we have developed a motion detector based on the shallow visual neural pathway of Drosophila. This detector is sensitive to the movement of objects and can well suppress background noise. Designing neural circuits with different connection modes, the approach searches for motion areas in a coarse-to-fine fashion and extracts point clouds of each motion area to form moving object proposals. An improved 3D object detection network is then used to estimate the point clouds of each proposal and efficiently generates the 3D bounding boxes and the object categories. We evaluate the proposed approach on the widely-used KITTI benchmark, and state-of-the-art performance was obtained by using the proposed approach on the task of motion detection.

cs.CV↗

arXiv2020

Person Re-Identification via Active Hard Sample Mining

Annotating a large-scale image dataset is very tedious, yet necessary for training person re-identification models. To alleviate such a problem, we present an active hard sample mining framework via training an effective re-ID model with the least labeling efforts. Considering that hard samples can provide informative patterns, we first formulate an uncertainty estimation to actively select hard samples to iteratively train a re-ID model from scratch. Then, intra-diversity estimation is designed to reduce the redundant hard samples by maximizing their diversity. Moreover, we propose a computer-assisted identity recommendation module embedded in the active hard sample mining framework to help human annotators to rapidly and accurately label the selected samples. Extensive experiments were carried out to demonstrate the effectiveness of our method on several public datasets. Experimental results indicate that our method can reduce 57%, 63%, and 49% annotation efforts on the Market1501, MSMT17, and CUHK03, respectively, while maximizing the performance of the re-ID model.

cs.CV↗

arXiv2020

A Bootstrap Lasso + Partial Ridge Method to Construct Confidence Intervals for Parameters in High-dimensional Sparse Linear Models

Constructing confidence intervals for the coefficients of high-dimensional sparse linear models remains a challenge, mainly because of the complicated limiting distributions of the widely used estimators, such as the lasso. Several methods have been developed for constructing such intervals. Bootstrap lasso+ols is notable for its technical simplicity, good interpretability, and performance that is comparable with that of other more complicated methods. However, bootstrap lasso+ols depends on the beta-min assumption, a theoretic criterion that is often violated in practice. Thus, we introduce a new method, called bootstrap lasso+partial ridge, to relax this assumption. Lasso+partial ridge is a two-stage estimator. First, the lasso is used to select features. Then, the partial ridge is used to refit the coefficients. Simulation results show that bootstrap lasso+partial ridge outperforms bootstrap lasso+ols when there exist small, but nonzero coefficients, a common situation that violates the beta-min assumption. For such coefficients, the confidence intervals constructed using bootstrap lasso+partial ridge have, on average, $50\%$ larger coverage probabilities than those of bootstrap lasso+ols. Bootstrap lasso+partial ridge also has, on average, $35\%$ shorter confidence interval lengths than those of the de-sparsified lasso methods, regardless of whether the linear models are misspecified. Additionally, we provide theoretical guarantees for bootstrap lasso+partial ridge under appropriate conditions, and implement it in the R package "HDCI."

stat.ME↗

arXiv2020

Generalized Equal Area Criterion for Stability Analysis of Nonlinear Oscillators

In power system analysis, the Equal Area Criterion is of great importance on revealing the condition for a grid-connected synchronous generator to maintain its transient rotor angle stability with the grid under a large disturbance. At present, the increasing renewable distributed energy resources (DERs) are introducing a variety of new nonlinear characteristics that are different from those of conventional generation although these DERs can still be operated and modeled as grid-connected oscillators with synthetic inertias. To study stability and synchronism of a grid-connected DER operated as a more general nonlinear oscillator, this paper proposes a Generalized Equal Area Criterion for estimation of transient stability margin subject to a large disturbance.

math.DS↗

arXiv2020

Can speed up the convergence rate of stochastic gradient methods to $\mathcal{O}(1/k^2)$ by a gradient averaging strategy?

In this paper we consider the question of whether it is possible to apply a gradient averaging strategy to improve on the sublinear convergence rates without any increase in storage. Our analysis reveals that a positive answer requires an appropriate averaging strategy and iterations that satisfy the variance dominant condition. As an interesting fact, we show that if the iterative variance we defined is always dominant even a little bit in the stochastic gradient iterations, the proposed gradient averaging strategy can increase the convergence rate $\mathcal{O}(1/k)$ to $\mathcal{O}(1/k^2)$ in probability for the strongly convex objectives with Lipschitz gradients. This conclusion suggests how we should control the stochastic gradient iterations to improve the rate of convergence.

math.OC↗

arXiv2020

Towards Critical Clearing Time Sensitivity for DAE Systems with Singularity

Standard power system models are parameter dependent differential-algebraic equation (DAE) type. Following a transient event, voltage collapse can occur as a bifurcation of the transient load flow solutions which is marked by the system trajectory reaching a singular surface in state space where the voltage causality is lost. If a fault is expected to cause voltage collapse, preventive control decisions such as changes in AVR settings need to be taken in order to get enhance the system stability. In this regard, the knowledge of sensitivity of critical clearing time (CCT) to controllable system parameters can be of great help. The quasi-stability boundary of DAE systems is more complicated than ODE systems where in addition to unstable equilibrium points (UEP) and periodic orbits, singularity plays an important role making the problem challenging. The stability boundary is then made up of a number of dynamically distinct components. In the present work, we derive the expression for CCT sensitivity for the phenomenon where the critical fault-on trajectory intersects the singular surface itself which is one such component forming the stability boundary. The results are illustrated for a small test system in order to gain visual insights.

eess.SY↗

arXiv2020

Stochastic gradient-free descents

In this paper we propose stochastic gradient-free methods and accelerated methods with momentum for solving stochastic optimization problems. All these methods rely on stochastic directions rather than stochastic gradients. We analyze the convergence behavior of these methods under the mean-variance framework, and also provide a theoretical analysis about the inclusion of momentum in stochastic settings which reveals that the momentum term we used adds a deviation of order $\mathcal{O}(1/k)$ but controls the variance at the order $\mathcal{O}(1/k)$ for the $k$th iteration. So it is shown that, when employing a decaying stepsize $α_k=\mathcal{O}(1/k)$, the stochastic gradient-free methods can still maintain the sublinear convergence rate $\mathcal{O}(1/k)$ and the accelerated methods with momentum can achieve a convergence rate $\mathcal{O}(1/k^2)$ in probability for the strongly convex objectives with Lipschitz gradients; and all these methods converge to a solution with a zero expected gradient norm when the objective function is nonconvex, twice differentiable and bounded below.

math.OC↗

arXiv2019

Synchronous Maneuver Searching and Trajectory Planning for Autonomous Vehicles in Dynamic Traffic Environments

In the real-time decision-making and local planning process of autonomous vehicles in dynamic environments, the autonomous driving system may fail to find a reasonable policy or even gets trapped in some situation due to the complexity of global tasks and the incompatibility between upper-level maneuver decisions with the low-level lower level trajectory planning. To solve this problem, this paper presents a synchronous maneuver searching and trajectory planning (SMSTP) algorithm based on the topological concept of homotopy. Firstly, a set of alternative maneuvers with boundary limits are enumerated on a multi-lane road. Instead of sampling numerous paths in the whole spatio-temporal space, we, for the first time, propose using Trajectory Profiles (TPs) to quickly construct the topological maneuvers represented by different routes, and put forward a corridor generation algorithm based on graph-search. The bounded corridor further constrains the maneuver's space in the spatial space. A step-wise heuristic optimization algorithm is then proposed to synchronously generate a feasible trajectory for each maneuver. To achieve real-time performance, we initialize the states to be optimized with the boundary constraints of maneuvers, and we set some heuristic states as terminal targets in the quadratic cost function. The solution of a feasible trajectory is always guaranteed only if a specific maneuver is given. The simulation and realistic driving-test experiments verified that the proposed SMSTP algorithm has a short computation time which is less than 37ms, and the experimental results showed the validity and effectiveness of the SMSTP algorithm.

cs.RO↗

arXiv2019

BiRA-Net: Bilinear Attention Net for Diabetic Retinopathy Grading

Diabetic retinopathy (DR) is a common retinal disease that leads to blindness. For diagnosis purposes, DR image grading aims to provide automatic DR grade classification, which is not addressed in conventional research methods of binary DR image classification. Small objects in the eye images, like lesions and microaneurysms, are essential to DR grading in medical imaging, but they could easily be influenced by other objects. To address these challenges, we propose a new deep learning architecture, called BiRA-Net, which combines the attention model for feature extraction and bilinear model for fine-grained classification. Furthermore, in considering the distance between different grades of different DR categories, we propose a new loss function, called grading loss, which leads to improved training convergence of the proposed approach. Experimental results are provided to demonstrate the superior performance of the proposed approach.

cs.CV↗

arXiv2019

Numerical meshless solution of high-dimensional sine-Gordon equations via Fourier HDMR-HC approximation

In this paper, an implicit time stepping meshless scheme is proposed to find the numerical solution of high-dimensional sine-Gordon equations (SGEs) by combining the high dimensional model representation (HDMR) and the Fourier hyperbolic cross (HC) approximation. To ensure the sparseness of the relevant coefficient matrices of the implicit time stepping scheme, the whole domain is first divided into a set of subdomains, and the relevant derivatives in high-dimension can be separately approximated by the Fourier HDMR-HC approximation in each subdomain. The proposed method allows for stable large time-steps and a relatively small number of nodes with satisfactory accuracy. The numerical examples show that the proposed method is very attractive for simulating the high-dimensional SGEs.

math.NA↗

arXiv2019

Meshless Hermite-HDMR finite difference method for high-dimensional Dirichlet problems

In this paper, a meshless Hermite-HDMR finite difference method is proposed to solve high-dimensional Dirichlet problems. The approach is based on the local Hermite-HDMR expansion with an additional smoothing technique. First, we introduce the HDMR decomposition combined with the multiple Hermite series to construct a class of Hermite-HDMR approximations, and the relevant error estimate is theoretically built in a class of Hermite spaces. It can not only provide high order convergence but also retain good scaling with increasing dimensions. Then the Hermite-HDMR based finite difference method is particularly proposed for solving high-dimensional Dirichlet problems. By applying a smoothing process to the Hermite-HDMR approximations, numerical stability can be guaranteed even with a small number of nodes. Numerical experiments in dimensions up to $30$ show that resulting approximations are of very high quality.

math.NA↗

arXiv2019

Modeling the Echelle Spectra Continuum with Alpha Shapes and Local Regression Fitting

Continuum normalization of echelle spectra is an important data analysis step that is difficult to automate. Polynomial fitting requires a reasonably high order model to follow the steep slope of the blaze function. However, in the presence of deep spectral lines, a high order polynomial fit can result in ripples in the normalized continuum that increase errors in spectral analysis. Here, we present two algorithms for flattening the spectrum continuum. The Alpha-shape Fitting to Spectrum algorithm (AFS) is completely data-driven, using an alpha shape to obtain an initial estimate of the blaze function. The Alpha-shape and Lab Source Fitting to Spectrum algorithm (ALSFS) incorporates a continuum constraint from a lab source reference spectrum for the blaze function estimation. These algorithms are tested on a simulated spectrum, where we demonstrate improved normalization compared to polynomial regression for continuum fitting. We show an additional application, using the algorithms for mitigation of spatially correlated quantum efficiency variations and fringing in the CCD detector of the EXtreme PREcision Spectrometer (EXPRES).

astro-ph.IM↗

arXiv2019

An Improved Error Term for Tur$\acute{\rm a}$n Number of Expanded Non-degenerate 2-graphs

For a 2-graph $F$, let $H_F^{(r)}$ be the $r$-graph obtained from $F$ by enlarging each edge with a new set of $r-2$ vertices. We show that if $χ(F)=\ell>r \geq 2$, then $ {\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)+ Θ( {\rm biex}(n,F)n^{r-2}),$ where $t_r (n,\ell-1)$ is the number of edges of an $n$-vertex complete balanced $\ell-1$ partite $r$-graph and ${\rm biex}(n,F)$ is the extremal number of the decomposition family of $F$. Since ${\rm biex}(n,F)=O(n^{2-γ})$ for some $γ>0$, this improves on the bound ${\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)+ o(n^r)$ by Mubayi (2016). Furthermore, our result implies that ${\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)$ when $F$ is edge-critical, which is an extension of the result of Pikhurko (2013).

math.CO↗

arXiv2019

Finding cosmic voids and filament loops using topological data analysis

(abridged) We present the Significant Cosmic Holes in Universe (SCHU) method for identifying cosmic voids and loops of filaments in cosmological datasets and assigning their statistical significance using techniques from topological data analysis. Persistent homology is used to find different dimensional holes. For dark matter halo catalogs and galaxy surveys, the 0-, 1-, and 2-dimensional holes can be identified with clusters, loops of filaments, and voids. The procedure overlays halos/galaxies on a 3D grid, and a distance-to-measure (DTM) function is calculated at each point of the grid. A filtration is generated over the lower-level sets of the DTM across increasing threshold values. The filtered simplicial complex can be used to summarize the birth/death times of the different dimension homology group generators (i.e., the holes). Persistence diagrams are produced from the dimension and birth/death times of each homology group generator. Using the persistence diagrams and bootstrap sampling, we explain how $p$-values can be assigned to each homology group generator. The homology group generators on a persistence diagram are not, in general, uniquely located back in the original dataset volume so we propose a method for finding a representation of the homology group generators. This method provides a novel, statistically rigorous approach for locating informative generators in cosmological datasets, which may be useful for providing complementary cosmological constraints on the effects of, for example, the sum of the neutrino masses. The method is tested on a Voronoi foam simulation, and then applied to a subset of the SDSS galaxy survey and a cosmological simulation. Lastly, we calculate Betti functions for two of the MassiveNuS simulations and discuss implications for using the persistent homology of the density field to help break degeneracy in the cosmological parameters.

astro-ph.CO↗

arXiv2019

Sparse residual tree and forest

Sparse residual tree (SRT) is an adaptive exploration method for multivariate scattered data approximation. It leads to sparse and stable approximations in areas where the data is sufficient or redundant, and points out the possible local regions where data refinement is needed. Sparse residual forest (SRF) is a combination of SRT predictors to further improve the approximation accuracy and stability according to the error characteristics of SRTs. The hierarchical parallel SRT algorithm is based on both tree decomposition and adaptive radial basis function (RBF) explorations, whereby for each child a sparse and proper RBF refinement is added to the approximation by minimizing the norm of the residual inherited from its parent. The convergence results are established for both SRTs and SRFs. The worst case time complexity of SRTs is $\mathcal{O}(N\log_2N)$ for the initial work and $\mathcal{O}(\log_2N)$ for each prediction, meanwhile, the worst case storage requirement is $\mathcal{O}(N\log_2N)$, where the $N$ data points can be arbitrary distributed. Numerical experiments are performed for several illustrative examples.

math.NA↗

arXiv2018

Directional freezing of binary colloidal suspensions: A model for size fractionation of graphene oxide

The performance of graphene oxide(GO)-based materials strongly depends on the lateral size and size distribution of GO nanosheets. Various methods are employed to prepare GO nanosheets with a narrow size distribution. One of the promising method was proposed recently by directionally freezing of a GO aqueous dispersion at a controlled growth rate of the freezing front. We develop a theoretic model of binary colloids suspension, incorporating both the moving freezing boundary and the preferential adsorption of colloidal particles to the ice phase. We numerically solve the coupled diffusion equations and present state diagrams of size fractionation. Selective trapping of colloids according to their size can be achieved by a suitable choice of the experimental parameters, such as the adsorption rates and the freezing speed.

cond-mat.soft↗

arXiv2018

Nonlinear Modal Decoupling Based Power System Transient Stability Analysis

Nonlinear modal decoupling (NMD) was recently proposed to nonlinearly transform a multi-oscillator system into a number of decoupled oscillators which together behave the same as the original system in an extended neighborhood of the equilibrium. Each oscillator has just one degree of freedom and hence can easily be analyzed to infer the stability of the original system associated with one electromechanical mode. As the first attempt of applying the NMD methodology to realistic power system models, this paper proposes an NMD-based transient stability analysis approach. For a multi-machine power system, the approach first derives decoupled nonlinear oscillators by a coordinates transformation, and then applies Lyapunov stability analysis to oscillators to assess the stability of the original system. Nonlinear modal interaction is also considered. The approach can be efficiently applied to a large-scale power grid by conducting NMD regarding only selected modes. Case studies on a 3-machine 9-bus system and an NPCC 48-machine 140-bus system show the potentials of the approach in transient stability analysis for multi-machine systems.

eess.SY↗

arXiv2018

Power System Transient Stability Analysis Using Truncated Taylor Expansion Systems

Small signal analysis is a special case of analytical approaches using Taylor expansions of power system differential equations with the truncation performed at order one. The truncated Taylor expansions (TTEs) at higher orders can lead to better approaches for stability analysis by considering higher order nonlinearities, e.g. normal form, modal series and nonlinear modal decoupling. This paper presents fundamental studies on how accurate transient stability analysis results can be obtained from the TTE systems compared to that on the original system. The analytical investigation is conducted on single-machine-infinite-bus power systems. Conclusions are drawn from there and verified on two multi-machine power systems by extensive numerical simulations.

eess.SY↗