Searcharxiv⌕ Search

arXiv subjects

Jun Zhou

Publications and source records attributed to Jun Zhou.

At least 433 records · Page 24Linked to original sources

Information Bottleneck Constrained Latent Bidirectional Embedding for Zero-Shot Learning

Zero-shot learning (ZSL) aims to recognize novel classes by transferring semantic knowledge from seen classes to unseen classes. Though many ZSL methods rely on a direct mapping between the visual and the semantic space, the calibration deviation and hubness problem limit the generalization capability to unseen classes. Recently emerged generative ZSL methods generate unseen image features to transform ZSL into a supervised classification problem. However, most generative models still suffer from the seen-unseen bias problem as only seen data is used for training. To address these issues, we propose a novel bidirectional embedding based generative model with a tight visual-semantic coupling constraint. We learn a unified latent space that calibrates the embedded parametric distributions of both visual and semantic spaces. Since the embedding from high-dimensional visual features comprise much non-semantic information, the alignment of visual and semantic in latent space would inevitably been deviated. Therefore, we introduce information bottleneck (IB) constraint to ZSL for the first time to preserve essential attribute information during the mapping. Specifically, we utilize the uncertainty estimation and the wake-sleep procedure to alleviate the feature noises and improve model abstraction capability. In addition, our method can be easily extended to transductive ZSL setting by generating labels for unseen images. We then introduce a robust loss to solve this label noise problem. Extensive experimental results show that our method outperforms the state-of-the-art methods in different ZSL settings on most benchmark datasets. The code will be available at https://github.com/osierboy/IBZSL.

cs.CV↗

Cross-Domain Recommendation: Challenges, Progress, and Prospects

To address the long-standing data sparsity problem in recommender systems (RSs), cross-domain recommendation (CDR) has been proposed to leverage the relatively richer information from a richer domain to improve the recommendation performance in a sparser domain. Although CDR has been extensively studied in recent years, there is a lack of a systematic review of the existing CDR approaches. To fill this gap, in this paper, we provide a comprehensive review of existing CDR approaches, including challenges, research progress, and future directions. Specifically, we first summarize existing CDR approaches into four types, including single-target CDR, multi-domain recommendation, dual-target CDR, and multi-target CDR. We then present the definitions and challenges of these CDR approaches. Next, we propose a full-view categorization and new taxonomies on these approaches and report their research progress in detail. In the end, we share several promising research directions in CDR.

cs.IR↗

Phase diagram and superlattice structures of monolayer phosphorus carbide (P$_x$C$_{1-x}$)

Phase stability and properties of two-dimensional phosphorus carbide, P$_x$C$_{1-x}$, are investigated using the first-principles method in combination with cluster expansion and Monte Carlo simulation. Monolayer P$_x$C$_{1-x}$ is found to be a phase separating system which indicates difficulty in fabricating monolayer P$_x$C$_{1-x}$ or crystalline P$_x$C$_{1-x}$ thin films. Nevertheless, a bottom-up design approach is used to determine the stable structures of P$_x$C$_{1-x}$ of various compositions which turn out to be superlattices consisting of alternating carbon and phosphorus nanoribbons along the armchair direction. Results of first-principles calculations indicate that once these structures are produced, they are mechanically and thermodynamically stable. All the ordered structures are predicted to be semiconductors, with band gap ranging from 0.2 to 1.2 eV. In addition, the monolayer P$_x$C$_{1-x}$ are predicted to have high carrier mobility, and high optical absorption in the ultraviolet region which shows a red-shift as the P:C ratio increases. These properties make 2D P$_x$C$_{1-x}$ promising materials for applications in electronics and optoelectronics.

cond-mat.mtrl-sci↗

Room temperature ferromagnetism of monolayer chromium telluride with perpendicular magnetic anisotropy

