arXiv subjects

Kai Wang

Publications and source records attributed to Kai Wang.

At least 739 records · Page 41Linked to original sources

arXiv2019

Probe Charm Yukawa at the future $e^{-}p$ and $e^{+}e^{-}$ colliders

Large Hadron Collider (LHC) has provided direct evidence of Yukawa couplings between the third generation charged fermions and the 125 GeV Higgs boson. Whether the first two generation charged fermions arise from exactly the same mechanism becomes the next interesting question. Therefore, direct measurements of charm or muon Yukawa couplings will be crucial to answering this puzzle. The charm Yukawa measurement at the LHC suffers from severe QCD background and it is extremely difficult to reach the sensitivity. In this paper, we compare the potential of probing charm Yukawa coupling at the two proposed future "Higgs Factory" experiments, the Large Hadron electron Collider (LHeC) and Circular electron positron collider (CEPC). At the LHeC, Higgs bosons will be produced via weak boson fusion and the energetic forward jet may suppress the background significantly. However, due to huge $γ-g$ scattering background, the potential of LHeC search is still limited. With $-80\%$ polarized electron beam of 60 GeV, the signal significance can only reach $2σ$ for $ κ_{c}\simeq 1$ with a 3 ab$^{-1}$ integrated luminosity. In comparison, measurement at the CEPC can then reach $8.0σ$ for $κ_{c}\simeq 1$ with a 2 ab$^{-1}$ of data.

hep-ph↗

arXiv2019

Parallel Explicit Tube Model Predictive Control

This paper is about a parallel algorithm for tube-based model predictive control. The proposed control algorithm solves robust model predictive control problems suboptimally, while exploiting their structure. This is achieved by implementing a real-time algorithm that iterates between the evaluation of piecewise affine functions, corresponding to the parametric solution of small-scale robust MPC problems, and the online solution of structured equality constrained QPs. The performance of the associated real-time robust MPC controllers is illustrated by a numerical case study.

math.OC↗

arXiv2019

BTS-DSN: Deeply Supervised Neural Network with Short Connections for Retinal Vessel Segmentation

Background and Objective: The condition of vessel of the human eye is an important factor for the diagnosis of ophthalmological diseases. Vessel segmentation in fundus images is a challenging task due to complex vessel structure, the presence of similar structures such as microaneurysms and hemorrhages, micro-vessel with only one to several pixels wide, and requirements for finer results. Methods:In this paper, we present a multi-scale deeply supervised network with short connections (BTS-DSN) for vessel segmentation. We used short connections to transfer semantic information between side-output layers. Bottom-top short connections pass low level semantic information to high level for refining results in high-level side-outputs, and top-bottom short connection passes much structural information to low level for reducing noises in low-level side-outputs. In addition, we employ cross-training to show that our model is suitable for real world fundus images. Results: The proposed BTS-DSN has been verified on DRIVE, STARE and CHASE_DB1 datasets, and showed competitive performance over other state-of-the-art methods. Specially, with patch level input, the network achieved 0.7891/0.8212 sensitivity, 0.9804/0.9843 specificity, 0.9806/0.9859 AUC, and 0.8249/0.8421 F1-score on DRIVE and STARE, respectively. Moreover, our model behaves better than other methods in cross-training experiments. Conclusions: BTS-DSN achieves competitive performance in vessel segmentation task on three public datasets. It is suitable for vessel segmentation. The source code of our method is available at https://github.com/guomugong/BTS-DSN.

cs.CV↗

arXiv2019

Frame attention networks for facial expression recognition in videos

The video-based facial expression recognition aims to classify a given video into several basic emotions. How to integrate facial features of individual frames is crucial for this task. In this paper, we propose the Frame Attention Networks (FAN), to automatically highlight some discriminative frames in an end-to-end framework. The network takes a video with a variable number of face images as its input and produces a fixed-dimension representation. The whole network is composed of two modules. The feature embedding module is a deep Convolutional Neural Network (CNN) which embeds face images into feature vectors. The frame attention module learns multiple attention weights which are used to adaptively aggregate the feature vectors to form a single discriminative video representation. We conduct extensive experiments on CK+ and AFEW8.0 datasets. Our proposed FAN shows superior performance compared to other CNN based methods and achieves state-of-the-art performance on CK+.

cs.CV↗

arXiv2019

