arXiv subjects

Jia Guo

Publications and source records attributed to Jia Guo.

At least 109 records · Page 6Linked to original sources

arXiv2022

Multi-task Deep Learning for Cerebrovascular Disease Classification and MRI-to-PET Translation

Accurate quantification of cerebral blood flow (CBF) is essential for the diagnosis and assessment of cerebrovascular diseases such as Moyamoya, carotid stenosis, aneurysms, and stroke. Positron emission tomography (PET) is currently regarded as the gold standard for the measurement of CBF in the human brain. PET imaging, however, is not widely available because of its prohibitive costs, use of ionizing radiation, and logistical challenges, which require a co-localized cyclotron to deliver the 2 min half-life Oxygen-15 radioisotope. Magnetic resonance imaging (MRI), in contrast, is more readily available and does not involve ionizing radiation. In this study, we propose a multi-task learning framework for brain MRI-to-PET translation and disease diagnosis. The proposed framework comprises two prime networks: (1) an attention-based 3D encoder-decoder convolutional neural network (CNN) that synthesizes high-quality PET CBF maps from multi-contrast MRI images, and (2) a multi-scale 3D CNN that identifies the brain disease corresponding to the input MRI images. Our multi-task framework yields promising results on the task of MRI-to-PET translation, achieving an average structural similarity index (SSIM) of 0.94 and peak signal-to-noise ratio (PSNR) of 38dB on a cohort of 120 subjects. In addition, we show that integrating multiple MRI modalities can improve the clinical diagnosis of brain diseases.

eess.IV↗

arXiv2022

Physical realization of topological Roman surface by spin-induced ferroelectric polarization in cubic lattice

Topology, a mathematical concept in geometry, has become an ideal theoretical tool for describing topological states and phase transitions. Many topological concepts have found their physical entities in real or reciprocal spaces identified by topological/geometrical invariants, which are usually defined on orientable surfaces such as torus and sphere. It is natural to quest whether it is possible to find the physical realization of more intriguing non-orientable surfaces. Herein, we show that the set of spin-induced ferroelectric polarizations in cubic perovskite oxides AMn3Cr4O12 (A = La and Tb) resides on the topological Roman surface, a non-orientable two-dimensional manifold formed by sewing a Mobius strip edge to that of a disc. The induced polarization may travel in a loop along the non-orientable Mobius strip or orientable disc depending on how the spin evolves as controlled by external magnetic field. Experimentally, the periodicity of polarization can be the same or the twice of the rotating magnetic field, being well consistent with the orientability of disc and Mobius strip, respectively. This path dependent topological magnetoelectric effect presents a way to detect the global geometry of the surface and deepens our understanding of topology in both mathematics and physics

cond-mat.str-el↗

arXiv2021

Monolithic integration of 940 nm AlGaAs distributed Bragg reflectors on bulk Ge substrates

High quality 940 nm Al$_x$Ga$_{1-x}$As n-type distributed Bragg reflectors (DBRs) were successfully monolithically grown on off-cut Ge (100) substrates. The Ge-DBRs have reflectivity spectra comparable to those grown on conventional bulk GaAs substrates and have smooth morphology, reasonable periodicity and uniformity. These results strongly support VCSEL growth and fabrication on more scalable bulk Ge substrates for large scale production of AlGaAs-based VCSELs.

cond-mat.mtrl-sci↗

arXiv2021

BiQUE: Biquaternionic Embeddings of Knowledge Graphs

Knowledge graph embeddings (KGEs) compactly encode multi-relational knowledge graphs (KGs). Existing KGE models rely on geometric operations to model relational patterns. Euclidean (circular) rotation is useful for modeling patterns such as symmetry, but cannot represent hierarchical semantics. In contrast, hyperbolic models are effective at modeling hierarchical relations, but do not perform as well on patterns on which circular rotation excels. It is crucial for KGE models to unify multiple geometric transformations so as to fully cover the multifarious relations in KGs. To do so, we propose BiQUE, a novel model that employs biquaternions to integrate multiple geometric transformations, viz., scaling, translation, Euclidean rotation, and hyperbolic rotation. BiQUE makes the best trade-offs among geometric operators during training, picking the best one (or their best combination) for each relation. Experiments on five datasets show BiQUE's effectiveness.

