Searcharxiv⌕ Search

arXiv subjects

Teng Zhang

Publications and source records attributed to Teng Zhang.

At least 199 records · Page 11Linked to original sources

Parallax Bundle Adjustment on Manifold with Convexified Initialization

Bundle adjustment (BA) with parallax angle based feature parameterization has been shown to have superior performance over BA using inverse depth or XYZ feature forms. In this paper, we propose an improved version of the parallax BA algorithm (PMBA) by extending it to the manifold domain along with observation-ray based objective function. With this modification, the problem formulation faithfully mimics the projective nature in a camera's image formation, BA is able to achieve better convergence, accuracy and robustness. This is particularly useful in handling diverse outdoor environments and collinear motion modes. Capitalizing on these properties, we further propose a pose-graph simplification to PMBA, with significant dimensionality reduction. This pose-graph model is convex in nature, easy to solve and its solution can serve as a good initial guess to the original BA problem which is intrinsically non-convex. We provide theoretical proof that our global initialization strategy can guarantee a near-optimal solution. Using a series of experiments involving diverse environmental conditions and motions, we demonstrate PMBA's superior convergence performance in comparison to other BA methods. We also show that, without incremental initialization or via third-party information, our global initialization process helps to bootstrap the full BA successfully in various scenarios, sequential or out-of-order, including some datasets from the "Bundle Adjustment in the Large" database.

cs.RO↗

CoVeR: Learning Covariate-Specific Vector Representations with Tensor Decompositions

Word embedding is a useful approach to capture co-occurrence structures in large text corpora. However, in addition to the text data itself, we often have additional covariates associated with individual corpus documents---e.g. the demographic of the author, time and venue of publication---and we would like the embedding to naturally capture this information. We propose CoVeR, a new tensor decomposition model for vector embeddings with covariates. CoVeR jointly learns a \emph{base} embedding for all the words as well as a weighted diagonal matrix to model how each covariate affects the base embedding. To obtain author or venue-specific embedding, for example, we can then simply multiply the base embedding by the associated transformation matrix. The main advantages of our approach are data efficiency and interpretability of the covariate transformation. Our experiments demonstrate that our joint model learns substantially better covariate-specific embeddings compared to the standard approach of learning a separate embedding for each covariate using only the relevant subset of data, as well as other related methods. Furthermore, CoVeR encourages the embeddings to be "topic-aligned" in that the dimensions have specific independent meanings. This allows our covariate-specific embeddings to be compared by topic, enabling downstream differential analysis. We empirically evaluate the benefits of our algorithm on datasets, and demonstrate how it can be used to address many natural questions about covariate effects. Accompanying code to this paper can be found at http://github.com/kjtian/CoVeR.

cs.CL↗

eQTL Mapping via Effective SNP Ranking and Screening

Genome-wide eQTL mapping explores the relationship between gene expression values and DNA variants to understand genetic causes of human disease. Due to the large number of genes and DNA variants that need to be assessed simultaneously, current methods for eQTL mapping often suffer from low detection power, especially for identifying trans-eQTLs. In this paper, we propose a new method that utilizes advanced techniques in large-scale signal detection to pursue the structure of eQTL data and improve the power for eQTL mapping. The new method greatly reduces the burden of joint modeling by developing a new ranking and screening strategy based on the higher criticism statistic. Numerical results in simulation studies demonstrate the superior performance of our method in detecting true eQTLs with reduced computational expense. The proposed method is also evaluated in HapMap eQTL data analysis and the results are compared to a database of known eQTLs.

stat.AP↗

SlideNet: Fast and Accurate Slide Quality Assessment Based on Deep Neural Networks

This work tackles the automatic fine-grained slide quality assessment problem for digitized direct smears test using the Gram staining protocol. Automatic quality assessment can provide useful information for the pathologists and the whole digital pathology workflow. For instance, if the system found a slide to have a low staining quality, it could send a request to the automatic slide preparation system to remake the slide. If the system detects severe damage in the slides, it could notify the experts that manual microscope reading may be required. In order to address the quality assessment problem, we propose a deep neural network based framework to automatically assess the slide quality in a semantic way. Specifically, the first step of our framework is to perform dense fine-grained region classification on the whole slide and calculate the region distribution histogram. Next, our framework will generate assessments of the slide quality from various perspectives: staining quality, information density, damage level and which regions are more valuable for subsequent high-magnification analysis. To make the information more accessible, we present our results in the form of a heat map and text summaries. Additionally, in order to stimulate research in this direction, we propose a novel dataset for slide quality assessment. Experiments show that the proposed framework outperforms recent related works.