Video synthesis of human upper body with realistic face

This paper presents a generative adversarial learning-based human upper body video synthesis approach to generate an upper body video of target person that is consistent with the body motion, face expression, and pose of the person in source video. We use upper body keypoints, facial action units and poses as intermediate representations between source video and target video. Instead of directly transferring the source video to the target video, we firstly map the source person's facial action units and poses into the target person's facial landmarks, then combine the normalized upper body keypoints and generated facial landmarks with spatio-temporal smoothing to generate the corresponding target video's image. Experimental results demonstrated the effectiveness of our method.

cs.CV↗

arXiv2019

Region Attention Networks for Pose and Occlusion Robust Facial Expression Recognition

Occlusion and pose variations, which can change facial appearance significantly, are two major obstacles for automatic Facial Expression Recognition (FER). Though automatic FER has made substantial progresses in the past few decades, occlusion-robust and pose-invariant issues of FER have received relatively less attention, especially in real-world scenarios. This paper addresses the real-world pose and occlusion robust FER problem with three-fold contributions. First, to stimulate the research of FER under real-world occlusions and variant poses, we build several in-the-wild facial expression datasets with manual annotations for the community. Second, we propose a novel Region Attention Network (RAN), to adaptively capture the importance of facial regions for occlusion and pose variant FER. The RAN aggregates and embeds varied number of region features produced by a backbone convolutional neural network into a compact fixed-length representation. Last, inspired by the fact that facial expressions are mainly defined by facial action units, we propose a region biased loss to encourage high attention weights for the most important regions. We validate our RAN and region biased loss on both our built test datasets and four popular datasets: FERPlus, AffectNet, RAF-DB, and SFEW. Extensive experiments show that our RAN and region biased loss largely improve the performance of FER with occlusion and variant pose. Our method also achieves state-of-the-art results on FERPlus, AffectNet, RAF-DB, and SFEW. Code and the collected test data will be publicly available.

cs.CV↗

arXiv2019

Exact Hochschild extensions and deformed Calabi-Yau completions

We introduce the Hochschild extensions of dg algebras, which are $A_\infty$-algebras. We show that all exact Hochschild extensions are symmetric Hochschild extensions, more precisely, every exact Hochschild extension of a finite dimensional complete typical dg algebra is a symmetric $A_\infty$-algebra. Moreover, we prove that the Koszul dual of trivial extension is Calabi-Yau completion and the Koszul dual of exact Hochschild extension is deformed Calabi-Yau completion, more precisely, the Koszul dual of the trivial extension of a finite dimensional complete dg algebra is the Calabi-Yau completion of its Koszul dual, and the Koszul dual of an exact Hochschild extension of a finite dimensional complete typical dg algebra is the deformed Calabi-Yau completion of its Koszul dual.

math.RA↗

arXiv2019

A two-zone model for blazar emission: implications for TXS 0506+056 and the neutrino event IceCube-170922A

A high-energy muon neutrino event, IceCube-170922A, was recently discovered in both spatial and temporal coincidence with a gamma-ray flare of the blazar TXS 0506+056. It has been shown, with standard one-zone models, that neutrinos can be produced in the blazar jet via hadronic interactions, but with a flux which is mostly limited by the X-ray data. In this work, we explore the neutrino production from TXS 0506+056 by invoking two physically distinct emission zones in the jet, separated by the broad line region (BLR). Using the Doppler-boosted radiation of the BLR as the target photon field, the inner zone accounts for the neutrino and gamma-ray emission via $pγ$ interactions and inverse Compton scattering respectively, while the outer zone produces the optical and X-ray emission via synchrotron and synchrotron self-Compton processes. The different conditions of the two zones allow us to suppress the X-ray emission from the electromagnetic cascade, and set a much higher upper limit on the muon neutrino flux (i.e., $\sim 10^{-11}\rm erg~cm^{-2}s^{-1}$) than in one-zone models. We compare, in detail, our scenario with one-zone models discussed in the literature, and argue that differentiating between such scenarios will become possible with next generation neutrino telescopes, such as IceCube-Gen2.

astro-ph.HE↗

arXiv2019

A Realistic Face-to-Face Conversation System based on Deep Neural Networks

