arXiv subjects

Ning Ning

Publications and source records attributed to Ning Ning.

46 records · Page 3Linked to original sources

arXiv2019

Facial Makeup Transfer Combining Illumination Transfer

To meet the women appearance needs, we present a novel virtual experience approach of facial makeup transfer, developed into windows platform application software. The makeup effects could present on the user's input image in real time, with an only single reference image. The input image and reference image are divided into three layers by facial feature points landmarked: facial structure layer, facial color layer, and facial detail layer. Except for the above layers are processed by different algorithms to generate output image, we also add illumination transfer, so that the illumination effect of the reference image is automatically transferred to the input image. Our approach has the following three advantages: (1) Black or dark and white facial makeup could be effectively transferred by introducing illumination transfer; (2) Efficiently transfer facial makeup within seconds compared to those methods based on deep learning frameworks; (3) Reference images with the air-bangs could transfer makeup perfectly.

cs.CV↗

arXiv2019

The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations

The tree reconstruction problem is to collect and analyze massive data at the $n$th level of the tree, to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. Its connection to the clustering problem in the setting of the stochastic block model, which has wide applications in machine learning and data mining, has been well established. For the stochastic block model, an "information-theoretically-solvable-but-computationally-hard" region, or say "hybrid-hard phase", appears whenever the reconstruction bound is not tight of the corresponding reconstruction on the tree problem. Although it has been studied in numerous contexts, the existing literature with rigorous reconstruction thresholds established are very limited, and it becomes extremely challenging when the model under investigation has $4$ states (the stochastic block model with $4$ communities). In this paper, inspired by the newly proposed $q_1+q_2$ stochastic block model, we study a $4$ states symmetric model with different in-block and out-block transition probabilities, and rigorously give the conditions for the non-tightness of the reconstruction threshold.

stat.ML↗

arXiv2018

Big Data Information Reconstruction on an Infinite Tree for a $4\times 4$-state Asymmetric Model with Community Effects

The information reconstruction problem on an infinite tree, is to collect and analyze massive data samples at the $n$th level of the tree to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. This problem has wide applications in various fields such as biology, information theory and statistical physics, and its close connections to cluster learning, data mining and deep learning have been well established in recent years. Although it has been studied in numerous contexts, the existing literatures with rigorous reconstruction thresholds established are very limited. In this paper, motivated by a classical deoxyribonucleic acid (DNA) evolution model, the F$81$ model, and taking into consideration of the Chargaff's parity rule by allowing the existence of a guanine-cytosine content bias, we study the noise channel in terms of a $4\times 4$-state asymmetric probability transition matrix with community effects, for four nucleobases of DNA. The corresponding information reconstruction problem in molecular phylogenetics is explored, by means of refined analyses of moment recursion, in-depth concentration estimates, and thorough investigations on an asymptotic $4$-dimensional nonlinear second order dynamical system. We rigorously show that the reconstruction bound is not tight when the sum of the base frequencies of adenine and thymine falls in the interval $\left(0,1/2-\sqrt{3}/6\right)\bigcup \left(1/2+\sqrt{3}/6,1\right)$, which is the first rigorous result on asymmetric noisy channels with community effects.

math.PR↗

arXiv2018

Large Degree Asymptotics and the Reconstruction Threshold of the Asymmetric Binary Channels

In this paper, we consider a broadcasting process in which information is propagated from a given root node on a noisy tree network, and answer the question that whether the symbols at the nth level of the tree contain non-vanishing information of the root as n goes to infinity. Although the reconstruction problem on the tree has been studied in numerous contexts including information theory, mathematical genetics and statistical physics, the existing literatures with rigorous reconstruction thresholds established are very limited. In the remarkable work of Borgs, Chayes, Mossel and Roch (The Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels), the exact threshold for the reconstruction problem for a binary asymmetric channel on the d-ary tree is establish, provided that the asymmetry is sufficiently small, which is the first exact reconstruction threshold obtained in roughly a decade. In this paper, by means of refined analyses of moment recursion on a weighted version of the magnetization, and concentration investigations, we rigorously give a complete answer to the question of how small it needs to be to establish the tightness of the reconstruction threshold and further determine its asymptotics of large degrees.