cs.CV↗

Topological design of graphene

Topological defects (e.g. pentagons, heptagons and pentagon-heptagon pairs) have been widely observed in large scale graphene and have been recognized to play important roles in tailoring the mechanical and physical properties of two-dimensional materials in general. Thanks to intensive studies over the past few years, optimizing properties of graphene through topological design has become a new and promising direction of research. In this chapter, we review some of the recent advances in experimental, computational and theoretical studies on the effects of topological defects on mechanical and physical properties of graphene and applications of topologically designed graphene. The discussions cover out-of-plane effects, inverse problems of designing distributions of topological defects that make a graphene sheet conform to a targeted three-dimensional surface, grain boundary engineering for graphene strength, curved graphene for toughness enhancement and applications in engineering energy materials, multifunctional materials and interactions with biological systems. Despite the rapid developments in experiments and simulations, our understanding on the relations between topological defects and mechanical and physical properties of graphene and other 2D materials is still in its infancy. The intention here is to draw the attention of the research community to some of the open questions in this field.

cond-mat.mes-hall↗

Improving sensitivity to magnetic fields and electric dipole moments by using measurements of individual magnetic sublevels

We explore ways to use the ability to measure the populations of individual magnetic sublevels to improve the sensitivity of magnetic field measurements and measurements of atomic electric dipole moments (EDMs). When atoms are initialized in the $m=0$ magnetic sublevel, the shot-noise-limited uncertainty of these measurements is $1/\sqrt{2F(F+1)}$ smaller than that of a Larmor precession measurement. When the populations in the even (or odd) magnetic sublevels are combined, we show that these measurements are independent of the tensor Stark shift and the second order Zeeman shift. We discuss the complicating effect of a transverse magnetic field and show that when the ratio of the tensor Stark shift to the transverse magnetic field is sufficiently large, an EDM measurement with atoms initialized in the superposition of the stretched states can reach the optimal sensitivity.

quant-ph↗

Stochastic Primal-Dual Proximal ExtraGradient Descent for Compositely Regularized Optimization

We consider a wide range of regularized stochastic minimization problems with two regularization terms, one of which is composed with a linear function. This optimization model abstracts a number of important applications in artificial intelligence and machine learning, such as fused Lasso, fused logistic regression, and a class of graph-guided regularized minimization. The computational challenges of this model are in two folds. On one hand, the closed-form solution of the proximal mapping associated with the composed regularization term or the expected objective function is not available. On the other hand, the calculation of the full gradient of the expectation in the objective is very expensive when the number of input data samples is considerably large. To address these issues, we propose a stochastic variant of extra-gradient type methods, namely \textsf{Stochastic Primal-Dual Proximal ExtraGradient descent (SPDPEG)}, and analyze its convergence property for both convex and strongly convex objectives. For general convex objectives, the uniformly average iterates generated by \textsf{SPDPEG} converge in expectation with $O(1/\sqrt{t})$ rate. While for strongly convex objectives, the uniformly and non-uniformly average iterates generated by \textsf{SPDPEG} converge with $O(\log(t)/t)$ and $O(1/t)$ rates, respectively. The order of the rate of the proposed algorithm is known to match the best convergence rate for first-order stochastic algorithms. Experiments on fused logistic regression and graph-guided regularized logistic regression problems show that the proposed algorithm performs very efficiently and consistently outperforms other competing algorithms.

cs.LG↗

TV-GAN: Generative Adversarial Network Based Thermal to Visible Face Recognition

This work tackles the face recognition task on images captured using thermal camera sensors which can operate in the non-light environment. While it can greatly increase the scope and benefits of the current security surveillance systems, performing such a task using thermal images is a challenging problem compared to face recognition task in the Visible Light Domain (VLD). This is partly due to the much smaller amount number of thermal imagery data collected compared to the VLD data. Unfortunately, direct application of the existing very strong face recognition models trained using VLD data into the thermal imagery data will not produce a satisfactory performance. This is due to the existence of the domain gap between the thermal and VLD images. To this end, we propose a Thermal-to-Visible Generative Adversarial Network (TV-GAN) that is able to transform thermal face images into their corresponding VLD images whilst maintaining identity information which is sufficient enough for the existing VLD face recognition models to perform recognition. Some examples are presented in Figure 1. Unlike the previous methods, our proposed TV-GAN uses an explicit closed-set face recognition loss to regularize the discriminator network training. This information will then be conveyed into the generator network in the forms of gradient loss. In the experiment, we show that by using this additional explicit regularization for the discriminator network, the TV-GAN is able to preserve more identity information when translating a thermal image of a person which is not seen before by the TV-GAN.