The realization of long-range magnetic ordering in two-dimensional (2D) systems can potentially revolutionize next-generation information technology. Here, we report the successful fabrication of crystalline Cr3Te4 monolayers with room temperature ferromagnetism. Using molecular beam epitaxy, the growth of 2D Cr3Te4 films with monolayer thickness is demonstrated at low substrate temperatures (~100C), compatible with Si CMOS technology. X-ray magnetic circular dichroism measurements reveal a Curie temperature (Tc) of ~344 K for the Cr3Te4 monolayer with an out-of-plane magnetic easy axis, which decreases to ~240 K for the thicker film (~ 7 nm) with an in-plane easy axis. The enhancement of ferromagnetic coupling and the magnetic anisotropy transition is ascribed to interfacial effects, in particular the orbital overlap at the monolayer Cr3Te4/graphite interface, supported by density-functional theory calculations. This work sheds light on the low-temperature scalable growth of 2D nonlayered materials with room temperature ferromagnetism for new magnetic and spintronic devices.

cond-mat.mtrl-sci↗

Recent progress and challenges in magnetic tunnel junctions with 2D materials for spintronic applications

As Moore's law is gradually losing its effectiveness, developing alternative high-speed and low-energy-consuming information technology with post-silicon advanced materials is urgently needed. The successful application of tunneling magnetoresistance (TMR) in magnetic tunnel junctions (MTJs) has given rise to a tremendous economic impact on magnetic informatics, including MRAM, radio-frequency sensors, microwave generators and neuromorphic computing networks. The emergence of two-dimensional (2D) materials brings opportunities for MTJs based on 2D materials which have many attractive characters and advantages. Especially, the recently discovered intrinsic 2D ferromagnetic materials with high spin-polarization hold the promise for next-generation nanoscale MTJs. With the development of advanced 2D materials, many efforts on MTJs with 2D materials have been made both theoretically and experimentally. Various 2D materials, such as semi-metallic graphene, insulating h-BN, semiconducting MoS2, magnetic semiconducting CrI3, magnetic metallic Fe3GeTe2 and some other recently emerged 2D materials are discussed as the electrodes and/or central scattering materials of MTJs in this review. We discuss the fundamental and main issues facing MTJs, and review the current progress made with 2D MTJs, briefly comment on work with some specific 2D materials, and highlight how they address the current challenges in MTJs, and finally offer an outlook and perspective of 2D MTJs.

cond-mat.mtrl-sci↗

Tunable Rashba spin-orbit coupling and its interplay with multiorbital effect and magnetic ordering at oxide interfaces

The complex oxide heterostructures such as LaAlO3/SrTiO3 (LAO/STO) interface are paradigmatic platforms to explore emerging multi-degrees of freedom coupling and the associated exotic phenomena. In this study, we reveal the effects of multiorbital and magnetic ordering on Rashba spin-orbit coupling (SOC) at the LAO/STO (001) interface. Based on first-principles calculations, we show that the Rashba spin splitting near the conduction band edge can be tuned substantially by the interfacial insulator-metal transition due to the multiorbital effect of the lowest t_2g bands. We further unravel a competition between Rashba SOC and intrinsic magnetism, in which the Rashba SOC induced spin polarization is suppressed by the interfacial magnetic ordering. These results deepen our understanding of intricate electronic and magnetic reconstruction at the perovskite oxide interfaces and shed light on the engineering of oxide heterostructures for all-oxides-based spintronic devices.

cond-mat.mtrl-sci↗

STNet: Scale Tree Network with Multi-level Auxiliator for Crowd Counting

Crowd counting remains a challenging task because the presence of drastic scale variation, density inconsistency, and complex background can seriously degrade the counting accuracy. To battle the ingrained issue of accuracy degradation, we propose a novel and powerful network called Scale Tree Network (STNet) for accurate crowd counting. STNet consists of two key components: a Scale-Tree Diversity Enhancer and a Semi-supervised Multi-level Auxiliator. Specifically, the Diversity Enhancer is designed to enrich scale diversity, which alleviates limitations of existing methods caused by insufficient level of scales. A novel tree structure is adopted to hierarchically parse coarse-to-fine crowd regions. Furthermore, a simple yet effective Multi-level Auxiliator is presented to aid in exploiting generalisable shared characteristics at multiple levels, allowing more accurate pixel-wise background cognition. The overall STNet is trained in an end-to-end manner, without the needs for manually tuning loss weights between the main and the auxiliary tasks. Extensive experiments on four challenging crowd datasets demonstrate the superiority of the proposed method.

cs.CV↗

