Searcharxiv⌕ Search

arXiv subjects

Xiaoyan Wang

Publications and source records attributed to Xiaoyan Wang.

At least 37 records · Page 2Linked to original sources

Deep Learning Method to Predict Wound Healing Progress Based on Collagen Fibers in Wound Tissue

Wound healing is a complex process involving changes in collagen fibers. Accurate monitoring of these changes is crucial for assessing the progress of wound healing and has significant implications for guiding clinical treatment strategies and drug screening. However, traditional quantitative analysis methods focus on spatial characteristics such as collagen fiber alignment and variance, lacking threshold standards to differentiate between different stages of wound healing. To address this issue, we propose an innovative approach based on deep learning to predict the progression of wound healing by analyzing collagen fiber features in histological images of wound tissue. Leveraging the unique learning capabilities of deep learning models, our approach captures the feature variations of collagen fibers in histological images from different categories and classifies them into various stages of wound healing. To overcome the limited availability of histological image data, we employ a transfer learning strategy. Specifically, we fine-tune a VGG16 model pretrained on the ImageNet dataset to adapt it to the classification task of histological images of wounds. Through this process, our model achieves 82% accuracy in classifying six stages of wound healing. Furthermore, to enhance the interpretability of the model, we employ a class activation mapping technique called LayerCAM. LayerCAM reveals the image regions on which the model relies when making predictions, providing transparency to the model's decision-making process. This visualization not only helps us understand how the model identifies and evaluates collagen fiber features but also enhances trust in the model's prediction results. To the best of our knowledge, our proposed model is the first deep learning-based classification model used for predicting wound healing stages.

cs.CV↗

AVID: Any-Length Video Inpainting with Diffusion Model

Recent advances in diffusion models have successfully enabled text-guided image inpainting. While it seems straightforward to extend such editing capability into the video domain, there have been fewer works regarding text-guided video inpainting. Given a video, a masked region at its initial frame, and an editing prompt, it requires a model to do infilling at each frame following the editing guidance while keeping the out-of-mask region intact. There are three main challenges in text-guided video inpainting: ($i$) temporal consistency of the edited video, ($ii$) supporting different inpainting types at different structural fidelity levels, and ($iii$) dealing with variable video length. To address these challenges, we introduce Any-Length Video Inpainting with Diffusion Model, dubbed as AVID. At its core, our model is equipped with effective motion modules and adjustable structure guidance, for fixed-length video inpainting. Building on top of that, we propose a novel Temporal MultiDiffusion sampling pipeline with a middle-frame attention guidance mechanism, facilitating the generation of videos with any desired duration. Our comprehensive experiments show our model can robustly deal with various inpainting types at different video duration ranges, with high quality. More visualization results are made publicly available at https://zhang-zx.github.io/AVID/ .

cs.CV↗

3DMIT: 3D Multi-modal Instruction Tuning for Scene Understanding

The remarkable potential of multi-modal large language models (MLLMs) in comprehending both vision and language information has been widely acknowledged. However, the scarcity of 3D scenes-language pairs in comparison to their 2D counterparts, coupled with the inadequacy of existing approaches in understanding of 3D scenes by LLMs, poses a significant challenge. In response, we collect and construct an extensive dataset comprising 75K instruction-response pairs tailored for 3D scenes. This dataset addresses tasks related to 3D VQA, 3D grounding, and 3D conversation. To further enhance the integration of 3D spatial information into LLMs, we introduce a novel and efficient prompt tuning paradigm, 3DMIT. This paradigm eliminates the alignment stage between 3D scenes and language and extends the instruction prompt with the 3D modality information including the entire scene and segmented objects. We evaluate the effectiveness of our method across diverse tasks in the 3D scene domain and find that our approach serves as a strategic means to enrich LLMs' comprehension of the 3D world. Our code is available at https://github.com/staymylove/3DMIT.

cs.CV↗

Fairy: Fast Parallelized Instruction-Guided Video-to-Video Synthesis

In this paper, we introduce Fairy, a minimalist yet robust adaptation of image-editing diffusion models, enhancing them for video editing applications. Our approach centers on the concept of anchor-based cross-frame attention, a mechanism that implicitly propagates diffusion features across frames, ensuring superior temporal coherence and high-fidelity synthesis. Fairy not only addresses limitations of previous models, including memory and processing speed. It also improves temporal consistency through a unique data augmentation strategy. This strategy renders the model equivariant to affine transformations in both source and target images. Remarkably efficient, Fairy generates 120-frame 512x384 videos (4-second duration at 30 FPS) in just 14 seconds, outpacing prior works by at least 44x. A comprehensive user study, involving 1000 generated samples, confirms that our approach delivers superior quality, decisively outperforming established methods.