cs.CV↗

Interfacial Thermal Transport in Boron Nitride-Polymer Nanocomposite

Polymer composites with thermally conductive nanoscale filler particles, such as graphene and hexagonal boron nitride (h-BN), are promising for certain heat transfer applications. While graphene-polymer composites have been extensively investigated, studies on h-BN-polymer composites has been relatively rare. In this paper, we use molecular dynamics (MD) simulations to study the interfacial thermal conductance (ITC) involved in the h-BN-polymer composites. We first compare the ITC across h-BN/hexane (C6H14) interfaces to that of graphene/hexane interfaces, where we found that the electrostatic interaction due to the partial charge on h-BN atoms can play an important role in such interfacial thermal transport. Based this finding, we further explore the thermal transport across different h-BN interfaces, including h-BN/hexanamine (C6H13NH2), h-BN/hexanol (C6H13OH), h-BN/hexanoic acid (C5H11COOH), where the increasingly polar molecules lead to systematic changes in the electrostatic interactions between h-BN and polymers. Heat flux decomposition and atom number density calculations are performed to understand the role of electrostatic interaction in thermal transport across h-BN-polymer interfaces. It was observed that stronger electrostatic interactions across the interfaces can help attract the polymer molecules closer to h-BN, and the reduced interface distance leads to larger heat flux contributed from both van der Waals and electrostatic forces. These results may provide useful information to guide the design of thermally conductive h-BN-polymer nanocomposites.

physics.app-ph↗

Demonstration of a switchable damping system to allow low-noise operation of high-Q low-mass suspension systems

Low mass suspension systems with high-Q pendulum stages are used to enable quantum radiation pressure noise limited experiments. Utilising multiple pendulum stages with vertical blade springs and materials with high quality factors provides attenuation of seismic and thermal noise, however damping of these high-Q pendulum systems in multiple degrees of freedom is essential for practical implementation. Viscous damping such as eddy-current damping can be employed but introduces displacement noise from force noise due to thermal fluctuations in the damping system. In this paper we demonstrate a passive damping system with adjustable damping strength as a solution for this problem that can be used for low mass suspension systems without adding additional displacement noise in science mode. We show a reduction of the damping factor by a factor of 8 on a test suspension and provide a general optimisation for this system.

physics.ins-det↗

Robust PCA by Manifold Optimization

Robust PCA is a widely used statistical procedure to recover a underlying low-rank matrix with grossly corrupted observations. This work considers the problem of robust PCA as a nonconvex optimization problem on the manifold of low-rank matrices, and proposes two algorithms (for two versions of retractions) based on manifold optimization. It is shown that, with a proper designed initialization, the proposed algorithms are guaranteed to converge to the underlying low-rank matrix linearly. Compared with a previous work based on the Burer-Monterio decomposition of low-rank matrices, the proposed algorithms reduce the dependence on the conditional number of the underlying low-rank matrix theoretically. Simulations and real data examples confirm the competitive performance of our method.

stat.ML↗

The discrete moment problem with nonconvex shape constraints

The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of moments. This paper studies the discrete moment problems with additional "shape constraints" that guarantee the worst case distribution is either log-concave or has an increasing failure rate. These classes of shape constraints have not previously been studied in the literature, in part due to their inherent nonconvexities. Nonetheless, these classes of distributions are useful in practice. We characterize the structure of optimal extreme point distributions by developing new results in reverse convex optimization, a lesser-known tool previously employed in designing global optimization algorithms. We are able to show, for example, that an optimal extreme point solution to a moment problem with $m$ moments and log-concave shape constraints is piecewise geometric with at most $m$ pieces. Moreover, this structure allows us to design an exact algorithm for computing optimal solutions in a low-dimensional space of parameters. Moreover, We describe a computational approach to solving these low-dimensional problems, including numerical results for a representative set of instances.