ArSMART: An Improved SMART NoC Design Supporting Arbitrary-Turn Transmission

SMART NoC, which transmits unconflicted flits to distant processing elements (PEs) in one cycle through the express bypass, is a high-performance NoC design proposed recently. However, if contention occurs, flits with low priority would not only be buffered but also could not fully utilize bypass. Although there exist several routing algorithms that decrease contentions by rounding busy routers and links, they cannot be directly applicable to SMART since it lacks the support for arbitrary-turn (i.e., the number and direction of turns are free of constraints) routing. Thus, in this article, to minimize contentions and further utilize bypass, we propose an improved SMART NoC, called ArSMART, in which arbitrary-turn transmission is enabled. Specifically, ArSMART divides the whole NoC into multiple clusters where the route computation is conducted by the cluster controller and the data forwarding is performed by the bufferless reconfigurable router. Since the long-range transmission in SMART NoC needs to bypass the intermediate arbitration, to enable this feature, we directly configure the input and output ports connection rather than apply hop-by-hop table-based arbitration. To further explore the higher communication capabilities, effective adaptive routing algorithms that are compatible with ArSMART are proposed. The route computation overhead, one of the main concerns for adaptive routing algorithms, is hidden by our carefully designed control mechanism. Compared with the state-of-the-art SMART NoC, the experimental results demonstrate an average reduction of 40.7% in application schedule length and 29.7% in energy consumption.

cs.AR↗

Theoretical prediction of interfacial thermal conductance at high temperature across solid-solid interfaces

The existed theories and methods for calculating interfacial thermal conductance of solid-solid interface lead to diverse values that deviate from experimental measurements. In this letter, We propose a model to estimate the ITC at high temperature without comprehensive calculations, where the interface between two dissimilar solids can be treated as an amorphous thin layer and the coordination number density across interface becomes a key parameter. Our model predicts that the ITCs of various interfaces at 300K are in a narrow range: 10$^{7}$W m$^{-2}$K$^{-1}$ $\sim $10$^{9}$ W m$^{-2}$ K$^{-1}$, which is in good agreement with the experimental measurement.

cond-mat.mtrl-sci↗

ASFGNN: Automated Separated-Federated Graph Neural Network

Graph Neural Networks (GNNs) have achieved remarkable performance by taking advantage of graph data. The success of GNN models always depends on rich features and adjacent relationships. However, in practice, such data are usually isolated by different data owners (clients) and thus are likely to be Non-Independent and Identically Distributed (Non-IID). Meanwhile, considering the limited network status of data owners, hyper-parameters optimization for collaborative learning approaches is time-consuming in data isolation scenarios. To address these problems, we propose an Automated Separated-Federated Graph Neural Network (ASFGNN) learning paradigm. ASFGNN consists of two main components, i.e., the training of GNN and the tuning of hyper-parameters. Specifically, to solve the data Non-IID problem, we first propose a separated-federated GNN learning model, which decouples the training of GNN into two parts: the message passing part that is done by clients separately, and the loss computing part that is learnt by clients federally. To handle the time-consuming parameter tuning problem, we leverage Bayesian optimization technique to automatically tune the hyper-parameters of all the clients. We conduct experiments on benchmark datasets and the results demonstrate that ASFGNN significantly outperforms the naive federated GNN, in terms of both accuracy and parameter-tuning efficiency.

cs.LG↗

Multi-layer Feature Aggregation for Deep Scene Parsing Models

Scene parsing from images is a fundamental yet challenging problem in visual content understanding. In this dense prediction task, the parsing model assigns every pixel to a categorical label, which requires the contextual information of adjacent image patches. So the challenge for this learning task is to simultaneously describe the geometric and semantic properties of objects or a scene. In this paper, we explore the effective use of multi-layer feature outputs of the deep parsing networks for spatial-semantic consistency by designing a novel feature aggregation module to generate the appropriate global representation prior, to improve the discriminative power of features. The proposed module can auto-select the intermediate visual features to correlate the spatial and semantic information. At the same time, the multiple skip connections form a strong supervision, making the deep parsing network easy to train. Extensive experiments on four public scene parsing datasets prove that the deep parsing network equipped with the proposed feature aggregation module can achieve very promising results.

cs.CV↗

