Searcharxiv⌕ Search

arXiv subjects

Guang Yang

Publications and source records attributed to Guang Yang.

At least 415 records · Page 23Linked to original sources
arXiv2022

Unsupervised Image Registration Towards Enhancing Performance and Explainability in Cardiac And Brain Image Analysis

Magnetic Resonance Imaging (MRI) typically recruits multiple sequences (defined here as "modalities"). As each modality is designed to offer different anatomical and functional clinical information, there are evident disparities in the imaging content across modalities. Inter- and intra-modality affine and non-rigid image registration is an essential medical image analysis process in clinical imaging, as for example before imaging biomarkers need to be derived and clinically evaluated across different MRI modalities, time phases and slices. Although commonly needed in real clinical scenarios, affine and non-rigid image registration is not extensively investigated using a single unsupervised model architecture. In our work, we present an un-supervised deep learning registration methodology which can accurately model affine and non-rigid trans-formations, simultaneously. Moreover, inverse-consistency is a fundamental inter-modality registration property that is not considered in deep learning registration algorithms. To address inverse-consistency, our methodology performs bi-directional cross-modality image synthesis to learn modality-invariant latent rep-resentations, while involves two factorised transformation networks and an inverse-consistency loss to learn topology-preserving anatomical transformations. Overall, our model (named "FIRE") shows improved performances against the reference standard baseline method on multi-modality brain 2D and 3D MRI and intra-modality cardiac 4D MRI data experiments.

eess.IV↗
arXiv2022

DualSC: Automatic Generation and Summarization of Shellcode via Transformer and Dual Learning

A shellcode is a small piece of code and it is executed to exploit a software vulnerability, which allows the target computer to execute arbitrary commands from the attacker through a code injection attack. Similar to the purpose of automated vulnerability generation techniques, the automated generation of shellcode can generate attack instructions, which can be used to detect vulnerabilities and implement defensive measures. While the automated summarization of shellcode can help users unfamiliar with shellcode and network information security understand the intent of shellcode attacks. In this study, we propose a novel approach DualSC to solve the automatic shellcode generation and summarization tasks. Specifically, we formalize automatic shellcode generation and summarization as dual tasks, use a shallow Transformer for model construction, and design a normalization method Adjust QKNorm to adapt these low-resource tasks (i.e., insufficient training data). Finally, to alleviate the out-of-vocabulary problem, we propose a rulebased repair component to improve the performance of automatic shellcode generation. In our empirical study, we select a highquality corpus Shellcode IA32 as our empirical subject. This corpus was gathered from two real-world projects based on the line-by-line granularity. We first compare DualSC with six state-of-the-art baselines from the code generation and code summarization domains in terms of four performance measures. The comparison results show the competitiveness of DualSC. Then, we verify the effectiveness of the component setting in DualSC. Finally, we conduct a human study to further verify the effectiveness of DualSC.

cs.SE↗
arXiv2022

SOTitle: A Transformer-based Post Title Generation Approach for Stack Overflow

On Stack Overflow, developers can not only browse question posts to solve their programming problems but also gain expertise from the question posts to help improve their programming skills. Therefore, improving the quality of question posts in Stack Overflow has attracted the wide attention of researchers. A concise and precise title can play an important role in helping developers understand the key information of the question post, which can improve the post quality. However, the quality of the generated title is not high due to the lack of professional knowledge related to their questions or the poor presentation ability of developers. A previous study aimed to automatically generate the title by analyzing the code snippets in the question post. However, this study ignored the useful information in the corresponding problem description. Therefore, we propose an approach SOTitle for automatic post title generation by leveraging the code snippets and the problem description in the question post (i.e., the multi-modal input). SOTitle follows the Transformer structure, which can effectively capture long-term dependencies through a multi-head attention mechanism. To verify the effectiveness of SOTitle, we construct a large-scale high-quality corpus from Stack Overflow, which includes 1,168,257 high-quality question posts for four popular programming languages. Experimental results show that SOTitle can significantly outperform six state-of-the-art baselines in both automatic evaluation and human evaluation. To encourage follow-up studies, we make our corpus and approach publicly available