To improve the experiences of face-to-face conversation with avatar, this paper presents a novel conversation system. It is composed of two sequence-to-sequence models respectively for listening and speaking and a Generative Adversarial Network (GAN) based realistic avatar synthesizer. The models exploit the facial action and head pose to learn natural human reactions. Based on the models' output, the synthesizer uses the Pixel2Pixel model to generate realistic facial images. To show the improvement of our system, we use a 3D model based avatar driving scheme as a reference. We train and evaluate our neural networks with the data from ESPN shows. Experimental results show that our conversation system can generate natural facial reactions and realistic facial images.

cs.CV↗

arXiv2019

An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences

As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization. The algorithm can be configured to run in polynomial time, at the expense of possibly producing an erroneous output on some "yes" instances but with very low error rate.

math.CO↗

arXiv2019

Deep Learning based Wearable Assistive System for Visually Impaired People

In this paper, we propose a deep learning based assistive system to improve the environment perception experience of visually impaired (VI). The system is composed of a wearable terminal equipped with an RGBD camera and an earphone, a powerful processor mainly for deep learning inferences and a smart phone for touch-based interaction. A data-driven learning approach is proposed to predict safe and reliable walkable instructions using RGBD data and the established semantic map. This map is also used to help VI understand their 3D surrounding objects and layout through well-designed touchscreen interactions. The quantitative and qualitative experimental results show that our learning based obstacle avoidance approach achieves excellent results in both indoor and outdoor datasets with low-lying obstacles. Meanwhile, user studies have also been carried out in various scenarios and showed the improvement of VI's environment perception experience with our system.

cs.RO↗

arXiv2019

Small amplitude collective modes of a finite-size unitary Fermi gas in deformed traps

We have investigated collective breathing modes of a unitary Fermi gas in deformed harmonic traps. The ground state is studied by the Superfluid Local Density Approximation (SLDA) and small-amplitude collective modes are studied by the iterative Quasiparticle Random Phase Approximation (QRPA). The results illustrate the evolutions of collective modes of a small system in traps from spherical to elongated or pancake deformations. For small spherical systems, the influences of different SLDA parameters are significant, and, in particular, a large pairing strength can shift up the oscillation frequency of collective mode. The transition currents from QRPA show that the compressional flow patterns are nontrivial and dependent on the deformation. Finally, the finite size effects are demonstrated to be reasonable when progressing towards larger systems. Our studies indicate that experiments on small and medium systems are valuable for understanding effective interactions in systems with varying sizes and trap deformations.

cond-mat.quant-gas↗

arXiv2019

Extended calculations of energy levels, radiative properties, and lifetimes for oxygen-like Mo XXXV

Employing two state-of-the-art methods, second-order many-body perturbation theory and multiconfiguration Dirac-Fock, highly accurate calculations are performed for the lowest 318 fine-structure levels arising from the $2s^{2} 2p^{4}$, $2s 2p^{5}$, $2p^{6}$, $2s^{2} 2p^{3} 3l$, $2s 2p^{4} 3l$, $2p^{5} 3l$, and $2s^{2} 2p^{3} 4l$ configurations in O-like \mbox{Mo XXXV}. Complete and consistent atomic data, including excitation energies, lifetimes, wavelengths, and E1, E2, M1 line strengths, oscillator strengths, and transition rates among these 318 levels are provided. Comparisons are made between the present two data sets, as well as with other available experimental and theoretical values. The present data are accurate enough for identification and deblending of emission lines involving the $n=3,4$ levels and are also useful for modeling and diagnosing fusion plasmas\kw{. These data can} be considered as a benchmark for other calculations.

physics.atom-ph↗

arXiv2019

Coupled-Projection Residual Network for MRI Super-Resolution

Magnetic Resonance Imaging(MRI) has been widely used in clinical application and pathology research by helping doctors make more accurate diagnoses. On the other hand, accurate diagnosis by MRI remains a great challenge as images obtained via present MRI techniques usually have low resolutions. Improving MRI image quality and resolution thus becomes a critically important task. This paper presents an innovative Coupled-Projection Residual Network (CPRN) for MRI super-resolution. The CPRN consists of two complementary sub-networks: a shallow network and a deep network that keep the content consistency while learning high frequency differences between low-resolution and high-resolution images. The shallow sub-network employs coupled-projection for better retaining the MRI image details, where a novel feedback mechanism is introduced to guide the reconstruction of high-resolution images. The deep sub-network learns from the residuals of the high-frequency image information, where multiple residual blocks are cascaded to magnify the MRI images at the last network layer. Finally, the features from the shallow and deep sub-networks are fused for the reconstruction of high-resolution MRI images. For effective fusion of features from the deep and shallow sub-networks, a step-wise connection (CPRN S) is designed as inspired by the human cognitive processes (from simple to complex). Experiments over three public MRI datasets show that our proposed CPRN achieves superior MRI super-resolution performance as compared with the state-of-the-art. Our source code will be publicly available at http://www.yongxu.org/lunwen.html.