Parameter Efficient Deep Neural Networks with Bilinear Projections

Recent research on deep neural networks (DNNs) has primarily focused on improving the model accuracy. Given a proper deep learning framework, it is generally possible to increase the depth or layer width to achieve a higher level of accuracy. However, the huge number of model parameters imposes more computational and memory usage overhead and leads to the parameter redundancy. In this paper, we address the parameter redundancy problem in DNNs by replacing conventional full projections with bilinear projections. For a fully-connected layer with $D$ input nodes and $D$ output nodes, applying bilinear projection can reduce the model space complexity from $\mathcal{O}(D^2)$ to $\mathcal{O}(2D)$, achieving a deep model with a sub-linear layer size. However, structured projection has a lower freedom of degree compared to the full projection, causing the under-fitting problem. So we simply scale up the mapping size by increasing the number of output channels, which can keep and even boosts the model accuracy. This makes it very parameter-efficient and handy to deploy such deep models on mobile systems with memory limitations. Experiments on four benchmark datasets show that applying the proposed bilinear projection to deep neural networks can achieve even higher accuracies than conventional full DNNs, while significantly reduces the model size.

cs.CV↗

PP-OCR: A Practical Ultra Lightweight OCR System

The Optical Character Recognition (OCR) systems have been widely used in various of application scenarios, such as office automation (OA) systems, factory automations, online educations, map productions etc. However, OCR is still a challenging task due to the various of text appearances and the demand of computational efficiency. In this paper, we propose a practical ultra lightweight OCR system, i.e., PP-OCR. The overall model size of the PP-OCR is only 3.5M for recognizing 6622 Chinese characters and 2.8M for recognizing 63 alphanumeric symbols, respectively. We introduce a bag of strategies to either enhance the model ability or reduce the model size. The corresponding ablation experiments with the real data are also provided. Meanwhile, several pre-trained models for the Chinese and English recognition are released, including a text detector (97K images are used), a direction classifier (600K images are used) as well as a text recognizer (17.9M images are used). Besides, the proposed PP-OCR are also verified in several other language recognition tasks, including French, Korean, Japanese and German. All of the above mentioned models are open-sourced and the codes are available in the GitHub repository, i.e., https://github.com/PaddlePaddle/PaddleOCR.

cs.CV↗

Synthetic MRI-aided Head-and-Neck Organs-at-Risk Auto-Delineation for CBCT-guided Adaptive Radiotherapy

Purpose: Organ-at-risk (OAR) delineation is a key step for cone-beam CT (CBCT) based adaptive radiotherapy planning that can be a time-consuming, labor-intensive, and subject-to-variability process. We aim to develop a fully automated approach aided by synthetic MRI for rapid and accurate CBCT multi-organ contouring in head-and-neck (HN) cancer patients. MRI has superb soft-tissue contrasts, while CBCT offers bony-structure contrasts. Using the complementary information provided by MRI and CBCT is expected to enable accurate multi-organ segmentation in HN cancer patients. In our proposed method, MR images are firstly synthesized using a pre-trained cycle-consistent generative adversarial network given CBCT. The features of CBCT and synthetic MRI are then extracted using dual pyramid networks for final delineation of organs. CBCT images and their corresponding manual contours were used as pairs to train and test the proposed model. Quantitative metrics including Dice similarity coefficient (DSC) were used to evaluate the proposed method. The proposed method was evaluated on a cohort of 65 HN cancer patients. CBCT images were collected from those patients who received proton therapy. Overall, DSC values of 0.87, 0.79/0.79, 0.89/0.89, 0.90, 0.75/0.77, 0.86, 0.66, 0.78/0.77, 0.96, 0.89/0.89, 0.832, and 0.84 for commonly used OARs for treatment planning including brain stem, left/right cochlea, left/right eye, larynx, left/right lens, mandible, optic chiasm, left/right optic nerve, oral cavity, left/right parotid, pharynx, and spinal cord, respectively, were achieved. In this study, we developed a synthetic MRI-aided HN CBCT auto-segmentation method based on deep learning. It provides a rapid and accurate OAR auto-delineation approach, which can be used for adaptive radiation therapy.

physics.med-ph↗