cs.CV↗

Experimental demonstration of mice tumor control with a laser-accelerated high-energy electron radiotherapy prototype

Radiotherapy using very-high-energy electron (VHEE) beams (50-300 MeV) has attracted considerable attention due to its advantageous dose deposition characteristics, enabling deep penetration and the potential for ultra-high dose rate treatment. One promising approach to compactly delivering these high energy electron beams in a cost-effective manner is laser wakefield acceleration (LWFA), which offers ultra-strong accelerating gradients. However, the transition from this concept to a functional machine intended for tumor treatment is still being investigated. Here we present the first self-developed prototype for LWFA-based VHEE radiotherapy, exhibiting high compactness (occupying less than 5 square meters) and high operational stability (validated over a period of one month). Subsequently, we employed this device to irradiate a tumor implanted in a mouse model. Following a dose delivery of $5.8\pm0.2$ Gy with precise tumor conformity, all irradiated mice exhibited pronounced control of tumor growth. For comparison, this tumor-control efficacy was similar to that achieved using commercial X-ray radiotherapy equipment operating at equivalent doses. These results demonstrate the potential of a compact laser-driven VHEE system for preclinical studies involving small animal models and its promising prospects for future clinical translation in cancer therapy.

physics.med-ph↗

On Rota-Baxter vertex operator algebras

Derivations play a fundamental role in the definition of vertex (operator) algebras, sometimes regarded as a generalization of differential commutative algebras. This paper studies the role played by the integral counterpart of the derivations, namely Rota-Baxter operators, in vertex (operator) algebras. The closely related notion of dendriform algebras is also defined for vertex operator algebras. It is shown that the classical relations among dendriform algebras, associative algebras, and Rota-Baxter algebras are preserved for their vertex algebra analogs.

math.QA↗

Truncated Milstein method for non-autonomous stochastic differential equations and its modification

The truncated Milstein method, which was initially proposed in (Guo, Liu, Mao and Yue 2018), is extended to the non-autonomous stochastic differential equations with the super-linear state variable and the Hölder continuous time variable. The convergence rate is proved. Compared with the initial work, the requirements on the step-size is also significantly released. In addition, the technique of the randomized step-size is employed to raise the convergence rate of the truncated Milstein method.

math.NA↗

Analyzing the Performance of Graph Neural Networks with Pipe Parallelism

Many interesting datasets ubiquitous in machine learning and deep learning can be described via graphs. As the scale and complexity of graph-structured datasets increase, such as in expansive social networks, protein folding, chemical interaction networks, and material phase transitions, improving the efficiency of the machine learning techniques applied to these is crucial. In this study, we focus on Graph Neural Networks (GNN) that have found great success in tasks such as node or edge classification and link prediction. However, standard GNN models have scaling limits due to necessary recursive calculations performed through dense graph relationships that lead to memory and runtime bottlenecks. While new approaches for processing larger networks are needed to advance graph techniques, and several have been proposed, we study how GNNs could be parallelized using existing tools and frameworks that are known to be successful in the deep learning community. In particular, we investigate applying pipeline parallelism to GNN models with GPipe, introduced by Google in 2018.

cs.LG↗

Aggregate Modeling and Equilibrium Analysis of the Crowdsourcing Market for Autonomous Vehicles

Autonomous vehicles (AVs) have the potential of reshaping the human mobility in a wide variety of aspects. This paper focuses on a new possibility that the AV owners have the option of "renting" their AVs to a company, which can use these collected AVs to provide on-demand ride services without any drivers. We call such a mobility market with AV renting options the "AV crowdsourcing market". This paper establishes an aggregate equilibrium model with multiple transport modes to analyze the AV crowdsourcing market. The modeling framework can capture the customers' mode choices and AV owners' rental decisions with the presence of traffic congestion. Then, we explore different scenarios that either maximize the crowdsourcing platform's profit or maximize social welfare. Gradient-based optimization algorithms are designed for solving the problems. The results obtained by numerical examples reveal the welfare enhancement and the strong profitability of the AV crowdsourcing service. However, when the crowdsourcing scale is small, the crowdsourcing platform might not be profitable. A second-best pricing scheme is able to avoid such undesirable cases. The insights generated from the analyses provide guidance for regulators, service providers and citizens to make future decisions regarding the utilization of the AV crowdsourcing markets for serving the good of the society.