cs.CL↗

arXiv2021

Masked Face Recognition Challenge: The InsightFace Track Report

During the COVID-19 coronavirus epidemic, almost everyone wears a facial mask, which poses a huge challenge to deep face recognition. In this workshop, we organize Masked Face Recognition (MFR) challenge and focus on bench-marking deep face recognition methods under the existence of facial masks. In the MFR challenge, there are two main tracks: the InsightFace track and the WebFace260M track. For the InsightFace track, we manually collect a large-scale masked face test set with 7K identities. In addition, we also collect a children test set including 14K identities and a multi-racial test set containing 242K identities. By using these three test sets, we build up an online model testing system, which can give a comprehensive evaluation of face recognition models. To avoid data privacy problems, no test image is released to the public. As the challenge is still under-going, we will keep on updating the top-ranked solutions as well as this report on the arxiv.

cs.CV↗

arXiv2021

Masked Face Recognition Challenge: The WebFace260M Track Report

According to WHO statistics, there are more than 204,617,027 confirmed COVID-19 cases including 4,323,247 deaths worldwide till August 12, 2021. During the coronavirus epidemic, almost everyone wears a facial mask. Traditionally, face recognition approaches process mostly non-occluded faces, which include primary facial features such as the eyes, nose, and mouth. Removing the mask for authentication in airports or laboratories will increase the risk of virus infection, posing a huge challenge to current face recognition systems. Due to the sudden outbreak of the epidemic, there are yet no publicly available real-world masked face recognition (MFR) benchmark. To cope with the above-mentioned issue, we organize the Face Bio-metrics under COVID Workshop and Masked Face Recognition Challenge in ICCV 2021. Enabled by the ultra-large-scale WebFace260M benchmark and the Face Recognition Under Inference Time conStraint (FRUITS) protocol, this challenge (WebFace260M Track) aims to push the frontiers of practical MFR. Since public evaluation sets are mostly saturated or contain noise, a new test set is gathered consisting of elaborated 2,478 celebrities and 60,926 faces. Meanwhile, we collect the world-largest real-world masked test set. In the first phase of WebFace260M Track, 69 teams (total 833 solutions) participate in the challenge and 49 teams exceed the performance of our baseline. There are second phase of the challenge till October 1, 2021 and on-going leaderboard. We will actively update this report in the future.

cs.CV↗

arXiv2021

Disorder Detection with Costly Observations

We study the Wiener disorder detection problem where each observation is associated with a positive cost. In this setting, a strategy is a pair consisting of a sequence of observation times and a stopping time corresponding to the declaration of disorder. We characterize the minimal cost of the disorder problem with costly observations as the unique fix-point of a certain jump operator, and we determine the optimal strategy.

math.PR↗

arXiv2021

Recursive Refinement Network for Deformable Lung Registration between Exhale and Inhale CT Scans

Unsupervised learning-based medical image registration approaches have witnessed rapid development in recent years. We propose to revisit a commonly ignored while simple and well-established principle: recursive refinement of deformation vector fields across scales. We introduce a recursive refinement network (RRN) for unsupervised medical image registration, to extract multi-scale features, construct normalized local cost correlation volume and recursively refine volumetric deformation vector fields. RRN achieves state of the art performance for 3D registration of expiratory-inspiratory pairs of CT lung scans. On DirLab COPDGene dataset, RRN returns an average Target Registration Error (TRE) of 0.83 mm, which corresponds to a 13% error reduction from the best result presented in the leaderboard. In addition to comparison with conventional methods, RRN leads to 89% error reduction compared to deep-learning-based peer approaches.

eess.IV↗

arXiv2021

PTNet: A High-Resolution Infant MRI Synthesizer Based on Transformer