cs.SE↗
arXiv2022

DocBed: A Multi-Stage OCR Solution for Documents with Complex Layouts

Digitization of newspapers is of interest for many reasons including preservation of history, accessibility and search ability, etc. While digitization of documents such as scientific articles and magazines is prevalent in literature, one of the main challenges for digitization of newspaper lies in its complex layout (e.g. articles spanning multiple columns, text interrupted by images) analysis, which is necessary to preserve human read-order. This work provides a major breakthrough in the digitization of newspapers on three fronts: first, releasing a dataset of 3000 fully-annotated, real-world newspaper images from 21 different U.S. states representing an extensive variety of complex layouts for document layout analysis; second, proposing layout segmentation as a precursor to existing optical character recognition (OCR) engines, where multiple state-of-the-art image segmentation models and several post-processing methods are explored for document layout segmentation; third, providing a thorough and structured evaluation protocol for isolated layout segmentation and end-to-end OCR.

cs.CV↗
arXiv2022

A Version of Hörmander's Theorem for Markovian Rough Paths

We consider a rough differential equation of the form \(dY_t=\sum_i V_i(Y_t)d\boldsymbol{X}^i_t+V_0(Y_t)dt \), where \(\boldsymbol{X}_t \) is a Markovian rough path. We demonstrate that if the vector fields \((V_i)_{0\leq i\leq d} \) satisfy Hörmander's bracket generating condition, then \(Y_t\) admits a smooth density with a Gaussian type upper bound, given that the generator of \(X_t\) satisfy certain non-degenerate conditions. The main new ingredient of this paper is the study of non-degenerate property of the Jacobian process of \(X_t\).

math.PR↗
arXiv2022

AI-based Medical e-Diagnosis for Fast and Automatic Ventricular Volume Measurement in the Patients with Normal Pressure Hydrocephalus

Based on CT and MRI images acquired from normal pressure hydrocephalus (NPH) patients, using machine learning methods, we aim to establish a multi-modal and high-performance automatic ventricle segmentation method to achieve efficient and accurate automatic measurement of the ventricular volume. First, we extract the brain CT and MRI images of 143 definite NPH patients. Second, we manually label the ventricular volume (VV) and intracranial volume (ICV). Then, we use machine learning method to extract features and establish automatic ventricle segmentation model. Finally, we verify the reliability of the model and achieved automatic measurement of VV and ICV. In CT images, the Dice similarity coefficient (DSC), Intraclass Correlation Coefficient (ICC), Pearson correlation, and Bland-Altman analysis of the automatic and manual segmentation result of the VV were 0.95, 0.99, 0.99, and 4.2$\pm$2.6 respectively. The results of ICV were 0.96, 0.99, 0.99, and 6.0$\pm$3.8 respectively. The whole process takes 3.4$\pm$0.3 seconds. In MRI images, the DSC, ICC, Pearson correlation, and Bland-Altman analysis of the automatic and manual segmentation result of the VV were 0.94, 0.99, 0.99, and 2.0$\pm$0.6 respectively. The results of ICV were 0.93, 0.99, 0.99, and 7.9$\pm$3.8 respectively. The whole process took 1.9$\pm$0.1 seconds. We have established a multi-modal and high-performance automatic ventricle segmentation method to achieve efficient and accurate automatic measurement of the ventricular volume of NPH patients. This can help clinicians quickly and accurately understand the situation of NPH patient's ventricles.

physics.med-ph↗
arXiv2022

Online Attentive Kernel-Based Temporal Difference Learning

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks.

cs.LG↗
arXiv2022

Data Harmonisation for Information Fusion in Digital Healthcare: A State-of-the-Art Systematic Review, Meta-Analysis and Future Research Directions

