arXiv subjects

Yang Zhou

Publications and source records attributed to Yang Zhou.

At least 469 records · Page 26Linked to original sources

arXiv2020

RigNet: Neural Rigging for Articulated Characters

We present RigNet, an end-to-end automated method for producing animation rigs from input character models. Given an input 3D model representing an articulated character, RigNet predicts a skeleton that matches the animator expectations in joint placement and topology. It also estimates surface skin weights based on the predicted skeleton. Our method is based on a deep architecture that directly operates on the mesh representation without making assumptions on shape class and structure. The architecture is trained on a large and diverse collection of rigged models, including their mesh, skeletons and corresponding skin weights. Our evaluation is three-fold: we show better results than prior art when quantitatively compared to animator rigs; qualitatively we show that our rigs can be expressively posed and animated at multiple levels of detail; and finally, we evaluate the impact of various algorithm choices on our output rigs.

cs.GR↗

arXiv2020

Traffic Performance Score for Measuring the Impact of COVID-19 on Urban Mobility

Measuring traffic performance is critical for public agencies who manage traffic and individuals who plan trips, especially when special events happen. The COVID-19 pandemic has significantly influenced almost every aspect of daily life, including urban traffic patterns. Thus, it is important to measure the impact of COVID-19 on transportation to further guide agencies and residents to properly respond to changes in traffic patterns. However, most existing traffic performance metrics incorporate only a single traffic parameter and measure only the performance of individual corridors. To overcome these challenges, in this study, a Traffic Performance Score (TPS) is proposed that incorporates multiple parameters for measuring network-wide traffic performance. An interactive web-based TPS platform that provides real-time and historical spatial-temporal traffic performance analysis is developed by the STAR Lab at the University of Washington. Based on data from this platform, this study analyzes the impact of COVID-19 on different road segments and the traffic network as a whole. Considering this pandemic has greatly reshaped social and economic operations, this study also evaluates how COVID-19 is changing the urban mobility from both travel demand and driving behavior perspectives.

physics.soc-ph↗

arXiv2020

Reflected Entropy for an Evaporating Black Hole

We study reflected entropy as a correlation measure in black hole evaporation. As a measure for bipartite mixed states, reflected entropy can be computed between black hole and radiation, radiation and radiation. We compute reflected entropy curves in three different models: 3-side wormhole model, End-of-the-World (EOW) brane model in three dimensions and two-dimensional eternal black hole plus CFT model. For 3-side wormhole model, we find that reflected entropy is dual to island cross sections. The reflected entropy between radiation and black hole increases at early time and then decreases to zero, similar to Page curve, but with a later transition time. The reflected entropy between radiation and radiation first increases and then saturates. For the EOW brane model, similar behaviors of reflected entropy are found. We propose a quantum extremal surface for reflected entropy, which we call quantum extremal cross section. In the eternal black hole plus CFT model, we find a generalized formula for reflected entropy with island cross section as its area term by considering the right half as the canonical purification of the left. Interestingly, the reflected entropy curve between the left black hole and the left radiation is nothing but the Page curve. We also find that reflected entropy between the left black hole and the right black hole decreases and goes to zero at late time. The reflected entropy between radiation and radiation increases at early time and saturates at late time.

hep-th↗

arXiv2020

A Probabilistic Model with Commonsense Constraints for Pattern-based Temporal Fact Extraction