Magnetic resonance imaging (MRI) noninvasively provides critical information about how human brain structures develop across stages of life. Developmental scientists are particularly interested in the first few years of neurodevelopment. Despite the success of MRI collection and analysis for adults, it is a challenge for researchers to collect high-quality multimodal MRIs from developing infants mainly because of their irregular sleep pattern, limited attention, inability to follow instructions to stay still, and a lack of analysis approaches. These challenges often lead to a significant reduction of usable data. To address this issue, researchers have explored various solutions to replace corrupted scans through synthesizing realistic MRIs. Among them, the convolution neural network (CNN) based generative adversarial network has demonstrated promising results and achieves state-of-the-art performance. However, adversarial training is unstable and may need careful tuning of regularization terms to stabilize the training. In this study, we introduced a novel MRI synthesis framework - Pyramid Transformer Net (PTNet). PTNet consists of transformer layers, skip-connections, and multi-scale pyramid representation. Compared with the most widely used CNN-based conditional GAN models (namely pix2pix and pix2pixHD), our model PTNet shows superior performance in terms of synthesis accuracy and model size. Notably, PTNet does not require any type of adversarial training and can be easily trained using the simple mean squared error loss.

eess.IV↗

arXiv2021

Deep Learning Identifies Neuroimaging Signatures of Alzheimer's Disease Using Structural and Synthesized Functional MRI Data

Current neuroimaging techniques provide paths to investigate the structure and function of the brain in vivo and have made great advances in understanding Alzheimer's disease (AD). However, the group-level analyses prevalently used for investigation and understanding of the disease are not applicable for diagnosis of individuals. More recently, deep learning, which can efficiently analyze large-scale complex patterns in 3D brain images, has helped pave the way for computer-aided individual diagnosis by providing accurate and automated disease classification. Great progress has been made in classifying AD with deep learning models developed upon increasingly available structural MRI data. The lack of scale-matched functional neuroimaging data prevents such models from being further improved by observing functional changes in pathophysiology. Here we propose a potential solution by first learning a structural-to-functional transformation in brain MRI, and further synthesizing spatially matched functional images from large-scale structural scans. We evaluated our approach by building computational models to discriminate patients with AD from healthy normal subjects and demonstrated a performance boost after combining the structural and synthesized functional brain images into the same model. Furthermore, our regional analyses identified the temporal lobe to be the most predictive structural-region and the parieto-occipital lobe to be the most predictive functional-region of our model, which are both in concordance with previous group-level neuroimaging findings. Together, we demonstrate the potential of deep learning with large-scale structural and synthesized functional MRI to impact AD classification and to identify AD's neuroimaging signatures.

q-bio.QM↗

arXiv2021

Sample and Computation Redistribution for Efficient Face Detection

Although tremendous strides have been made in uncontrolled face detection, efficient face detection with a low computation cost as well as high precision remains an open challenge. In this paper, we point out that training data sampling and computation distribution strategies are the keys to efficient and accurate face detection. Motivated by these observations, we introduce two simple but effective methods (1) Sample Redistribution (SR), which augments training samples for the most needed stages, based on the statistics of benchmark datasets; and (2) Computation Redistribution (CR), which reallocates the computation between the backbone, neck and head of the model, based on a meticulously defined search methodology. Extensive experiments conducted on WIDER FACE demonstrate the state-of-the-art efficiency-accuracy trade-off for the proposed \scrfd family across a wide range of compute regimes. In particular, \scrfdf{34} outperforms the best competitor, TinaFace, by $3.86\%$ (AP at hard set) while being more than \emph{3$\times$ faster} on GPUs with VGA-resolution images. We also release our code to facilitate future research.

cs.CV↗

arXiv2021

Strictly Decentralized Adaptive Estimation of External Fields using Reproducing Kernels