A Ubiquitous Thermal Conductivity Formula for Liquids, Polymer Glass, and Amorphous Solids

The microscopic mechanism of thermal transport in liquids and amorphous solids has been an outstanding problem for a long time. There have been several different approaches to explain the thermal conductivities for these systems, for example, the Bridgman's formula for simple liquids, the concept of the minimum thermal conductivity for amorphous solids, and the thermal resistance network model for amorphous polymers. Here, we present a ubiquitous formula to explain the thermal conductivities of liquids and amorphous solids in a unified way. The calculated thermal conductivities using this formula without fitting parameters are in excellent agreement with the experimental data for these systems. Our formula is not only providing detailed implications on microscopic mechanisms of heat transfer in these systems, but also solves the discrepancies between existing formulae and experimental data.

cond-mat.soft↗

A Unified Weight Learning and Low-Rank Regression Model for Robust Complex Error Modeling

One of the most important problems in regression-based error model is modeling the complex representation error caused by various corruptions and environment changes in images. For example, in robust face recognition, images are often affected by varying types and levels of corruptions, such as random pixel corruptions, block occlusions, or disguises. However, existing works are not robust enough to solve this problem due to they cannot model the complex corrupted errors very well. In this paper, we address this problem by a unified sparse weight learning and low-rank approximation regression model, which enables the random noises and contiguous occlusions in images to be treated simultaneously. For the random noise, we define a generalized correntropy (GC) function to match the error distribution. For the structured error caused by occlusions or disguises, we propose a GC function based rank approximation to measure the rank of error matrices. Since the proposed objective function is non-convex, an effective iterative optimization algorithm is developed to achieve the optimal weight learning and low-rank approximation. Extensive experimental results on three public face databases show that the proposed model can fit the error distribution and structure very well, thus obtain better recognition accuracies in comparison with the existing methods.

cs.CV↗

Beyond Triplet Loss: Person Re-identification with Fine-grained Difference-aware Pairwise Loss

Person Re-IDentification (ReID) aims at re-identifying persons from different viewpoints across multiple cameras. Capturing the fine-grained appearance differences is often the key to accurate person ReID, because many identities can be differentiated only when looking into these fine-grained differences. However, most state-of-the-art person ReID approaches, typically driven by a triplet loss, fail to effectively learn the fine-grained features as they are focused more on differentiating large appearance differences. To address this issue, we introduce a novel pairwise loss function that enables ReID models to learn the fine-grained features by adaptively enforcing an exponential penalization on the images of small differences and a bounded penalization on the images of large differences. The proposed loss is generic and can be used as a plugin to replace the triplet loss to significantly enhance different types of state-of-the-art approaches. Experimental results on four benchmark datasets show that the proposed loss substantially outperforms a number of popular loss functions by large margins; and it also enables significantly improved data efficiency.

cs.CV↗

3DPVNet: Patch-level 3D Hough Voting Network for 6D Pose Estimation

In this paper, we focus on estimating the 6D pose of objects in point clouds. Although the topic has been widely studied, pose estimation in point clouds remains a challenging problem due to the noise and occlusion. To address the problem, a novel 3DPVNet is presented in this work, which utilizes 3D local patches to vote for the object 6D poses. 3DPVNet is comprised of three modules. In particular, a Patch Unification (\textbf{PU}) module is first introduced to normalize the input patch, and also create a standard local coordinate frame on it to generate a reliable vote. We then devise a Weight-guided Neighboring Feature Fusion (\textbf{WNFF}) module in the network, which fuses the neighboring features to yield a semi-global feature for the center patch. WNFF module mines the neighboring information of a local patch, such that the representation capability to local geometric characteristics is significantly enhanced, making the method robust to a certain level of noise. Moreover, we present a Patch-level Voting (\textbf{PV}) module to regress transformations and generates pose votes. After the aggregation of all votes from patches and a refinement step, the final pose of the object can be obtained. Compared to recent voting-based methods, 3DPVNet is patch-level, and directly carried out on point clouds. Therefore, 3DPVNet achieves less computation than point/pixel-level voting scheme, and has robustness to partial data. Experiments on several datasets demonstrate that 3DPVNet achieves the state-of-the-art performance, and is also robust against noise and occlusions.

cs.CV↗