Textual patterns (e.g., Country's president Person) are specified and/or generated for extracting factual information from unstructured data. Pattern-based information extraction methods have been recognized for their efficiency and transferability. However, not every pattern is reliable: A major challenge is to derive the most complete and accurate facts from diverse and sometimes conflicting extractions. In this work, we propose a probabilistic graphical model which formulates fact extraction in a generative process. It automatically infers true facts and pattern reliability without any supervision. It has two novel designs specially for temporal facts: (1) it models pattern reliability on two types of time signals, including temporal tag in text and text generation time; (2) it models commonsense constraints as observable variables. Experimental results demonstrate that our model significantly outperforms existing methods on extracting true temporal facts from news data.

cs.CL↗

arXiv2020

Quasimap wall-crossing for GIT quotients

In this paper, we prove a wall-crossing formula for $ε$-stable quasimaps to GIT quotients conjectured by Ciocan-Fontanine and Kim, for all targets in all genera, including the orbifold case. We prove that stability conditions in adjacent chambers give equivalent invariants, provided that both chambers are stable. In the case of genus-zero quasimaps with one marked point, we compute the invariants in the left-most stable chamber in terms of the small $I$-function. Using this we prove that the quasimap $J$-functions are on the Lagrangian cone of the Gromov--Witten theory. The proofs are based on virtual localization on a master space, obtained via some universal construction on the moduli of weighted curves. The fixed-point loci are in one-to-one correspondence with the terms in the wall-crossing formula.

math.AG↗

arXiv2020

Multi-boundary entanglement in Chern-Simons theory with finite gauge groups

We study the multi-boundary entanglement structure of the states prepared in (1+1) and (2+1) dimensional Chern-Simons theory with finite discrete gauge group $G$. The states in (1+1)-$d$ are associated with Riemann surfaces of genus $g$ with multiple $S^1$ boundaries and we use replica trick to compute the entanglement entropy for such states. In (2+1)-$d$, we focus on the states associated with torus link complements which live in the tensor product of Hilbert spaces associated with multiple $T^2$. We present a quantitative analysis of the entanglement structure for both abelian and non-abelian groups. For all the states considered in this work, we find that the entanglement entropy for direct product of groups is the sum of entropy for individual groups, i.e. $\text{EE}(G_1 \times G_2) = \text{EE}(G_1)+\text{EE}(G_2)$. Moreover, the reduced density matrix obtained by tracing out a subset of the total Hilbert space has a positive semidefinite partial transpose on any bi-partition of the remaining Hilbert space.

hep-th↗

arXiv2020

The Cooperative Sorting Strategy for Connected and Automated Vehicle Platoons

This paper presents a "cooperative vehicle sorting" strategy that seeks to optimally sort connected and automated vehicles (CAVs) in a multi-lane platoon to reach an ideally organized platoon. In the proposed method, a CAV platoon is firstly discretized into a grid system, where a CAV moves from one cell to another in the discrete time-space domain. Then, the cooperative sorting problem is modeled as a path-finding problem in the graphic domain. The problem is solved by the deterministic Astar algorithm with a stepwise strategy, where only one vehicle can move within a movement step. The resultant shortest path is further optimized with an integer linear programming algorithm to minimize the sorting time by allowing multiple movements within a step. To improve the algorithm running time and address multiple shortest paths, a distributed stochastic Astar algorithm (DSA) is developed by introducing random disturbances to the edge costs to break uniform paths (with equal path cost). Numerical experiments are conducted to demonstrate the effectiveness of the proposed DSA method. The results report shorter sorting time and significantly improved algorithm running time due to the use of DSA. In addition, we find that the optimization performance can be further improved by increasing the number of processes in the distributed computing system.

eess.SY↗

arXiv2020

A Video Analysis Method on Wanfang Dataset via Deep Neural Network

The topic of object detection has been largely improved recently, especially with the development of convolutional neural network. However, there still exist a lot of challenging cases, such as small object, compact and dense or highly overlapping object. Existing methods can detect multiple objects wonderfully, but because of the slight changes between frames, the detection effect of the model will become unstable, the detection results may result in dropping or increasing the object. In the pedestrian flow detection task, such phenomenon can not accurately calculate the flow. To solve this problem, in this paper, we describe the new function for real-time multi-object detection in sports competition and pedestrians flow detection in public based on deep learning. Our work is to extract a video clip and solve this frame of clips efficiently. More specfically, our algorithm includes two stages: judge method and optimization method. The judge can set a maximum threshold for better results under the model, the threshold value corresponds to the upper limit of the algorithm with better detection results. The optimization method to solve detection jitter problem. Because of the occurrence of frame hopping in the video, and it will result in the generation of video fragments discontinuity. We use optimization algorithm to get the key value, and then the detection result value of index is replaced by key value to stabilize the change of detection result sequence. Based on the proposed algorithm, we adopt wanfang sports competition dataset as the main test dataset and our own test dataset for YOLOv3-Abnormal Number Version(YOLOv3-ANV), which is 5.4% average improvement compared with existing methods. Also, video above the threshold value can be obtained for further analysis. Spontaneously, our work also can used for pedestrians flow detection and pedestrian alarm tasks.

cs.CV↗

arXiv2020

High-sensitivity bio-sensor based on the real-splitting indirectly coupled Anti-Parity time symmetric WGMs

Detecting the size of single nanoparticle with high precision is crucial to understanding the characteristic of the nanoparticle. In this paper, we research the single particle detection based on the Anti-parity time symmetric (APT) indirectly coupled WGMs. The results show that the Anti-parity time symmetric WGM nanoparticle sensor exhibits giant enhancement in frequency splitting compared with single WGM sensor, when the system operating at exceptional point (EP). With respect to the parity-time symmetric nanoparticle sensor, our research exhibits a real eigenfrequency splitting, which can be directly detected.

physics.optics↗

arXiv2020

End-To-End Trainable Video Super-Resolution Based on a New Mechanism for Implicit Motion Estimation and Compensation

Video super-resolution aims at generating a high-resolution video from its low-resolution counterpart. With the rapid rise of deep learning, many recently proposed video super-resolution methods use convolutional neural networks in conjunction with explicit motion compensation to capitalize on statistical dependencies within and across low-resolution frames. Two common issues of such methods are noteworthy. Firstly, the quality of the final reconstructed HR video is often very sensitive to the accuracy of motion estimation. Secondly, the warp grid needed for motion compensation, which is specified by the two flow maps delineating pixel displacements in horizontal and vertical directions, tends to introduce additional errors and jeopardize the temporal consistency across video frames. To address these issues, we propose a novel dynamic local filter network to perform implicit motion estimation and compensation by employing, via locally connected layers, sample-specific and position-specific dynamic local filters that are tailored to the target pixels. We also propose a global refinement network based on ResBlock and autoencoder structures to exploit non-local correlations and enhance the spatial consistency of super-resolved frames. The experimental results demonstrate that the proposed method outperforms the state-of-the-art, and validate its strength in terms of local transformation handling, temporal consistency as well as edge sharpness.

cs.CV↗

arXiv2019

EFANet: Exchangeable Feature Alignment Network for Arbitrary Style Transfer

Style transfer has been an important topic both in computer vision and graphics. Since the seminal work of Gatys et al. first demonstrates the power of stylization through optimization in the deep feature space, quite a few approaches have achieved real-time arbitrary style transfer with straightforward statistic matching techniques. In this work, our key observation is that only considering features in the input style image for the global deep feature statistic matching or local patch swap may not always ensure a satisfactory style transfer; see e.g., Figure 1. Instead, we propose a novel transfer framework, EFANet, that aims to jointly analyze and better align exchangeable features extracted from content and style image pair. In this way, the style features from the style image seek for the best compatibility with the content information in the content image, leading to more structured stylization results. In addition, a new whitening loss is developed for purifying the computed content features and better fusion with styles in feature space. Qualitative and quantitative experiments demonstrate the advantages of our approach.

cs.CV↗

arXiv2019

Two-dimensional Anomaly, Orbifolding, and Boundary States

We study anomalies of discrete internal global symmetry $G$ in two-dimensional rational conformal field theories based on twisted torus partition functions. The anomaly of $G$ can be seen from the noncommutativity of two symmetry lines inserted along the nontrivial cycles of two-torus and we propose a criterion to detect the anomaly, which agrees with the truncated modular $S$-matrix approach. The obstruction for orbifolding has been recently interpreted as a mixed anomaly between $G$ and large diffeomorphisms. We clarify the relations among anomaly-free conditions, orbifoldable conditions, and invariant boundary state condition, focusing on Wess-Zumino-Witten models.

hep-th↗

arXiv2019

ETNet: Error Transition Network for Arbitrary Style Transfer

Numerous valuable efforts have been devoted to achieving arbitrary style transfer since the seminal work of Gatys et al. However, existing state-of-the-art approaches often generate insufficiently stylized results under challenging cases. We believe a fundamental reason is that these approaches try to generate the stylized result in a single shot and hence fail to fully satisfy the constraints on semantic structures in the content images and style patterns in the style images. Inspired by the works on error-correction, instead, we propose a self-correcting model to predict what is wrong with the current stylization and refine it accordingly in an iterative manner. For each refinement, we transit the error features across both the spatial and scale domain and invert the processed features into a residual image, with a network we call Error Transition Network (ETNet). The proposed model improves over the state-of-the-art methods with better semantic structures and more adaptive style pattern details. Various qualitative and quantitative experiments show that the key concept of both progressive strategy and error-correction leads to better results. Code and models are available at https://github.com/zhijieW94/ETNet.

cs.CV↗

arXiv2019

Platoon trajectories generation: A unidirectional interconnected LSTM-based car following model

Car following models have been widely applied and made remarkable achievements in traffic engineering. However, the traffic micro-simulation accuracy of car following models in a platoon level, especially during traffic oscillations, still needs to be enhanced. Rather than using traditional individual car following models, we proposed a new trajectory generation approach to generate platoon level trajectories given the first leading vehicle's trajectory. In this paper, we discussed the temporal and spatial error propagation issue for the traditional approach by a car following block diagram representation. Based on the analysis, we pointed out that error comes from the training method and the model structure. In order to fix that, we adopt two improvements on the basis of the traditional LSTM based car following model. We utilized a scheduled sampling technique during the training process to solve the error propagation in the temporal dimension. Furthermore, we developed a unidirectional interconnected LSTM model structure to extract trajectories features from the perspective of the platoon. As indicated by the systematic empirical experiments, the proposed novel structure could efficiently reduce the temporal and spatial error propagation. Compared with the traditional LSTM based car following model, the proposed model has almost 40% less error. The findings will benefit the design and analysis of micro-simulation for platoon level car following models.

cs.LG↗

arXiv2019

Optimal Dynamic Futures Portfolio in a Regime-Switching Market Framework

We study the problem of dynamically trading futures in a regime-switching market. Modeling the underlying asset price as a Markov-modulated diffusion process, we present a utility maximization approach to determine the optimal futures trading strategy. This leads to the analysis of the associated system of Hamilton-Jacobi-Bellman (HJB) equations, which are reduced to a system of linear ODEs. We apply our stochastic framework to two models, namely, the Regime-Switching Geometric Brownian Motion (RS-GBM) model and Regime-Switching Exponential Ornstein-Uhlenbeck (RS-XOU) model. Numerical examples are provided to illustrate the investor's optimal futures positions and portfolio value across market regimes.

q-fin.PM↗

arXiv2019

Generalizations of Reflected Entropy and the Holographic Dual

We introduce a new class of quantum and classical correlation measures by generalizing the reflected entropy to multipartite states. We define the new measures for quantum systems in one spatial dimension. For quantum systems having gravity duals, we show that the holographic duals of these new measures are various types of minimal surfaces consist of different entanglement wedge cross sections. One special generalized reflected entropy is $Δ_R$, with the holographic dual proportional to the so called multipartite entanglement wedge cross section $Δ_W$ defined before. We then perform a large $c$ computation of $Δ_R$ and find precise agreement with the holographic computation of 2$Δ_{W}$. This agreement shows another candidate $Δ_R$ as the dual of $Δ_W$ and also supports our holographic conjecture of the new class of generalized reflected entropies.

hep-th↗

arXiv2019

A Top-Down Approach for the Multiple Exercises and Valuation of Employee Stock Options

We propose a new framework to value employee stock options (ESOs) that captures multiple exercises of different quantities over time. We also model the ESO holder's job termination risk and incorporate its impact on the payoffs of both vested and unvested ESOs. Numerical methods based on Fourier transform and finite differences are developed and implemented to solve the associated systems of PDEs. In addition, we introduce a new valuation method based on maturity randomization that yields analytic formulae for vested and unvested ESO costs. We examine the cost impact of job termination risk, exercise intensity, and various contractual features.

q-fin.PR↗

arXiv2019

Predicting Animation Skeletons for 3D Articulated Models via Volumetric Nets

We present a learning method for predicting animation skeletons for input 3D models of articulated characters. In contrast to previous approaches that fit pre-defined skeleton templates or predict fixed sets of joints, our method produces an animation skeleton tailored for the structure and geometry of the input 3D model. Our architecture is based on a stack of hourglass modules trained on a large dataset of 3D rigged characters mined from the web. It operates on the volumetric representation of the input 3D shapes augmented with geometric shape features that provide additional cues for joint and bone locations. Our method also enables intuitive user control of the level-of-detail for the output skeleton. Our evaluation demonstrates that our approach predicts animation skeletons that are much more similar to the ones created by humans compared to several alternatives and baselines.

cs.CV↗