eess.IV↗

arXiv2019

Nickel coated carbon nanotubes in aluminum matrix composites: A multiscale simulation study

In this work we use density functional theory (DFT) calculations to benchmark empirical potentials for the interaction between nickel and sp$^2$ bonded carbon nanoparticles. These potentials are then used in order to investigate how Ni decorated or coated carbon nanotubes (CNT) affect the mechanical properties of Al/CNT composites. In particular we look at the pull-out behaviour of pristine as well as Ni-decorated and Ni-coated CNT from an Al matrix. Our result shows that Ni coating may produce an extended interface (interphase) where a significant amount of energy is dissipated during CNT pull-out, leading to a high pull-out force. We also demonstrate that surface decorated CNT may act as efficient nano-crystallization agents and thus provide a novel strengthening mechanism not previously discussed in the literature. We discuss our results in view of promising approaches for engineering CNT-metal interfaces such as to achieve high strength metal-CNT composite.

cond-mat.mtrl-sci↗

arXiv2019

Bootstrap Model Ensemble and Rank Loss for Engagement Intensity Regression

This paper presents our approach for the engagement intensity regression task of EmotiW 2019. The task is to predict the engagement intensity value of a student when he or she is watching an online MOOCs video in various conditions. Based on our winner solution last year, we mainly explore head features and body features with a bootstrap strategy and two novel loss functions in this paper. We maintain the framework of multi-instance learning with long short-term memory (LSTM) network, and make three contributions. First, besides of the gaze and head pose features, we explore facial landmark features in our framework. Second, inspired by the fact that engagement intensity can be ranked in values, we design a rank loss as a regularization which enforces a distance margin between the features of distant category pairs and adjacent category pairs. Third, we use the classical bootstrap aggregation method to perform model ensemble which randomly samples a certain training data by several times and then averages the model predictions. We evaluate the performance of our method and discuss the influence of each part on the validation dataset. Our methods finally win 3rd place with MSE of 0.0626 on the testing set.

cs.CV↗

arXiv2019

Richer Convolutional Features for Edge Detection

In this paper, we propose an accurate edge detector using richer convolutional features (RCF). Since objects in nature images have various scales and aspect ratios, the automatically learned rich hierarchical representations by CNNs are very critical and effective to detect edges and object boundaries. And the convolutional features gradually become coarser with receptive fields increasing. Based on these observations, our proposed network architecture makes full use of multiscale and multi-level information to perform the image-to-image edge prediction by combining all of the useful convolutional features into a holistic framework. It is the first attempt to adopt such rich convolutional features in computer vision tasks. Using VGG16 network, we achieve \sArt results on several available datasets. When evaluating on the well-known BSDS500 benchmark, we achieve ODS F-measure of \textbf{.811} while retaining a fast speed (\textbf{8} FPS). Besides, our fast version of RCF achieves ODS F-measure of \textbf{.806} with \textbf{30} FPS.

cs.CV↗

arXiv2019

Efficient Butterfly Counting for Large Bipartite Networks

Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive structure and plays a key role. In this paper, we study the problem of efficient counting the number of butterflies in bipartite networks. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handle large-scale bipartite networks. This becomes a bottleneck in large-scale applications. In this paper, instead of the existing layer-priority-based techniques, we propose a vertex-priority-based paradigm BFC-VP to enumerate much fewer wedges; this leads to a significant improvement of the time complexity of the state-of-the-art algorithms. In addition, we present cache-aware strategies to further improve time efficiency while theoretically retaining the time complexity of BFC-VP. Moreover, we also show that our proposed techniques can work efficiently in external and parallel contexts. Our extensive empirical studies demonstrate that the proposed techniques can speed up the state-of-the-art techniques by up to two orders of magnitude for the real datasets.

cs.SI↗