This paper describes an adaptive method in continuous time for the estimation of external fields by a team of $N$ agents. The agents $i$ each explore subdomains $Ω^i$ of a bounded subset of interest $Ω\subset X := \mathbb{R}^d$. Ideal adaptive estimates $\hat{g}^i_t$ are derived for each agent from a distributed parameter system (DPS) that takes values in the scalar-valued reproducing kernel Hilbert space $H_X$ of functions over $X$. Approximations of the evolution of the ideal local estimate $\hat{g}^i_t$ of agent $i$ is constructed solely using observations made by agent $i$ on a fine time scale. Since the local estimates on the fine time scale are constructed independently for each agent, we say that the method is strictly decentralized. On a coarse time scale, the individual local estimates $\hat{g}^i_t$ are fused via the expression $\hat{g}_t:=\sum_{i=1}^NΨ^i \hat{g}^i_t$ that uses a partition of unity $\{Ψ^i\}_{1\leq i\leq N}$ subordinate to the cover $\{Ω^i\}_{i=1,\ldots,N}$ of $Ω$. Realizable algorithms are obtained by constructing finite dimensional approximations of the DPS in terms of scattered bases defined by each agent from samples along their trajectories. Rates of convergence of the error in the finite dimensional approximations are derived in terms of the fill distance of the samples that define the scattered centers in each subdomain. The qualitative performance of the convergence rates for the decentralized estimation method is illustrated via numerical simulations.

eess.SY↗

arXiv2021

Automatic Analysis System of Calcaneus Radiograph: Rotation-Invariant Landmark Detection for Calcaneal Angle Measurement, Fracture Identification and Fracture Region Segmentation

Calcaneus is the largest tarsal bone to withstand the daily stresses of weight-bearing. The calcaneal fracture is the most common type in the tarsal bone fractures. After a fracture is suspected, plain radiographs should be taken first. Bohler's Angle (BA) and Critical Angle of Gissane (CAG), measured by four anatomic landmarks in lateral foot radiograph, can guide fracture diagnosis and facilitate operative recovery of the fractured calcaneus. This study aims to develop an analysis system that can automatically locate four anatomic landmarks, measure BA and CAG for fracture assessment, identify fractured calcaneus, and segment fractured regions. For landmark detection, we proposed a coarse-to-fine Rotation-Invariant Regression-Voting (RIRV) landmark detection method based on regressive Multi-Layer Perceptron (MLP) and Scale Invariant Feature Transform (SIFT) patch descriptor, which solves the problem of fickle rotation of calcaneus. By implementing a novel normalization approach, the RIRV method is explicitly rotation-invariance comparing with traditional regressive methods. For fracture identification and segmentation, a convolution neural network (CNN) based on U-Net with auxiliary classification head (U-Net-CH) is designed. The input ROIs of the CNN are normalized by detected landmarks to uniform view, orientation, and scale. The advantage of this approach is the multi-task learning that combines classification and segmentation. Our system can accurately measure BA and CAG with a mean angle error of 3.8 and 6.2 respectively. For fracture identification and fracture region segmentation, our system presents good performance with an F1-score of 96.55%, recall of 94.99%, and segmentation IoU-score of 0.586.

eess.IV↗

arXiv2021

Partial Persistence of Excitation in RKHS Embedded Adaptive Estimation

In this paper, an adaptive non-parametric method is proposed to estimate the scalar-valued nonlinear function that appears in uncertain systems governed by ordinary differential equations (ODEs). By employing an infinite-dimensional reproducing kernel Hilbert space (RKHS) as the hypothesis space, the nonlinear estimation problem in finite-dimensional Euclidean space is recast into that of constructing a linear observer in the infinite-dimensional RKHS. The analysis of convergence is facilitated by the introduction of a novel condition of partial persistent excitation (partial PE), which is defined for a subspace of the RKHS. Using this condition, we prove that the projection of the function estimation error onto the PE subspace converges in norm asymptotically to zero. While this is an abstract notion of convergence that depends implicitly on the kernel used to define the RKHS, we derive conditions that ensure the pointwise convergence of the function estimates over the PE subset. This paper additionally introduces a weaker but geometrically intuitive notion of a partial PE condition, one that resembles PE conditions as they have been formulated historically in Euclidean spaces. Sufficient conditions are derived that describe when the two conditions are equivalent. Finally, qualitative properties of the convergence proofs derived in the paper are illustrated with numerical simulations.