econ.GN↗

PPL Bench: Evaluation Framework For Probabilistic Programming Languages

We introduce PPL Bench, a new benchmark for evaluating Probabilistic Programming Languages (PPLs) on a variety of statistical models. The benchmark includes data generation and evaluation code for a number of models as well as implementations in some common PPLs. All of the benchmark code and PPL implementations are available on Github. We welcome contributions of new models and PPLs and as well as improvements in existing PPL implementations. The purpose of the benchmark is two-fold. First, we want researchers as well as conference reviewers to be able to evaluate improvements in PPLs in a standardized setting. Second, we want end users to be able to pick the PPL that is most suited for their modeling application. In particular, we are interested in evaluating the accuracy and speed of convergence of the inferred posterior. Each PPL only needs to provide posterior samples given a model and observation data. The framework automatically computes and plots growth in predictive log-likelihood on held out data in addition to reporting other common metrics such as effective sample size and $\hat{r}$.

cs.PL↗

Distinguish Confusing Law Articles for Legal Judgment Prediction

Legal Judgment Prediction (LJP) is the task of automatically predicting a law case's judgment results given a text describing its facts, which has excellent prospects in judicial assistance systems and convenient services for the public. In practice, confusing charges are frequent, because law cases applicable to similar law articles are easily misjudged. For addressing this issue, the existing method relies heavily on domain experts, which hinders its application in different law systems. In this paper, we present an end-to-end model, LADAN, to solve the task of LJP. To distinguish confusing charges, we propose a novel graph neural network to automatically learn subtle differences between confusing law articles and design a novel attention mechanism that fully exploits the learned differences to extract compelling discriminative features from fact descriptions attentively. Experiments conducted on real-world datasets demonstrate the superiority of our LADAN.

cs.CL↗

Unveiling the secrets of the mid-infrared Moon

The Moon's optical characteristics in visible and long-wavelength infrared (LWIR) have long been observed with our eyes or with instruments. What the mid-infrared (MIR) Moon looks like is still a mystery. For the first time we present detailed appearance of the MIR Moon observed by a high-resolution geostationary satellite and reveal the essence behind its appearance. The appearance of the MIR Moon is opposite to its normal visible appearance. In addition the MIR Moon shows limb darkening. Both the absolute and the relative brightness distribution of the MIR lunar disk changes with the solar incidence angle. The signatures of the MIR Moon are controlled by both the reflection and emission of the lunar surface. We also show first-ever brightness temperature maps of the lunar disk without needing a mosaic, which better show the temperature variation across the lunar disk. They reveal that the relationship between brightness temperature and solar incidence angle i is cos1/bi, and the power parameter is smaller than the Lambertian temperature model of cos1/4i observed for lunar orbit-based measurements. The slower decrease of the brightness temperature when moving away from the sub-solar point than the Lambertian model is due to topographic effects. The brightness temperature is dominated by albedo and the solar incidence angle and influenced by the topography. Our results indicate that the Moon in the MIR exhibits many interesting phenomena which were previously unknown, and contains abundant information about lunar reflection and thermal emission for future study.

astro-ph.EP↗

Learning to Order Sub-questions for Complex Question Answering

Answering complex questions involving multiple entities and relations is a challenging task. Logically, the answer to a complex question should be derived by decomposing the complex question into multiple simple sub-questions and then answering those sub-questions. Existing work has followed this strategy but has not attempted to optimize the order of how those sub-questions are answered. As a result, the sub-questions are answered in an arbitrary order, leading to larger search space and a higher risk of missing an answer. In this paper, we propose a novel reinforcement learning(RL) approach to answering complex questions that can learn a policy to dynamically decide which sub-question should be answered at each stage of reasoning. We lever-age the expected value-variance criterion to enable the learned policy to balance between the risk and utility of answering a sub-question. Experiment results show that the RL approach can substantially improve the optimality of ordering the sub-questions, leading to improved accuracy of question answering. The proposed method for learning to order sub-questions is general and can thus be potentially combined with many existing ideas for answering complex questions to enhance their performance.

cs.CL↗

EmoSense: Computational Intelligence Driven Emotion Sensing via Wireless Channel Data