math.OC↗

The Monkeytyping Solution to the YouTube-8M Video Understanding Challenge

This article describes the final solution of team monkeytyping, who finished in second place in the YouTube-8M video understanding challenge. The dataset used in this challenge is a large-scale benchmark for multi-label video classification. We extend the work in [1] and propose several improvements for frame sequence modeling. We propose a network structure called Chaining that can better capture the interactions between labels. Also, we report our approaches in dealing with multi-scale information and attention pooling. In addition, We find that using the output of model ensemble as a side target in training can boost single model performance. We report our experiments in bagging, boosting, cascade, and stacking, and propose a stacking algorithm called attention weighted stacking. Our final submission is an ensemble that consists of 74 sub models, all of which are listed in the appendix.

cs.CV↗

Spectral clustering in the dynamic stochastic block model

In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most $s$ nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type procedure and extract the group memberships of the nodes by spectral clustering. The procedure is computationally viable, adaptive to the unknown smoothness of the functional connection probabilities, to the rate $s$ of membership switching and to the unknown number of clusters. In addition, it is accompanied by non-asymptotic guarantees for the precision of estimation and clustering.

stat.ME↗

Anisotropic twicing for single particle reconstruction using autocorrelation analysis

The missing phase problem in X-ray crystallography is commonly solved using the technique of molecular replacement, which borrows phases from a previously solved homologous structure, and appends them to the measured Fourier magnitudes of the diffraction patterns of the unknown structure. More recently, molecular replacement has been proposed for solving the missing orthogonal matrices problem arising in Kam's autocorrelation analysis for single particle reconstruction using X-ray free electron lasers and cryo-EM. In classical molecular replacement, it is common to estimate the magnitudes of the unknown structure as twice the measured magnitudes minus the magnitudes of the homologous structure, a procedure known as `twicing'. Mathematically, this is equivalent to finding an unbiased estimator for a complex-valued scalar. We generalize this scheme for the case of estimating real or complex valued matrices arising in single particle autocorrelation analysis. We name this approach "Anisotropic Twicing" because unlike the scalar case, the unbiased estimator is not obtained by a simple magnitude isotropic correction. We compare the performance of the least squares, twicing and anisotropic twicing estimators on synthetic and experimental datasets. We demonstrate 3D homology modeling in cryo-EM directly from experimental data without iterative refinement or class averaging, for the first time.

cs.CV↗

Disentangling Orthogonal Matrices

Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theoretically and empirically, the proposed algorithm performs better than the naïve approach of solving the linear system directly without the orthogonal constraints. We also consider the generalization to linear systems with more than two unknown orthogonal matrices.

math.OC↗

An Invariant-EKF VINS Algorithm for Improving Consistency

The main contribution of this paper is an invariant extended Kalman filter (EKF) for visual inertial navigation systems (VINS). It is demonstrated that the conventional EKF based VINS is not invariant under the stochastic unobservable transformation, associated with translations and a rotation about the gravitational direction. This can lead to inconsistent state estimates as the estimator does not obey a fundamental property of the physical system. To address this issue, we use a novel uncertainty representation to derive a Right Invariant error extended Kalman filter (RIEKF-VINS) that preserves this invariance property. RIEKF-VINS is then adapted to the multistate constraint Kalman filter framework to obtain a consistent state estimator. Both Monte Carlo simulations and real-world experiments are used to validate the proposed method.

cs.RO↗

Convergence and Consistency Analysis for A 3D Invariant-EKF SLAM

In this paper, we investigate the convergence and consistency properties of an Invariant-Extended Kalman Filter (RI-EKF) based Simultaneous Localization and Mapping (SLAM) algorithm. Basic convergence properties of this algorithm are proven. These proofs do not require the restrictive assumption that the Jacobians of the motion and observation models need to be evaluated at the ground truth. It is also shown that the output of RI-EKF is invariant under any stochastic rigid body transformation in contrast to $\mathbb{SO}(3)$ based EKF SLAM algorithm ($\mathbb{SO}(3)$-EKF) that is only invariant under deterministic rigid body transformation. Implications of these invariance properties on the consistency of the estimator are also discussed. Monte Carlo simulation results demonstrate that RI-EKF outperforms $\mathbb{SO}(3)$-EKF, Robocentric-EKF and the "First Estimates Jacobian" EKF, for 3D point feature based SLAM.

cs.RO↗