arXiv subjects

Jian Wang

Publications and source records attributed to Jian Wang.

At least 613 records · Page 34Linked to original sources

arXiv2023

Weakly Supervised Lesion Detection and Diagnosis for Breast Cancers with Partially Annotated Ultrasound Images

Deep learning (DL) has proven highly effective for ultrasound-based computer-aided diagnosis (CAD) of breast cancers. In an automaticCAD system, lesion detection is critical for the following diagnosis. However, existing DL-based methods generally require voluminous manually-annotated region of interest (ROI) labels and class labels to train both the lesion detection and diagnosis models. In clinical practice, the ROI labels, i.e. ground truths, may not always be optimal for the classification task due to individual experience of sonologists, resulting in the issue of coarse annotation that limits the diagnosis performance of a CAD model. To address this issue, a novel Two-Stage Detection and Diagnosis Network (TSDDNet) is proposed based on weakly supervised learning to enhance diagnostic accuracy of the ultrasound-based CAD for breast cancers. In particular, all the ROI-level labels are considered as coarse labels in the first training stage, and then a candidate selection mechanism is designed to identify optimallesion areas for both the fully and partially annotated samples. It refines the current ROI-level labels in the fully annotated images and the detected ROIs in the partially annotated samples with a weakly supervised manner under the guidance of class labels. In the second training stage, a self-distillation strategy further is further proposed to integrate the detection network and classification network into a unified framework as the final CAD model for joint optimization, which then further improves the diagnosis performance. The proposed TSDDNet is evaluated on a B-mode ultrasound dataset, and the experimental results show that it achieves the best performance on both lesion detection and diagnosis tasks, suggesting promising application potential.

eess.IV↗

arXiv2023

School Bullying Results in Poor Psychological Conditions: Evidence from a Survey of 95,545 Subjects

To investigate whether bullying and psychological conditions are correlated, this study analyzed a survey of primary and secondary school students from Zigong City, Sichuan Province. A total of 95,545 students completed a personal information questionnaire, the Multidimensional Peer-Victimization Scale (MPVS), and eight other scales pertaining to various psychological problems. The data showed that 68,315 (71.5\%) participants experienced school bullying at varying degrees, indicating the prevalence of bullying among adolescents. The chi-square tests revealed a strong correlation between school bullying and psychological conditions. This correlation was further explored through multivariate logistic regression, showing that students who experienced mild bullying had a 3.10 times higher probability of emotional and behavioral problems, 4.06 times higher probability of experiencing prodromal symptoms of mental illness, 4.72 times higher probability of anxiety, 3.28 times higher probability of developing post-traumatic stress disorder (PTSD) , 4.07 times higher probability of poor sleep quality, 3.13 times higher probability of internet addiction, 2.18 times higher probability of poor mental health, and 3.64 times higher probability of depression than students who did not experience bullying. The corresponding probabilities for students who experienced severe bullying were 11.35, 17.35, 18.52, 12.59, 11.67, 12.03, 4.64, and 5.34 times higher, respectively. In conclusion, school bullying and psychological conditions are significantly correlated among primary and secondary school students, and the more severe the bullying, the higher the probability to suffer from psychological problems.

physics.soc-ph↗

arXiv2023

Graph Contrastive Learning for Skeleton-based Action Recognition