Emotion is well-recognized as a distinguished symbol of human beings, and it plays a crucial role in our daily lives. Existing vision-based or sensor-based solutions are either obstructive to use or rely on specialized hardware, hindering their applicability. This paper introduces EmoSense, a first-of-its-kind wireless emotion sensing system driven by computational intelligence. The basic methodology is to explore the physical expression of emotions from wireless channel response via data mining. The design and implementation of EmoSense {face} two major challenges: extracting physical expression from wireless channel data and recovering emotion from the corresponding physical expression. For the former, we present a Fresnel zone based theoretical model depicting the fingerprint of the physical expression on channel response. For the latter, we design an efficient computational intelligence driven mechanism to recognize emotion from the corresponding fingerprints. We prototyped EmoSense on the commodity WiFi infrastructure and compared it with main-stream sensor-based and vision-based approaches in the real-world scenario. The numerical study over $3360$ cases confirms that EmoSense achieves a comparable performance to the vision-based and sensor-based rivals under different scenarios. EmoSense only leverages the low-cost and prevalent WiFi infrastructures and thus constitutes a tempting solution for emotion sensing.

cs.HC↗

Consistent Classification with Generalized Metrics

We propose a framework for constructing and analyzing multiclass and multioutput classification metrics, i.e., involving multiple, possibly correlated multiclass labels. Our analysis reveals novel insights on the geometry of feasible confusion tensors -- including necessary and sufficient conditions for the equivalence between optimizing an arbitrary non-decomposable metric and learning a weighted classifier. Further, we analyze averaging methodologies commonly used to compute multioutput metrics and characterize the corresponding Bayes optimal classifiers. We show that the plug-in estimator based on this characterization is consistent and is easily implemented as a post-processing rule. Empirical results on synthetic and benchmark datasets support the theoretical findings.

stat.ML↗

Answering Science Exam Questions Using Query Rewriting with Background Knowledge

Open-domain question answering (QA) is an important problem in AI and NLP that is emerging as a bellwether for progress on the generalizability of AI methods and techniques. Much of the progress in open-domain QA systems has been realized through advances in information retrieval methods and corpus construction. In this paper, we focus on the recently introduced ARC Challenge dataset, which contains 2,590 multiple choice questions authored for grade-school science exams. These questions are selected to be the most challenging for current QA systems, and current state of the art performance is only slightly better than random chance. We present a system that rewrites a given question into queries that are used to retrieve supporting text from a large corpus of science-related text. Our rewriter is able to incorporate background knowledge from ConceptNet and -- in tandem with a generic textual entailment system trained on SciTail that identifies support in the retrieved results -- outperforms several strong baselines on the end-to-end QA task despite only being trained to identify essential terms in the original source question. We use a generalizable decision methodology over the retrieved evidence and answer candidates to select the best answer. By combining query rewriting, background knowledge, and textual entailment our system is able to outperform several strong baselines on the ARC dataset.

cs.AI↗

Improving Natural Language Inference Using External Knowledge in the Science Questions Domain

Natural Language Inference (NLI) is fundamental to many Natural Language Processing (NLP) applications including semantic search and question answering. The NLI problem has gained significant attention thanks to the release of large scale, challenging datasets. Present approaches to the problem largely focus on learning-based methods that use only textual information in order to classify whether a given premise entails, contradicts, or is neutral with respect to a given hypothesis. Surprisingly, the use of methods based on structured knowledge -- a central topic in artificial intelligence -- has not received much attention vis-a-vis the NLI problem. While there are many open knowledge bases that contain various types of reasoning information, their use for NLI has not been well explored. To address this, we present a combination of techniques that harness knowledge graphs to improve performance on the NLI problem in the science questions domain. We present the results of applying our techniques on text, graph, and text-to-graph based models, and discuss implications for the use of external knowledge in solving the NLI problem. Our model achieves the new state-of-the-art performance on the NLI problem over the SciTail science questions dataset.

cs.AI↗

Prediction Accuracy Measures for a Nonlinear Model and for Right-Censored Time-to-Event Data

This paper studies prediction summary measures for a prediction function under a general setting in which the model is allowed to be misspecified and the prediction function is not required to be the conditional mean response. We show that the R2 measure based on a variance decomposition is insufficient to summarize the predictive power of a nonlinear prediction function. By deriving a prediction error decompo- sition, we introduce an additional measure, L2, to augment the R2 measure. When used together, the two measures provide a complete summary of the predictive power of a prediction function. Furthermore, we extend these measures to right-censored time-to-event data by establishing right-censored data analogs of the variance and prediction error decompositions. We illustrate the usefulness of the proposed mea- sures with simulations and real data examples. Supplementary materials for this article are available online.

math.ST↗