arXiv subjects

Hao Tang

Publications and source records attributed to Hao Tang.

At least 397 records · Page 22Linked to original sources

arXiv2022

Quantum Computation for Pricing Caps using the LIBOR Market Model

The LIBOR Market Model (LMM) is a widely used model for pricing interest rate derivatives. While the Black-Scholes model is well-known for pricing stock derivatives such as stock options, a larger portion of derivatives are based on interest rates instead of stocks. Pricing interest rate derivatives used to be challenging, as their previous models employed either the instantaneous interest or forward rate that could not be directly observed in the market. This has been much improved since LMM was raised, as it uses directly observable interbank offered rates and is expected to be more precise. Recently, quantum computing has been used to speed up option pricing tasks, but rarely on structured interest rate derivatives. Given the size of the interest rate derivatives market and the widespread use of LMM, we employ quantum computing to price an interest rate derivative, caps, based on the LMM. As caps pricing relates to path-dependent Monte Carlo iterations for different tenors, which is common for many complex structured derivatives, we developed our hybrid classical-quantum approach that applies the quantum amplitude estimation algorithm to estimate the expectation for the last tenor. We show that our hybrid approach still shows better convergence than pure classical Monte Carlo methods, providing a useful case study for quantum computing with a greater diversity of derivatives.

quant-ph↗

arXiv2022

Unsupervised High-Resolution Portrait Gaze Correction and Animation

This paper proposes a gaze correction and animation method for high-resolution, unconstrained portrait images, which can be trained without the gaze angle and the head pose annotations. Common gaze-correction methods usually require annotating training data with precise gaze, and head pose information. Solving this problem using an unsupervised method remains an open problem, especially for high-resolution face images in the wild, which are not easy to annotate with gaze and head pose labels. To address this issue, we first create two new portrait datasets: CelebGaze and high-resolution CelebHQGaze. Second, we formulate the gaze correction task as an image inpainting problem, addressed using a Gaze Correction Module (GCM) and a Gaze Animation Module (GAM). Moreover, we propose an unsupervised training strategy, i.e., Synthesis-As-Training, to learn the correlation between the eye region features and the gaze angle. As a result, we can use the learned latent space for gaze animation with semantic interpolation in this space. Moreover, to alleviate both the memory and the computational costs in the training and the inference stage, we propose a Coarse-to-Fine Module (CFM) integrated with GCM and GAM. Extensive experiments validate the effectiveness of our method for both the gaze correction and the gaze animation tasks in both low and high-resolution face datasets in the wild and demonstrate the superiority of our method with respect to the state of the arts. Code is available at https://github.com/zhangqianhui/GazeAnimationV2

cs.CV↗

arXiv2022

MHFormer: Multi-Hypothesis Transformer for 3D Human Pose Estimation

