Hao Ni

Hao Ni

Auto-generated profile, based on publicly available information

Hao Ni

University College London, London, UK

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2017 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
ZXZecheng Xie
Zecheng Xie
ZSZenghui Sun
Zenghui Sun
LJLianwen Jin
Lianwen Jin
HNHao Ni
Hao Ni
TLTerry Lyons
Terry Lyons
Online handwritten Chinese text recognition (OHCTR) is a challenging problem as it involves a large-scale character set, ambiguous segmentation, and variable-length input sequences. In this paper, we exploit the outstanding capability of path signature to translate online pen-tip trajectories into informative signature feature maps, successfully capturing the analytic and geometric properties of pen strokes with strong local invariance and robustness. A multi-spatial-context fully convolutional recurrent network (MC-FCRN) is proposed to exploit the multiple spatial contexts from the signature feature maps and generate a prediction sequence while completely avoiding the difficult segmentation problem. Furthermore, an implicit language model is developed to make predictions based on semantic context within a predicting feature sequence, providing a new perspective for incorporating lexicon constraints and prior knowledge about a certain language in the recognition procedure. Experiments on two standard benchmarks, Dataset-CASIA and Dataset-ICDAR, yielded outstanding results, with correct rates of 97.50 and 96.58 percent, respectively, which are significantly better than the best result reported thus far in the literature.

1 June 2020 in Future Generation Computer Systems
Verified
Journal Article
Open access
Guang YangGuang Yang
Guang Yang
Jun ChenJun Chen
Jun Chen
ZGZhifan Gao
Zhifan Gao
SLShuo Li
Shuo Li
HNHao Ni
Hao Ni
JKJennifer Keegan
Jennifer Keegan
Three-dimensional late gadolinium enhanced (LGE) cardiac MR (CMR) of left atrial scar in patients with atrial fibrillation (AF) has recently emerged as a promising technique to stratify patients, to guide ablation therapy and to predict treatment success. This requires a segmentation of the high intensity scar tissue and also a segmentation of the left atrium (LA) anatomy, the latter usually being derived from a separate bright-blood acquisition. Performing both segmentations automatically from a single 3D LGE CMR acquisition would eliminate the need for an additional acquisition and avoid subsequent registration issues. In this paper, we propose a joint segmentation method based on multiview two-task (MVTT) recursive attention model working directly on 3D LGE CMR images to segment the LA (and proximal pulmonary veins) and to delineate the scar on the same dataset. Using our MVTT recursive attention model, both the LA anatomy and scar can be segmented accurately (mean Dice score of 93% for the LA anatomy and 87% for the scar segmentations) and efficiently (∼0.27 s to simultaneously segment the LA anatomy and scars directly from the 3D LGE CMR dataset with 60–68 2D slices). Compared to conventional unsupervised learning and other state-of-the-art deep learning based methods, the proposed MVTT model achieved excellent results, leading to an automatic generation of a patient-specific anatomical model combined with scar segmentation for patients in AF.

7 November 2023 in Mathematical Finance
Verified
Journal Article
Open access
SLShujian Liao
Shujian Liao
HNHao Ni
Hao Ni
MSMarc Sabate‐Vidales
Marc Sabate‐Vidales
LSLukasz Szpruch
Lukasz Szpruch
MWMagnus Wiese
Magnus Wiese
BXBaoren Xiao
Baoren Xiao
Generative adversarial networks (GANs) have been extremely successful in generating samples, from seemingly high‐dimensional probability measures. However, these methods struggle to capture the temporal dependence of joint probability distributions induced by time‐series data. Furthermore, long time‐series data streams hugely increase the dimension of the target space, which may render generative modeling infeasible. To overcome these challenges, motivated by the autoregressive models in econometric, we are interested in the conditional distribution of future time series given the past information. We propose the generic conditional Sig‐WGAN framework by integrating Wasserstein‐GANs (WGANs) with mathematically principled and efficient path feature extraction called the signature of a path. The signature of a path is a graded sequence of statistics that provides a universal description for a stream of data, and its expected value characterizes the law of the time‐series model. In particular, we develop the conditional Sig‐ metric that captures the conditional joint law of time series models and use it as a discriminator. The signature feature space enables the explicit representation of the proposed discriminators, which alleviates the need for expensive training. We validate our method on both synthetic and empirical dataset and observe that our method consistently and significantly outperforms state‐of‐the‐art benchmarks with respect to measures of similarity and predictive ability.

1 September 2015 in The Annals of Probability
Verified
Journal Article
Open access
PDF file
TLTerry Lyons
Terry Lyons
HNHao Ni
Hao Ni
The signature of a path provides a top down description of the path in terms of its effects as a control [Differential Equations Driven by Rough Paths (2007) Springer]. The signature transforms a path into a group-like element in the tensor algebra and is an essential object in rough path theory. The expected signature of a stochastic process plays a similar role to that played by the characteristic function of a random variable. In [Chevyrev (2013)], it is proved that under certain boundedness conditions, the expected value of a random signature already determines the law of this random signature. It becomes of great interest to be able to compute examples of expected signatures and obtain the upper bounds for the decay rates of expected signatures. For instance, the computation for Brownian motion on $[0,1]$ leads to the “cubature on Wiener space” methodology [Lyons and Victoir, Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 460 (2004) 169–198]. In this paper we fix a bounded domain $\Gamma$ in a Euclidean space $E$ and study the expected signature of a Brownian path starting at $z\in\Gamma$ and stopped at the first exit time from $\Gamma$. We denote this tensor series valued function by $\Phi_{\Gamma}(z)$ and focus on the case $E=\mathbb{R}^{d}$. We show that $\Phi_{\Gamma}(z)$ satisfies an elliptic PDE system and a boundary condition. The equations determining $\Phi_{\Gamma}$ can be recursively solved; by an iterative application of Sobolev estimates we are able, under certain smoothness and boundedness condition of the domain $\Gamma$, to prove geometric bounds for the terms in $\Phi_{\Gamma}(z)$. However, there is still a gap and we have not shown that $\Phi_{\Gamma}(z)$ determines the law of the signature of this stopped Brownian motion even if $\Gamma$ is a unit ball.

1 September 2014 in Journal of Functional Analysis
Verified
Journal Article
Closed access
HBHoratio Boedihardjo
Horatio Boedihardjo
HNHao Ni
Hao Ni
ZQZhongmin Qian
Zhongmin Qian

4 August 2014
Verified
Conference Paper
Open access
PDF file
TLTerry Lyons
Terry Lyons
HNHao Ni
Hao Ni
HOHarald Oberhauser
Harald Oberhauser