math.PR↗

arXiv2018

Multivariate Bayesian Structural Time Series Model

This paper deals with inference and prediction for multiple correlated time series, where one has also the choice of using a candidate pool of contemporaneous predictors for each target series. Starting with a structural model for the time-series, Bayesian tools are used for model fitting, prediction, and feature selection, thus extending some recent work along these lines for the univariate case. The Bayesian paradigm in this multivariate setting helps the model avoid overfitting as well as capture correlations among the multiple time series with the various state components. The model provides needed flexibility to choose a different set of components and available predictors for each target series. The cyclical component in the model can handle large variations in the short term, which may be caused by external shocks. We run extensive simulations to investigate properties such as estimation accuracy and performance in forecasting. We then run an empirical study with one-step-ahead prediction on the max log return of a portfolio of stocks that involve four leading financial institutions. Both the simulation studies and the extensive empirical study confirm that this multivariate model outperforms three other benchmark models, viz. a model that treats each target series as independent, the autoregressive integrated moving average model with regression (ARIMAX), and the multivariate ARIMAX (MARIMAX) model.

stat.ML↗

arXiv2018

Evolution of Regional Innovation with Spatial Knowledge Spillovers: Convergence or Divergence?

This paper extends endogenous economic growth models to incorporate knowledge externality. We explores whether spatial knowledge spillovers among regions exist, whether spatial knowledge spillovers promote regional innovative activities, and whether external knowledge spillovers affect the evolution of regional innovations in the long run. We empirically verify the theoretical results through applying spatial statistics and econometric model in the analysis of panel data of 31 regions in China. An accurate estimate of the range of knowledge spillovers is achieved and the convergence of regional knowledge growth rate is found, with clear evidences that developing regions benefit more from external knowledge spillovers than developed regions.

econ.EM↗

arXiv2017

Reconstruction for the Asymmetric Ising Model on Regular Trees

It is known that the Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels. In this paper, we will adopt a refined analysis of moment recursion on a weighted version of the magnetization, which is engaged in Sly [2011] to handle the symmetric Potts model, and establish the critical condition of the asymmetric Ising model to make Kesten-Stigum bound the reconstruction threshold on regular $d$-ary trees.

math.PR↗

arXiv2017

The Tightness of the Kesten-Stigum Reconstruction Bound of Symmetric Model with Multiple Mutations

It is well known that reconstruction problems, as the interdisciplinary subject, have been studied in numerous contexts including statistical physics, information theory and computational biology, to name a few. We consider a $2q$-state symmetric model, with two categories of $q$ states in each category, and 3 transition probabilities: the probability to remain in the same state, the probability to change states but remain in the same category, and the probability to change categories. We construct a nonlinear second order dynamical system based on this model and show that the Kesten-Stigum reconstruction bound is not tight when $q \geq 4$.

math.PR↗

arXiv2017

Uncertain Volatility Models with Stochastic Bounds

In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead of using two deterministic bounds, the uncertain volatility fluctuates between two stochastic bounds generated by its inherent stochastic volatility process. This brings better accuracy and is consistent with the observed volatility path such as for the VIX as a proxy for instance. We apply the regular perturbation analysis upon the worst case scenario price, and derive the first order approximation in the regime of slowly varying stochastic bounds. The original problem which involves solving a fully nonlinear PDE in dimension two for the worst case scenario price, is reduced to solving a nonlinear PDE in dimension one and a linear PDE with source, which gives a tremendous computational advantage. Numerical experiments show that this approximation procedure performs very well, even in the regime of moderately slow varying stochastic bounds.

q-fin.MF↗

arXiv2016

Freezing and melting equations for the $n$-6 Lennard-Jones systems

We generalize previous approach of Khrapak and Morfill [J. Chem. Phys. {\bf 134}, 094108 (2011)] to construct simple and sufficiently accurate freezing and melting equations for the conventional Lennard-Jones (LJ) system to $n$-6 LJ systems, using the accurate results for the triple points of these systems published by Sousa {\it et al.} [J. Chem. Phys. {\bf 136}, 174502 (2012)].

cond-mat.soft↗