In the field of skeleton-based action recognition, current top-performing graph convolutional networks (GCNs) exploit intra-sequence context to construct adaptive graphs for feature aggregation. However, we argue that such context is still \textit{local} since the rich cross-sequence relations have not been explicitly investigated. In this paper, we propose a graph contrastive learning framework for skeleton-based action recognition (\textit{SkeletonGCL}) to explore the \textit{global} context across all sequences. In specific, SkeletonGCL associates graph learning across sequences by enforcing graphs to be class-discriminative, \emph{i.e.,} intra-class compact and inter-class dispersed, which improves the GCN capacity to distinguish various action patterns. Besides, two memory banks are designed to enrich cross-sequence context from two complementary levels, \emph{i.e.,} instance and semantic levels, enabling graph contrastive learning in multiple context scales. Consequently, SkeletonGCL establishes a new training paradigm, and it can be seamlessly incorporated into current GCNs. Without loss of generality, we combine SkeletonGCL with three GCNs (2S-ACGN, CTR-GCN, and InfoGCN), and achieve consistent improvements on NTU60, NTU120, and NW-UCLA benchmarks. The source code will be available at \url{https://github.com/OliverHxh/SkeletonGCL}.

cs.CV↗

arXiv2023

Fourier Test-time Adaptation with Multi-level Consistency for Robust Classification

Deep classifiers may encounter significant performance degradation when processing unseen testing data from varying centers, vendors, and protocols. Ensuring the robustness of deep models against these domain shifts is crucial for their widespread clinical application. In this study, we propose a novel approach called Fourier Test-time Adaptation (FTTA), which employs a dual-adaptation design to integrate input and model tuning, thereby jointly improving the model robustness. The main idea of FTTA is to build a reliable multi-level consistency measurement of paired inputs for achieving self-correction of prediction. Our contribution is two-fold. First, we encourage consistency in global features and local attention maps between the two transformed images of the same input. Here, the transformation refers to Fourier-based input adaptation, which can transfer one unseen image into source style to reduce the domain gap. Furthermore, we leverage style-interpolated images to enhance the global and local features with learnable parameters, which can smooth the consistency measurement and accelerate convergence. Second, we introduce a regularization technique that utilizes style interpolation consistency in the frequency space to encourage self-consistency in the logit space of the model output. This regularization provides strong self-supervised signals for robustness enhancement. FTTA was extensively validated on three large classification datasets with different modalities and organs. Experimental results show that FTTA is general and outperforms other strong state-of-the-art methods.

cs.CV↗

arXiv2023

A Unified Conditional Framework for Diffusion-based Image Restoration

Diffusion Probabilistic Models (DPMs) have recently shown remarkable performance in image generation tasks, which are capable of generating highly realistic images. When adopting DPMs for image restoration tasks, the crucial aspect lies in how to integrate the conditional information to guide the DPMs to generate accurate and natural output, which has been largely overlooked in existing works. In this paper, we present a unified conditional framework based on diffusion models for image restoration. We leverage a lightweight UNet to predict initial guidance and the diffusion model to learn the residual of the guidance. By carefully designing the basic module and integration module for the diffusion model block, we integrate the guidance and other auxiliary conditional information into every block of the diffusion model to achieve spatially-adaptive generation conditioning. To handle high-resolution images, we propose a simple yet effective inter-step patch-splitting strategy to produce arbitrary-resolution images without grid artifacts. We evaluate our conditional framework on three challenging tasks: extreme low-light denoising, deblurring, and JPEG restoration, demonstrating its significant improvements in perceptual quality and the generalization to restoration tasks.

cs.CV↗

arXiv2023

Intertwined charge and pair density orders in a monolayer high-Tc iron-based superconductor

Symmetry-breaking electronic phase in unconventional high-temperature (high-Tc) superconductors is a fascinating issue in condensed-matter physics, among which the most attractive phases are charge density wave (CDW) phase with four unit-cell periodicity in cuprates and nematic phase breaking the C4 rotational symmetry in iron-based superconductors (FeSCs). Recently, pair density wave (PDW), an exotic superconducting phase with non-zero momentum Cooper pairs, has been observed in high-Tc cuprates and the monolayer FeSC. However, the interplay between the CDW, PDW and nematic phase remains to be explored. Here, using scanning tunneling microscopy/spectroscopy, we detected commensurate CDW and CDW-induced PDW orders with the same period of lambda = 4aFe (aFe is the distance between neighboring Fe atoms) in a monolayer high-Tc Fe(Te,Se) film grown on SrTiO3(001) substrate. Further analyses demonstrate the observed CDW is a smectic order, which breaks both translation and C4 rotational symmetry. Moreover, the smecticity of the CDW order is strongest near the superconducting gap but weakens near defects and in an applied magnetic field, indicating the interplay between the smectic CDW and PDW orders. Our works provide a new platform to study the intertwined orders and their interactions in high-Tc superconductors.

cond-mat.supr-con↗

arXiv2023

Medical Dialogue Generation via Dual Flow Modeling

Medical dialogue systems (MDS) aim to provide patients with medical services, such as diagnosis and prescription. Since most patients cannot precisely describe their symptoms, dialogue understanding is challenging for MDS. Previous studies mainly addressed this by extracting the mentioned medical entities as critical dialogue history information. In this work, we argue that it is also essential to capture the transitions of the medical entities and the doctor's dialogue acts in each turn, as they help the understanding of how the dialogue flows and enhance the prediction of the entities and dialogue acts to be adopted in the following turn. Correspondingly, we propose a Dual Flow enhanced Medical (DFMed) dialogue generation framework. It extracts the medical entities and dialogue acts used in the dialogue history and models their transitions with an entity-centric graph flow and a sequential act flow, respectively. We employ two sequential models to encode them and devise an interweaving component to enhance their interactions. Experiments on two datasets demonstrate that our method exceeds baselines in both automatic and manual evaluations.

cs.CL↗

arXiv2023

Dialogue Planning via Brownian Bridge Stochastic Process for Goal-directed Proactive Dialogue

Goal-directed dialogue systems aim to proactively reach a pre-determined target through multi-turn conversations. The key to achieving this task lies in planning dialogue paths that smoothly and coherently direct conversations towards the target. However, this is a challenging and under-explored task. In this work, we propose a coherent dialogue planning approach that uses a stochastic process to model the temporal dynamics of dialogue paths. We define a latent space that captures the coherence of goal-directed behavior using a Brownian bridge process, which allows us to incorporate user feedback flexibly in dialogue planning. Based on the derived latent trajectories, we generate dialogue paths explicitly using pre-trained language models. We finally employ these paths as natural language prompts to guide dialogue generation. Our experiments show that our approach generates more coherent utterances and achieves the goal with a higher success rate.

cs.CL↗

arXiv2023

Improved bounds on the maximum diversity of intersecting families

A family $\mathcal{F}\subset \binom{[n]}{k}$ is called an intersecting family if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. If $\cap \mathcal{F}\neq \emptyset$ then $\mathcal{F}$ is called a star. The diversity of an intersecting family $\mathcal{F}$ is defined as the minimum number of $k$-sets in $\mathcal{F}$, whose deletion results in a star. In the present paper, we prove that for $n>36k$ any intersecting family $\mathcal{F}\subset \binom{[n]}{k}$ has diversity at most $\binom{n-3}{k-2}$, which improves the previous best bound $n>72k$ due to the first author. This result is derived from some strong bounds concerning the maximum degree of large intersecting families. Some related results are established as well.

math.CO↗

arXiv2023

Hausdorff dimensions of inverse images and collision time sets for symmetric Markov processes

In this paper, we establish the Hausdorff dimensions of inverse images and collision time sets for a large class of symmetric Markov processes on metric measure spaces. We apply the approach in the works by Hawkes and Jain--Pruitt, and make full use of heat kernel estimates. In particular, the results efficiently apply to symmetric diffusion processes, symmetric stable-like processes, and symmetric diffusion processes with jumps in $d$-sets.

math.PR↗

arXiv2023

Evaluating AIGC Detectors on Code Content

Artificial Intelligence Generated Content (AIGC) has garnered considerable attention for its impressive performance, with ChatGPT emerging as a leading AIGC model that produces high-quality responses across various applications, including software development and maintenance. Despite its potential, the misuse of ChatGPT poses significant concerns, especially in education and safetycritical domains. Numerous AIGC detectors have been developed and evaluated on natural language data. However, their performance on code-related content generated by ChatGPT remains unexplored. To fill this gap, in this paper, we present the first empirical study on evaluating existing AIGC detectors in the software domain. We created a comprehensive dataset including 492.5K samples comprising code-related content produced by ChatGPT, encompassing popular software activities like Q&A (115K), code summarization (126K), and code generation (226.5K). We evaluated six AIGC detectors, including three commercial and three open-source solutions, assessing their performance on this dataset. Additionally, we conducted a human study to understand human detection capabilities and compare them with the existing AIGC detectors. Our results indicate that AIGC detectors demonstrate lower performance on code-related data compared to natural language data. Fine-tuning can enhance detector performance, especially for content within the same domain; but generalization remains a challenge. The human evaluation reveals that detection by humans is quite challenging.

cs.SE↗

arXiv2023

Contractible 3-manifold and Positive scalar curvature (II)

In this article, we are interested in the question whether any complete contractible $3$-manifold of positive scalar curvature is homeomorphic to $\mathbb{R}^{3}$. We study the fundamental group at infinity, $π_{1}^{\infty}$, and its relationship with the existence of complete metrics of positive scalar curvature. We prove that a complete contractible $3$-manifold with positive scalar curvature and trivial $π^{\infty}_{1}$ is homeomorphic to $\mathbb{R}^{3}$.

math.DG↗

arXiv2023

Robust Calibrate Proxy Loss for Deep Metric Learning

The mainstream researche in deep metric learning can be divided into two genres: proxy-based and pair-based methods. Proxy-based methods have attracted extensive attention due to the lower training complexity and fast network convergence. However, these methods have limitations as the poxy optimization is done by network, which makes it challenging for the proxy to accurately represent the feature distrubtion of the real class of data. In this paper, we propose a Calibrate Proxy (CP) structure, which uses the real sample information to improve the similarity calculation in proxy-based loss and introduces a calibration loss to constraint the proxy optimization towards the center of the class features. At the same time, we set a small number of proxies for each class to alleviate the impact of intra-class differences on retrieval performance. The effectiveness of our method is evaluated by extensive experiments on three public datasets and multiple synthetic label-noise datasets. The results show that our approach can effectively improve the performance of commonly used proxy-based losses on both regular and noisy datasets.

cs.IR↗

arXiv2023

CSDR-BERT: a pre-trained scientific dataset match model for Chinese Scientific Dataset Retrieval

As the number of open and shared scientific datasets on the Internet increases under the open science movement, efficiently retrieving these datasets is a crucial task in information retrieval (IR) research. In recent years, the development of large models, particularly the pre-training and fine-tuning paradigm, which involves pre-training on large models and fine-tuning on downstream tasks, has provided new solutions for IR match tasks. In this study, we use the original BERT token in the embedding layer, improve the Sentence-BERT model structure in the model layer by introducing the SimCSE and K-Nearest Neighbors method, and use the cosent loss function in the optimization phase to optimize the target output. Our experimental results show that our model outperforms other competing models on both public and self-built datasets through comparative experiments and ablation implementations. This study explores and validates the feasibility and efficiency of pre-training techniques for semantic retrieval of Chinese scientific datasets.

cs.IR↗

arXiv2023

PSVT: End-to-End Multi-person 3D Pose and Shape Estimation with Progressive Video Transformers

Existing methods of multi-person video 3D human Pose and Shape Estimation (PSE) typically adopt a two-stage strategy, which first detects human instances in each frame and then performs single-person PSE with temporal model. However, the global spatio-temporal context among spatial instances can not be captured. In this paper, we propose a new end-to-end multi-person 3D Pose and Shape estimation framework with progressive Video Transformer, termed PSVT. In PSVT, a spatio-temporal encoder (STE) captures the global feature dependencies among spatial objects. Then, spatio-temporal pose decoder (STPD) and shape decoder (STSD) capture the global dependencies between pose queries and feature tokens, shape queries and feature tokens, respectively. To handle the variances of objects as time proceeds, a novel scheme of progressive decoding is used to update pose and shape queries at each frame. Besides, we propose a novel pose-guided attention (PGA) for shape decoder to better predict shape parameters. The two components strengthen the decoder of PSVT to improve performance. Extensive experiments on the four datasets show that PSVT achieves stage-of-the-art results.

cs.CV↗

arXiv2023

Glass Segmentation with RGB-Thermal Image Pairs

This paper proposes a new glass segmentation method utilizing paired RGB and thermal images. Due to the large difference between the transmission property of visible light and that of the thermal energy through the glass where most glass is transparent to the visible light but opaque to thermal energy, glass regions of a scene are made more distinguishable with a pair of RGB and thermal images than solely with an RGB image. To exploit such a unique property, we propose a neural network architecture that effectively combines an RGB-thermal image pair with a new multi-modal fusion module based on attention, and integrate CNN and transformer to extract local features and non-local dependencies, respectively. As well, we have collected a new dataset containing 5551 RGB-thermal image pairs with ground-truth segmentation annotations. The qualitative and quantitative evaluations demonstrate the effectiveness of the proposed approach on fusing RGB and thermal data for glass segmentation. Our code and data are available at https://github.com/Dong-Huo/RGB-T-Glass-Segmentation.

cs.CV↗

arXiv2023

Contractible $3$-manifold and Positive scalar curvature (I)

In this work we prove that the Whitehead manifold has no complete metric of positive scalar curvature. This result can be generalized to the genus one case. Precisely, we show that no contractible genus one $3$-manifold admits a complete metric of positive scalar curvature.

math.DG↗

arXiv2023

NoiseCAM: Explainable AI for the Boundary Between Noise and Adversarial Attacks

Deep Learning (DL) and Deep Neural Networks (DNNs) are widely used in various domains. However, adversarial attacks can easily mislead a neural network and lead to wrong decisions. Defense mechanisms are highly preferred in safety-critical applications. In this paper, firstly, we use the gradient class activation map (GradCAM) to analyze the behavior deviation of the VGG-16 network when its inputs are mixed with adversarial perturbation or Gaussian noise. In particular, our method can locate vulnerable layers that are sensitive to adversarial perturbation and Gaussian noise. We also show that the behavior deviation of vulnerable layers can be used to detect adversarial examples. Secondly, we propose a novel NoiseCAM algorithm that integrates information from globally and pixel-level weighted class activation maps. Our algorithm is susceptible to adversarial perturbations and will not respond to Gaussian random noise mixed in the inputs. Third, we compare detecting adversarial examples using both behavior deviation and NoiseCAM, and we show that NoiseCAM outperforms behavior deviation modeling in its overall performance. Our work could provide a useful tool to defend against certain adversarial attacks on deep neural networks.

cs.LG↗