Estimating 3D human poses from monocular videos is a challenging task due to depth ambiguity and self-occlusion. Most existing works attempt to solve both issues by exploiting spatial and temporal relationships. However, those works ignore the fact that it is an inverse problem where multiple feasible solutions (i.e., hypotheses) exist. To relieve this limitation, we propose a Multi-Hypothesis Transformer (MHFormer) that learns spatio-temporal representations of multiple plausible pose hypotheses. In order to effectively model multi-hypothesis dependencies and build strong relationships across hypothesis features, the task is decomposed into three stages: (i) Generate multiple initial hypothesis representations; (ii) Model self-hypothesis communication, merge multiple hypotheses into a single converged representation and then partition it into several diverged hypotheses; (iii) Learn cross-hypothesis communication and aggregate the multi-hypothesis features to synthesize the final 3D pose. Through the above processes, the final representation is enhanced and the synthesized pose is much more accurate. Extensive experiments show that MHFormer achieves state-of-the-art results on two challenging datasets: Human3.6M and MPI-INF-3DHP. Without bells and whistles, its performance surpasses the previous best result by a large margin of 3% on Human3.6M. Code and models are available at \url{https://github.com/Vegetebird/MHFormer}.

cs.CV↗

arXiv2022

Real-Time Portrait Stylization on the Edge

In this work we demonstrate real-time portrait stylization, specifically, translating self-portrait into cartoon or anime style on mobile devices. We propose a latency-driven differentiable architecture search method, maintaining realistic generative quality. With our framework, we obtain $10\times$ computation reduction on the generative model and achieve real-time video stylization on off-the-shelf smartphone using mobile GPUs.

cs.CV↗

arXiv2022

Experimental Quantum Simulation of Dynamic Localization on Curved Photonic Lattices

Dynamic localization, which originates from the phenomena of particle evolution suppression under an externally applied AC electric field, has been simulated by suppressed light evolution in periodically-curved photonic arrays. However, experimental studies on their quantitative dynamic transport properties and application for quantum information processing are rare. Here we fabricate one-dimensional and hexagonal two-dimensional arrays, both with sinusoidal curvature. We successfully observe the suppressed single-photon evolution patterns, and for the first time measure the variances to study their transport properties. For one-dimensional arrays, the measured variances match both the analytical electric field calculation and the quantum walk Hamiltonian engineering approach. For hexagonal arrays, as anisotropic effective couplings in four directions are mutually dependent, the analytical approach suffers, while quantum walk conveniently incorporates all anisotropic coupling coefficients in the Hamiltonian and solves its exponential as a whole, yielding consistent variances with our experimental results. Furthermore, we implement a nearly complete localization to show that it can preserve both the initial injection and the wave-packet after some evolution, acting as a memory of a flexible time scale in integrated photonics. We demonstrate a useful quantum simulation of dynamic localization for studying their anisotropic transport properties, and a promising application of dynamic localization as a building block for quantum information processing in integrated photonics.

quant-ph↗

arXiv2022

AO2-DETR: Arbitrary-Oriented Object Detection Transformer

Arbitrary-oriented object detection (AOOD) is a challenging task to detect objects in the wild with arbitrary orientations and cluttered arrangements. Existing approaches are mainly based on anchor-based boxes or dense points, which rely on complicated hand-designed processing steps and inductive bias, such as anchor generation, transformation, and non-maximum suppression reasoning. Recently, the emerging transformer-based approaches view object detection as a direct set prediction problem that effectively removes the need for hand-designed components and inductive biases. In this paper, we propose an Arbitrary-Oriented Object DEtection TRansformer framework, termed AO2-DETR, which comprises three dedicated components. More precisely, an oriented proposal generation mechanism is proposed to explicitly generate oriented proposals, which provides better positional priors for pooling features to modulate the cross-attention in the transformer decoder. An adaptive oriented proposal refinement module is introduced to extract rotation-invariant region features and eliminate the misalignment between region features and objects. And a rotation-aware set matching loss is used to ensure the one-to-one matching process for direct set prediction without duplicate predictions. Our method considerably simplifies the overall pipeline and presents a new AOOD paradigm. Comprehensive experiments on several challenging datasets show that our method achieves superior performance on the AOOD task.

cs.CV↗

arXiv2022

Characterizing temperature and strain variations with qubit ensembles for their robust coherence protection

Solid-state spin defects, especially nuclear spins with potentially achievable long coherence times, are compelling candidates for quantum memories and sensors. However, their current performances are still limited by the decoherence due to the variation of their intrinsic quadrupole and hyperfine interactions. We propose an \textit{unbalanced echo} to overcome this challenge by using a second spin to refocus the variation of these interactions, which preserves the quantum information stored in the free evolution. The unbalanced echo can be used to probe the temperature and strain distribution in materials. Experimentally, we demonstrate a 20-fold $T_2^*$ coherence time increase in an ensemble of $\sim10^{10}$ nuclear spins in diamond. Theoretically, we develop first-principles methods to predict these interaction variations and reveal their correlation in large temperature and strain ranges. We numerically show that our method can refocus stronger noise variations than our current experiments and achieves a 400-fold coherence improvement for a 25~K temperature inhomogeneity.

quant-ph↗

arXiv2022

Supervised Attention in Sequence-to-Sequence Models for Speech Recognition

Attention mechanism in sequence-to-sequence models is designed to model the alignments between acoustic features and output tokens in speech recognition. However, attention weights produced by models trained end to end do not always correspond well with actual alignments, and several studies have further argued that attention weights might not even correspond well with the relevance attribution of frames. Regardless, visual similarity between attention weights and alignments is widely used during training as an indicator of the models quality. In this paper, we treat the correspondence between attention weights and alignments as a learning problem by imposing a supervised attention loss. Experiments have shown significant improved performance, suggesting that learning the alignments well during training critically determines the performance of sequence-to-sequence models.

eess.AS↗

arXiv2022

Looking Outside the Window: Wide-Context Transformer for the Semantic Segmentation of High-Resolution Remote Sensing Images

Long-range contextual information is crucial for the semantic segmentation of High-Resolution (HR) Remote Sensing Images (RSIs). However, image cropping operations, commonly used for training neural networks, limit the perception of long-range contexts in large RSIs. To overcome this limitation, we propose a Wide-Context Network (WiCoNet) for the semantic segmentation of HR RSIs. Apart from extracting local features with a conventional CNN, the WiCoNet has an extra context branch to aggregate information from a larger image area. Moreover, we introduce a Context Transformer to embed contextual information from the context branch and selectively project it onto the local features. The Context Transformer extends the Vision Transformer, an emerging kind of neural network, to model the dual-branch semantic correlations. It overcomes the locality limitation of CNNs and enables the WiCoNet to see the bigger picture before segmenting the land-cover/land-use (LCLU) classes. Ablation studies and comparative experiments conducted on several benchmark datasets demonstrate the effectiveness of the proposed method. In addition, we present a new Beijing Land-Use (BLU) dataset. This is a large-scale HR satellite dataset with high-quality and fine-grained reference labels, which can facilitate future studies in this field.

cs.CV↗

arXiv2022

Deep Algebraic Fitting for Multiple Circle Primitives Extraction from Raw Point Clouds

The shape of circle is one of fundamental geometric primitives of man-made engineering objects. Thus, extraction of circles from scanned point clouds is a quite important task in 3D geometry data processing. However, existing circle extraction methods either are sensitive to the quality of raw point clouds when classifying circle-boundary points, or require well-designed fitting functions when regressing circle parameters. To relieve the challenges, we propose an end-to-end Point Cloud Circle Algebraic Fitting Network (Circle-Net) based on a synergy of deep circle-boundary point feature learning and weighted algebraic fitting. First, we design a circle-boundary learning module, which considers local and global neighboring contexts of each point, to detect all potential circle-boundary points. Second, we develop a deep feature based circle parameter learning module for weighted algebraic fitting, without designing any weight metric, to avoid the influence of outliers during fitting. Unlike most of the cutting-edge circle extraction wisdoms, the proposed classification-and-fitting modules are originally co-trained with a comprehensive loss to enhance the quality of extracted circles.Comparisons on the established dataset and real-scanned point clouds exhibit clear improvements of Circle-Net over SOTAs in terms of both noise-robustness and extraction accuracy. We will release our code, model, and data for both training and evaluation on GitHub upon publication.

cs.CV↗

arXiv2022

Predict, Prevent, and Evaluate: Disentangled Text-Driven Image Manipulation Empowered by Pre-Trained Vision-Language Model

To achieve disentangled image manipulation, previous works depend heavily on manual annotation. Meanwhile, the available manipulations are limited to a pre-defined set the models were trained for. We propose a novel framework, i.e., Predict, Prevent, and Evaluate (PPE), for disentangled text-driven image manipulation that requires little manual annotation while being applicable to a wide variety of manipulations. Our method approaches the targets by deeply exploiting the power of the large-scale pre-trained vision-language model CLIP. Concretely, we firstly Predict the possibly entangled attributes for a given text command. Then, based on the predicted attributes, we introduce an entanglement loss to Prevent entanglements during training. Finally, we propose a new evaluation metric to Evaluate the disentangled image manipulation. We verify the effectiveness of our method on the challenging face editing task. Extensive experiments show that the proposed PPE framework achieves much better quantitative and qualitative results than the up-to-date StyleCLIP baseline.

cs.CV↗

arXiv2022

Graph-based Generative Face Anonymisation with Pose Preservation

We propose AnonyGAN, a GAN-based solution for face anonymisation which replaces the visual information corresponding to a source identity with a condition identity provided as any single image. With the goal to maintain the geometric attributes of the source face, i.e., the facial pose and expression, and to promote more natural face generation, we propose to exploit a Bipartite Graph to explicitly model the relations between the facial landmarks of the source identity and the ones of the condition identity through a deep model. We further propose a landmark attention model to relax the manual selection of facial landmarks, allowing the network to weight the landmarks for the best visual naturalness and pose preservation. Finally, to facilitate the appearance learning, we propose a hybrid training strategy to address the challenge caused by the lack of direct pixel-level supervision. We evaluate our method and its variants on two public datasets, CelebA and LFW, in terms of visual naturalness, facial pose preservation and of its impacts on face detection and re-identification. We prove that AnonyGAN significantly outperforms the state-of-the-art methods in terms of visual naturalness, face detection and pose preservation.

cs.CV↗

arXiv2022

Global existence and blow-up for a stochastic transport equation with non-local velocity

In this paper we investigate a non-linear and non-local one dimensional transport equation under random perturbations on the real line. We first establish a local-in-time theory, i.e., existence, uniqueness and blow-up criterion for pathwise solutions in Sobolev spaces $H^{s}$ with $s>3$. Thereafter, we give a complete picture of the long time behavior of the solutions based on the type of noise we consider. On one hand, we identify a family of noises such that blow-up can be prevented with probability $1$, guaranteeing the existence and uniqueness of global solutions almost surely. On the other hand, in the particular linear noise case, we show that singularities occur in finite time with positive probability, and we derive lower bounds of these probabilities. To conclude, we introduce the notion of stability of exiting times and show that one cannot improve the stability of the exiting time and simultaneously improve the continuity of the dependence on initial data.

math.AP↗

arXiv2022

Cross-View Panorama Image Synthesis

In this paper, we tackle the problem of synthesizing a ground-view panorama image conditioned on a top-view aerial image, which is a challenging problem due to the large gap between the two image domains with different view-points. Instead of learning cross-view mapping in a feedforward pass, we propose a novel adversarial feedback GAN framework named PanoGAN with two key components: an adversarial feedback module and a dual branch discrimination strategy. First, the aerial image is fed into the generator to produce a target panorama image and its associated segmentation map in favor of model training with layout semantics. Second, the feature responses of the discriminator encoded by our adversarial feedback module are fed back to the generator to refine the intermediate representations, so that the generation performance is continually improved through an iterative generation process. Third, to pursue high-fidelity and semantic consistency of the generated panorama image, we propose a pixel-segmentation alignment mechanism under the dual branch discrimiantion strategy to facilitate cooperation between the generator and the discriminator. Extensive experimental results on two challenging cross-view image datasets show that PanoGAN enables high-quality panorama image generation with more convincing details than state-of-the-art approaches. The source code and trained models are available at \url{https://github.com/sswuai/PanoGAN}.

cs.CV↗

arXiv2022

Hierarchical Sketch Induction for Paraphrase Generation

We propose a generative model of paraphrase generation, that encourages syntactic diversity by conditioning on an explicit syntactic sketch. We introduce Hierarchical Refinement Quantized Variational Autoencoders (HRQ-VAE), a method for learning decompositions of dense encodings as a sequence of discrete latent variables that make iterative refinements of increasing granularity. This hierarchy of codes is learned through end-to-end training, and represents fine-to-coarse grained information about the input. We use HRQ-VAE to encode the syntactic form of an input sentence as a path through the hierarchy, allowing us to more easily predict syntactic sketches at test time. Extensive experiments, including a human evaluation, confirm that HRQ-VAE learns a hierarchical representation of the input space, and generates paraphrases of higher quality than previous systems.

cs.CL↗

arXiv2022

Topology-Preserving Shape Reconstruction and Registration via Neural Diffeomorphic Flow

Deep Implicit Functions (DIFs) represent 3D geometry with continuous signed distance functions learned through deep neural nets. Recently DIFs-based methods have been proposed to handle shape reconstruction and dense point correspondences simultaneously, capturing semantic relationships across shapes of the same class by learning a DIFs-modeled shape template. These methods provide great flexibility and accuracy in reconstructing 3D shapes and inferring correspondences. However, the point correspondences built from these methods do not intrinsically preserve the topology of the shapes, unlike mesh-based template matching methods. This limits their applications on 3D geometries where underlying topological structures exist and matter, such as anatomical structures in medical images. In this paper, we propose a new model called Neural Diffeomorphic Flow (NDF) to learn deep implicit shape templates, representing shapes as conditional diffeomorphic deformations of templates, intrinsically preserving shape topologies. The diffeomorphic deformation is realized by an auto-decoder consisting of Neural Ordinary Differential Equation (NODE) blocks that progressively map shapes to implicit templates. We conduct extensive experiments on several medical image organ segmentation datasets to evaluate the effectiveness of NDF on reconstructing and aligning shapes. NDF achieves consistently state-of-the-art organ shape reconstruction and registration results in both accuracy and quality. The source code is publicly available at https://github.com/Siwensun/Neural_Diffeomorphic_Flow--NDF.

cs.CV↗

arXiv2022

Quantum Deep Learning for Mutant COVID-19 Strain Prediction

New COVID-19 epidemic strains like Delta and Omicron with increased transmissibility and pathogenicity emerge and spread across the whole world rapidly while causing high mortality during the pandemic period. Early prediction of possible variants (especially spike protein) of COVID-19 epidemic strains based on available mutated SARS-CoV-2 RNA sequences may lead to early prevention and treatment. Here, combining the advantage of quantum and quantum-inspired algorithms with the wide application of deep learning, we propose a development tool named DeepQuantum, and use this software to realize the goal of predicting spike protein variation structure of COVID-19 epidemic strains. In addition, this hybrid quantum-classical model for the first time achieves quantum-inspired blur convolution similar to classical depthwise convolution and also successfully applies quantum progressive training with quantum circuits, both of which guarantee that our model is the quantum counterpart of the famous style-based GAN. The results state that the fidelities of random generating spike protein variation structure are always beyond 96% for Delta, 94% for Omicron. The training loss curve is more stable and converges better with multiple loss functions compared with the corresponding classical algorithm. At last, evidences that quantum-inspired algorithms promote the classical deep learning and hybrid models effectively predict the mutant strains are strong.

cs.LG↗

arXiv2022

Distribution-Path Dependent Nonlinear SPDEs with Application to Stochastic Transport Type Equations

By using a regularity approximation argument, the global existence and uniqueness are derived for a class of nonlinear SPDEs depending on both the whole history and the distribution under strong enough noise. As applications, the global existence and uniqueness are proved for distribution-path dependent stochastic transport type equations, which are arising from stochastic fluid mechanics with forces depending on the history and the environment. In particular, the distribution-path dependent stochastic Camassa--Holm equation with or without Coriolis effect has a unique global solution when the noise is strong enough, whereas for the deterministic model wave-breaking may occur. This indicates that the noise may prevent blow-up almost surely.

math.AP↗