Removing the bias and variance of multicentre data has always been a challenge in large scale digital healthcare studies, which requires the ability to integrate clinical features extracted from data acquired by different scanners and protocols to improve stability and robustness. Previous studies have described various computational approaches to fuse single modality multicentre datasets. However, these surveys rarely focused on evaluation metrics and lacked a checklist for computational data harmonisation studies. In this systematic review, we summarise the computational data harmonisation approaches for multi-modality data in the digital healthcare field, including harmonisation strategies and evaluation metrics based on different theories. In addition, a comprehensive checklist that summarises common practices for data harmonisation studies is proposed to guide researchers to report their research findings more effectively. Last but not least, flowcharts presenting possible ways for methodology and metric selection are proposed and the limitations of different methods have been surveyed for future research.

cs.AI↗
arXiv2022

Fitting AGN/galaxy X-ray-to-radio SEDs with CIGALE and improvement of the code

Modern and future surveys effectively provide a panchromatic view for large numbers of extragalactic objects. Consistently modeling these multiwavelength survey data is a critical but challenging task for extragalactic studies. The Code Investigating GALaxy Emission (CIGALE) is an efficient PYTHON code for spectral energy distribution (SED) fitting of galaxies and active galactic nuclei (AGNs). Recently, a major extension of CIGALE (named X-CIGALE) has been developed to account for AGN/galaxy X-ray emission and improve AGN modeling at UV-to-IR wavelengths. Here, we apply X-CIGALE to different samples, including COSMOS spectroscopic type 2 AGNs, CDF-S X-ray detected normal galaxies, SDSS quasars, and COSMOS radio objects. From these tests, we identify several weaknesses of X-CIGALE and improve the code accordingly. These improvements are mainly related to AGN intrinsic X-ray anisotropy, X-ray binary emission, AGN accretion-disk SED shape, and AGN radio emission. These updates improve the fit quality and allow new interpretation of the results, based on which we discuss physical implications. For example, we find that AGN intrinsic X-ray anisotropy is moderate, and can be modeled as $L_X(θ) \propto 1+\cos θ$, where $θ$ is the viewing angle measured from the AGN axis. We merge the new code into the major branch of CIGALE, and publicly release this new version as CIGALE v2022.0 on https://cigale.lam.fr

astro-ph.GA↗
arXiv2021

Light dark bosons in the JUNO-TAO neutrino detector

This work presents a sensitivity study of a reactor liquid scintillator detector to three kinds of dark bosons with masses below 1 MeV, such as dark photons, axion-like particles and light scalar bosons. The JUNO-TAO detector with Taishan nuclear reactor is taken as a reference. With proposed 180 days data taking, the sensitivity to the dark bosons can reach $\sim10^{-5}$ 95%C.L. for the optimized signal to background ratio for the electron coupling constant $\it{g_X} $ through inverse Compton-like scattering. Similar calculations are completed for axion-like particles and scalar bosons. The background systematic uncertainty presents as the main limiting factor for the further sensitivity improvement. Several remarks are made to the controversial analysis for the NEOS experiment. Additionally the differential and the inverse differential cross sections have been derived for all three boson types and their interactions with electrons in liquid scintillator.

hep-ex↗
arXiv2021

AI-based Reconstruction for Fast MRI -- A Systematic Review and Meta-analysis

Compressed sensing (CS) has been playing a key role in accelerating the magnetic resonance imaging (MRI) acquisition process. With the resurgence of artificial intelligence, deep neural networks and CS algorithms are being integrated to redefine the state of the art of fast MRI. The past several years have witnessed substantial growth in the complexity, diversity, and performance of deep learning-based CS techniques that are dedicated to fast MRI. In this meta-analysis, we systematically review the deep learning-based CS techniques for fast MRI, describe key model designs, highlight breakthroughs, and discuss promising directions. We have also introduced a comprehensive analysis framework and a classification system to assess the pivotal role of deep learning in CS-based acceleration for MRI.