math.OC↗

arXiv2021

Evolutionary Trigger Set Generation for DNN Black-Box Watermarking

The commercialization of deep learning creates a compelling need for intellectual property (IP) protection. Deep neural network (DNN) watermarking has been proposed as a promising tool to help model owners prove ownership and fight piracy. A popular approach of watermarking is to train a DNN to recognize images with certain \textit{trigger} patterns. In this paper, we propose a novel evolutionary algorithm-based method to generate and optimize trigger patterns. Our method brings a siginificant reduction in false positive rates, leading to compelling proof of ownership. At the same time, it maintains the robustness of the watermark against attacks. We compare our method with the prior art and demonstrate its effectiveness on popular models and datasets.

cs.LG↗

arXiv2021

MusiCoder: A Universal Music-Acoustic Encoder Based on Transformers

Music annotation has always been one of the critical topics in the field of Music Information Retrieval (MIR). Traditional models use supervised learning for music annotation tasks. However, as supervised machine learning approaches increase in complexity, the increasing need for more annotated training data can often not be matched with available data. In this paper, a new self-supervised music acoustic representation learning approach named MusiCoder is proposed. Inspired by the success of BERT, MusiCoder builds upon the architecture of self-attention bidirectional transformers. Two pre-training objectives, including Contiguous Frames Masking (CFM) and Contiguous Channels Masking (CCM), are designed to adapt BERT-like masked reconstruction pre-training to continuous acoustic frame domain. The performance of MusiCoder is evaluated in two downstream music annotation tasks. The results show that MusiCoder outperforms the state-of-the-art models in both music genre classification and auto-tagging tasks. The effectiveness of MusiCoder indicates a great potential of a new self-supervised learning approach to understand music: first apply masked reconstruction tasks to pre-train a transformer-based model with massive unlabeled music acoustic data, and then finetune the model on specific downstream tasks with labeled data.

eess.AS↗

arXiv2021

Reducing the Teacher-Student Gap via Spherical Knowledge Disitllation

Knowledge distillation aims at obtaining a compact and effective model by learning the mapping function from a much larger one. Due to the limited capacity of the student, the student would underfit the teacher. Therefore, student performance would unexpectedly drop when distilling from an oversized teacher, termed the capacity gap problem. We investigate this problem by study the gap of confidence between teacher and student. We find that the magnitude of confidence is not necessary for knowledge distillation and could harm the student performance if the student are forced to learn confidence. We propose Spherical Knowledge Distillation to eliminate this gap explicitly, which eases the underfitting problem. We find this novel knowledge representation can improve compact models with much larger teachers and is robust to temperature. We conducted experiments on both CIFAR100 and ImageNet, and achieve significant improvement. Specifically, we train ResNet18 to 73.0 accuracy, which is a substantial improvement over previous SOTA and is on par with resnet34 almost twice the student size. The implementation has been shared at https://github.com/forjiuzhou/Spherical-Knowledge-Distillation.

cs.LG↗

arXiv2020

Matching preclusion and strong matching preclusion of the bubble-sort star graphs

Since a plurality of processors in a distributed computer system working in parallel, to ensure the fault tolerance and stability of the network is an important issue in distributed systems. As the topology of the distributed network can be modeled as a graph, the (strong) matching preclusion in graph theory can be used as a robustness measure for missing edges in parallel and distributed networks, which is defined as the minimum number of (vertices and) edges whose deletion results in the remaining network that has neither a perfect matching nor an almost-perfect matching. The bubble-sort star graph is one of the validly discussed interconnection networks related to the distributed systems. In this paper, we show that the strong matching preclusion number of an $n$-dimensional bubble-sort star graph $BS_n$ is $2$ for $n\geq3$ and each optimal strong matching preclusion set of $BS_n$ is a set of two vertices from the same bipartition set. Moreover, we show that the matching preclusion number of $BS_n$ is $2n-3$ for $n\geq3$ and that every optimal matching preclusion set of $BS_n$ is trivial.

math.CO↗