eess.IV↗
arXiv2021

GUX-Analyzer: A Deep Multi-modal Analyzer Via Motivational Flow For Game User Experience

Quantitative analysis of Game User eXperience (GUX) is important to the game industry. Different from the typical questionnaire analysis, this paper focuses on the computational analysis of GUX. We aim to analyze the relationship between game and players using the multi-modal data including physiological data and game process data. We theoretically extend the Flow model from the classic skill-and-challenge plane by expanding new dimension on motivation, which is the result of the multi-modal data analysis on affect, and physiological data. We call this 3D Flow as Motivational Flow, MovFlow. Meanwhile, we implement a quantitative GUX Analysis System (GUXAS), which can predict the player's in-game experience state by only using game process data. It analyzes the correlation among not only in-game state, but the player's psychological-and-physiological reaction in the entire interactive game-play process. The experiments demonstrated our MovFlow model efficiently distinguished the users' in-game experience states from the perspective of GUX.

cs.HC↗
arXiv2021

Anomalous Josephson Effect in Topological Insulator-Based Josephson Trijunction

We studied anomalous Josephson effect (AJE) in Josephson trijunctions fabricated on Bi$_2$Se$_3$, and found that the AJE in T-shaped trijunctions significantly alters the Majorana phase diagram of the trijunctions, when an in-plane magnetic field is applied parallel to two of the three single junctions. Such a phenomenon in topological insulator-based Josephson trijunction provides unambiguous evidence for the existence of AJE in the system, and might provide an additional knob for controlling the Majorana bound states in the Fu-Kane scheme of topological quantum computation.

cond-mat.supr-con↗
arXiv2021

Edge-Enhanced Dual Discriminator Generative Adversarial Network for Fast MRI with Parallel Imaging Using Multi-view Information

In clinical medicine, magnetic resonance imaging (MRI) is one of the most important tools for diagnosis, triage, prognosis, and treatment planning. However, MRI suffers from an inherent slow data acquisition process because data is collected sequentially in k-space. In recent years, most MRI reconstruction methods proposed in the literature focus on holistic image reconstruction rather than enhancing the edge information. This work steps aside this general trend by elaborating on the enhancement of edge information. Specifically, we introduce a novel parallel imaging coupled dual discriminator generative adversarial network (PIDD-GAN) for fast multi-channel MRI reconstruction by incorporating multi-view information. The dual discriminator design aims to improve the edge information in MRI reconstruction. One discriminator is used for holistic image reconstruction, whereas the other one is responsible for enhancing edge information. An improved U-Net with local and global residual learning is proposed for the generator. Frequency channel attention blocks (FCA Blocks) are embedded in the generator for incorporating attention mechanisms. Content loss is introduced to train the generator for better reconstruction quality. We performed comprehensive experiments on Calgary-Campinas public brain MR dataset and compared our method with state-of-the-art MRI reconstruction methods. Ablation studies of residual learning were conducted on the MICCAI13 dataset to validate the proposed modules. Results show that our PIDD-GAN provides high-quality reconstructed MR images, with well-preserved edge information. The time of single-image reconstruction is below 5ms, which meets the demand of faster processing.

eess.IV↗
arXiv2021

Robust Weakly Supervised Learning for COVID-19 Recognition Using Multi-Center CT Images

The world is currently experiencing an ongoing pandemic of an infectious disease named coronavirus disease 2019 (i.e., COVID-19), which is caused by the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Computed Tomography (CT) plays an important role in assessing the severity of the infection and can also be used to identify those symptomatic and asymptomatic COVID-19 carriers. With a surge of the cumulative number of COVID-19 patients, radiologists are increasingly stressed to examine the CT scans manually. Therefore, an automated 3D CT scan recognition tool is highly in demand since the manual analysis is time-consuming for radiologists and their fatigue can cause possible misjudgment. However, due to various technical specifications of CT scanners located in different hospitals, the appearance of CT images can be significantly different leading to the failure of many automated image recognition approaches. The multi-domain shift problem for the multi-center and multi-scanner studies is therefore nontrivial that is also crucial for a dependable recognition and critical for reproducible and objective diagnosis and prognosis. In this paper, we proposed a COVID-19 CT scan recognition model namely coronavirus information fusion and diagnosis network (CIFD-Net) that can efficiently handle the multi-domain shift problem via a new robust weakly supervised learning paradigm. Our model can resolve the problem of different appearance in CT scan images reliably and efficiently while attaining higher accuracy compared to other state-of-the-art methods.

eess.IV↗
arXiv2021

Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams

In a $k$-party communication problem, the $k$ players with inputs $x_1, x_2, \ldots, x_k$, respectively, want to evaluate a function $f(x_1, x_2, \ldots, x_k)$ using as little communication as possible. We consider the message-passing model, in which the inputs are partitioned in an arbitrary, possibly worst-case manner, among a smaller number $t$ of players ($t<k$). The $t$-player communication cost of computing $f$ can only be smaller than the $k$-player communication cost, since the $t$ players can trivially simulate the $k$-player protocol. But how much smaller can it be? We study deterministic and randomized protocols in the one-way model, and provide separations for product input distributions, which are optimal for low error probability protocols. We also provide much stronger separations when the input distribution is non-product. A key application of our results is in proving lower bounds for data stream algorithms. In particular, we give an optimal $Ω(ε^{-2}\log(N) \log \log(mM))$ bits of space lower bound for the fundamental problem of $(1\pmε)$-approximating the number $\|x\|_0$ of non-zero entries of an $n$-dimensional vector $x$ after $m$ integer updates each of magnitude at most $M$, and with success probability $\ge 2/3$, in a strict turnstile stream. We additionally prove the matching $Ω(ε^{-2}\log(N) \log \log(T))$ space lower bound for the problem when we have access to a heavy hitters oracle with threshold $T$. Our results match the best known upper bounds when $ε\ge 1/\operatorname{polylog}(mM)$ and when $T = 2^{\operatorname{poly}(1/ε)}$ respectively. It also improves on the prior $Ω(ε^{-2}\log(mM) )$ lower bound and separates the complexity of approximating $L_0$ from approximating the $p$-norm $L_p$ for $p$ bounded away from $0$, since the latter has an $O(ε^{-2}\log (mM))$ bit upper bound.

cs.CC↗
arXiv2021

The viewing angle in AGN SED models, a data-driven analysis

The validity of the unified active galactic nuclei (AGN) model has been challenged in the last decade, especially when different types of AGNs are considered to only differ in the viewing angle to the torus. We aim to assess the importance of the viewing angle in classifying different types of Seyfert galaxies in spectral energy distribution (SED) modelling. We retrieve photometric data from publicly available astronomical databases: CDS and NED, to model SEDs with X-CIGALE in a sample of 13 173 Seyfert galaxies located at redshift range from $z=0$ to $z=3.5$, with a median redshift of $z\approx0.2$. We assess whether the estimated viewing angle from the SED models reflects different Seyfert classifications. Two AGN models with either a smooth or clumpy torus structure are adopted in this paper. We find that the viewing angle in Type-1 AGNs is better constrained than in Type-2 AGNs. Limiting the viewing angles representing these two types of AGNs do not affect the physical parameter estimates such as star-formation rate (SFR) or AGN fractional contribution ($f_{\rm{AGN}}$). In addition, the viewing angle is not the most discriminating physical parameter to differentiate Seyfert types. We suggest that the observed and intrinsic AGN disc luminosity can: i) be used in $z<0.5$ studies to distinguish between Type-1 and Type-2 AGNs, and ii) explain the probable evolutionary path between these AGN types. Finally, we propose the use of X-CIGALE for AGN galaxy classification tasks. All data from the 13 173 SED fits are available at https://doi.org/10.5281/zenodo.5221764

astro-ph.GA↗