arXiv subjects

Yuan Ma

Publications and source records attributed to Yuan Ma.

35 records · Page 2Linked to original sources

arXiv2024

Implementing Trust in Non-Small Cell Lung Cancer Diagnosis with a Conformalized Uncertainty-Aware AI Framework in Whole-Slide Images

Ensuring trustworthiness is fundamental to the development of artificial intelligence (AI) that is considered societally responsible, particularly in cancer diagnostics, where a misdiagnosis can have dire consequences. Current digital pathology AI models lack systematic solutions to address trustworthiness concerns arising from model limitations and data discrepancies between model deployment and development environments. To address this issue, we developed TRUECAM, a framework designed to ensure both data and model trustworthiness in non-small cell lung cancer subtyping with whole-slide images. TRUECAM integrates 1) a spectral-normalized neural Gaussian process for identifying out-of-scope inputs and 2) an ambiguity-guided elimination of tiles to filter out highly ambiguous regions, addressing data trustworthiness, as well as 3) conformal prediction to ensure controlled error rates. We systematically evaluated the framework across multiple large-scale cancer datasets, leveraging both task-specific and foundation models, illustrate that an AI model wrapped with TRUECAM significantly outperforms models that lack such guidance, in terms of classification accuracy, robustness, interpretability, and data efficiency, while also achieving improvements in fairness. These findings highlight TRUECAM as a versatile wrapper framework for digital pathology AI models with diverse architectural designs, promoting their responsible and effective applications in real-world settings.

eess.IV↗

arXiv2024

Computational Identification and Stuart-Landau Modeling of Collective Dynamical Behaviors of Octuple Laminar Diffusion Flame Oscillators

Annular chambers, consisting of multiple flame nozzles, are frequently used in many industrial processes, for example, rocket engines and gas turbines. In the study, we proposed a novel approach to the problem of annular combustion with emphasis on the collective dynamical behaviors that its individuals do not have. A series of circular arrays of octuple flickering laminar buoyant diffusion flames were investigated computationally and theoretically. Five distinct dynamical modes, such as the merged, in-phase mode, rotation, flickering death, partially flickering death, and anti-phase modes, were computationally identified and interpreted from the perspective of vortex dynamics. A unified regime diagram was obtained in terms of the normalized flame frequency f/f_0 and the combined parameter (α-1)Gr^1/2, where α=l/D is the ratio of the flame separation distance l to the flame nozzle diameter D and Gr is the Grashof number. The bifurcation transition from the in-phase mode and the anti-phase mode to the totally or partially flickering death occurs at (α-1)Gr^1/2=655+-55. In addition, a Stuart-Landau model with a time-delay coupling was utilized to reproduce the general features and collective modes of the octuple oscillators flame systems.

physics.flu-dyn↗

arXiv2024

Deep learning and random light structuring ensure robust free-space communications

Having shown early promise, free-space optical communications (FSO) face formidable challenges in the age of information explosion. The ever-growing demand for greater channel communication capacity is one of the challenges. The inter-channel crosstalk, which severely degrades the quality of transmitted information, creates another roadblock in the way of efficient FSO implementation. Here we advance theoretically and realize experimentally a potentially high-capacity FSO protocol that enables high-fidelity transfer of an image, or set of images through a complex environment. In our protocol, we complement random light structuring at the transmitter with a deep learning image classification platform at the receiver. Multiplexing novel, independent, mutually orthogonal degrees of freedom available to structured random light can potentially significantly boost the channel communication capacity of our protocol without introducing any deleterious crosstalk. Specifically, we show how one can multiplex the degrees of freedom associated with the source coherence radius and a spatial position of a beamlet within an array of structured random beams to greatly enhance the capacity of our communication link. The superb resilience of structured random light to environmental noise, as well as extreme efficiency of deep learning networks at classifying images guarantees high-fidelity image transfer within the framework of our protocol.

physics.optics↗

arXiv2024

Self-supervised Learning for Electroencephalogram: A Systematic Survey

Electroencephalogram (EEG) is a non-invasive technique to record bioelectrical signals. Integrating supervised deep learning techniques with EEG signals has recently facilitated automatic analysis across diverse EEG-based tasks. However, the label issues of EEG signals have constrained the development of EEG-based deep models. Obtaining EEG annotations is difficult that requires domain experts to guide collection and labeling, and the variability of EEG signals among different subjects causes significant label shifts. To solve the above challenges, self-supervised learning (SSL) has been proposed to extract representations from unlabeled samples through well-designed pretext tasks. This paper concentrates on integrating SSL frameworks with temporal EEG signals to achieve efficient representation and proposes a systematic review of the SSL for EEG signals. In this paper, 1) we introduce the concept and theory of self-supervised learning and typical SSL frameworks. 2) We provide a comprehensive review of SSL for EEG analysis, including taxonomy, methodology, and technique details of the existing EEG-based SSL frameworks, and discuss the difference between these methods. 3) We investigate the adaptation of the SSL approach to various downstream tasks, including the task description and related benchmark datasets. 4) Finally, we discuss the potential directions for future SSL-EEG research.

eess.SP↗

arXiv2023

Guidelines in Wastewater-based Epidemiology of SARS-CoV-2 with Diagnosis

With the global spread and increasing transmission rate of SARS-CoV-2, more and more laboratories and researchers are turning their attention to wastewater-based epidemiology (WBE), hoping it can become an effective tool for large-scale testing and provide more ac-curate predictions of the number of infected individuals. Based on the cases of sewage sampling and testing in some regions such as Hong Kong, Brazil, and the United States, the feasibility of detecting the novel coronavirus in sewage is extremely high. This study re-views domestic and international achievements in detecting SARS-CoV-2 through WBE and summarizes four aspects of COVID-19, including sampling methods, virus decay rate cal-culation, standardized population coverage of the watershed, algorithm prediction, and provides ideas for combining field modeling with epidemic prevention and control. Moreover, we highlighted some diagnostic techniques for detection of the virus from sew-age sample. Our review is a new approach in identification of the research gaps in waste water-based epidemiology and diagnosis and we also predict the future prospect of our analysis.

q-bio.QM↗

arXiv2023

Infrared Small Target Detection Using Double-Weighted Multi-Granularity Patch Tensor Model With Tensor-Train Decomposition

Infrared small target detection plays an important role in the remote sensing fields. Therefore, many detection algorithms have been proposed, in which the infrared patch-tensor (IPT) model has become a mainstream tool due to its excellent performance. However, most IPT-based methods face great challenges, such as inaccurate measure of the tensor low-rankness and poor robustness to complex scenes, which will leadto poor detection performance. In order to solve these problems, this paper proposes a novel double-weighted multi-granularity infrared patch tensor (DWMGIPT) model. First, to capture different granularity information of tensor from multiple modes, a multi-granularity infrared patch tensor (MGIPT) model is constructed by collecting nonoverlapping patches and tensor augmentation based on the tensor train (TT) decomposition. Second, to explore the latent structure of tensor more efficiently, we utilize the auto-weighted mechanism to balance the importance of information at different granularity. Then, the steering kernel (SK) is employed to extract local structure prior, which suppresses background interference such as strong edges and noise. Finally, an efficient optimization algorithm based on the alternating direction method of multipliers (ADMM) is presented to solve the model. Extensive experiments in various challenging scenes show that the proposed algorithm is robust to noise and different scenes. Compared with the other eight state-of-the-art methods, different evaluation metrics demonstrate that our method achieves better detection performance in various complex scenes.

cs.CV↗

arXiv2023

Dynamical Behaviors of Small-scale Buoyant Diffusion Flame Oscillators in Externally Swirling Flows

Small-scale flickering buoyant diffusion flames in externally swirling flows were computationally investigated with a particular interest in identifying and characterizing various distinct dynamical behaviors of the flame oscillators under different swirling flow conditions. By varying the external swirl, six distinct flame dynamical modes, such as the flickering flame, the oscillating flame, the steady flame, the lifted flame, the spiral flame, and the flame with a vortex bubble, were computationally identified in both physical and phase spaces and analyzed from the perspective of vortex dynamics. Specifically, the frequency of buoyancy-induced flame flicker nonlinearly increases with the swirling intensity in the weak swirl regime. Further increasing the swirling intensity causes the vortex shedding to occur either around the flame tip or downstream of the flame, and the flame stops flickering but oscillates with small amplitude or stays in a steady state. A sufficiently high swirling intensity locally extinguishes the flame at its base, leading to a lifted flame. In addition, the spiral mode and the vortex-bubble mode were found for the flame at large swirl angles. Through establishing the phase portrait for featuring the flow in flames, the dynamical behaviors are presented and compared in phase space.

physics.flu-dyn↗

arXiv2023

Understand Code Style: Efficient CNN-based Compiler Optimization Recognition System

Compiler optimization level recognition can be applied to vulnerability discovery and binary analysis. Due to the exists of many different compilation optimization options, the difference in the contents of the binary file is very complicated. There are thousands of compiler optimization algorithms and multiple different processor architectures, so it is very difficult to manually analyze binary files and recognize its compiler optimization level with rules. This paper first proposes a CNN-based compiler optimization level recognition model: BinEye. The system extracts semantic and structural differences and automatically recognize the compiler optimization levels. The model is designed to be very suitable for binary file processing and is easy to understand. We built a dataset containing 80,028 binary files for the model training and testing. Our proposed model achieves an accuracy of over 97%. At the same time, BinEye is a fully CNN-based system and it has a faster forward calculation speed, at least 8 times faster than the normal RNN-based model. Through our analysis of the model output, we successfully found the difference in assembly codes caused by the different compiler optimization level. This means that the model we proposed is interpretable. Based on our model, we propose a method to analyze the code differences caused by different compiler optimization levels, which has great guiding significance for analyzing closed source compilers and binary security analysis.

cs.PL↗

arXiv2022

Happiness Maximizing Sets under Group Fairness Constraints (Technical Report)

Finding a happiness maximizing set (HMS) from a database, i.e., selecting a small subset of tuples that preserves the best score with respect to any nonnegative linear utility function, is an important problem in multi-criteria decision-making. When an HMS is extracted from a set of individuals to assist data-driven algorithmic decisions such as hiring and admission, it is crucial to ensure that the HMS can fairly represent different groups of candidates without bias and discrimination. However, although the HMS problem was extensively studied in the database community, existing algorithms do not take group fairness into account and may provide solutions that under-represent some groups. In this paper, we propose and investigate a fair variant of HMS (FairHMS) that not only maximizes the minimum happiness ratio but also guarantees that the number of tuples chosen from each group falls within predefined lower and upper bounds. Similar to the vanilla HMS problem, we show that FairHMS is NP-hard in three and higher dimensions. Therefore, we first propose an exact interval cover-based algorithm called IntCov for FairHMS on two-dimensional databases. Then, we propose a bicriteria approximation algorithm called BiGreedy for FairHMS on multi-dimensional databases by transforming it into a submodular maximization problem under a matroid constraint. We also design an adaptive sampling strategy to improve the practical efficiency of BiGreedy. Extensive experiments on real-world and synthetic datasets confirm the efficacy and efficiency of our proposal.

cs.DB↗

arXiv2021

Highly directional and coherent emission from dark excitons enabled by bound states in the continuum

A double-edged sword in two-dimensional material science and technology is an optically forbidden dark exciton. On the one hand, it is fascinating for condensed matter physics, quantum information processing, and optoelectronics due to its long lifetime. On the other hand, it is notorious for being optically inaccessible from both excitation and detection standpoints. Here, we provide an efficient and low-loss solution to the dilemma by reintroducing photonics bound states in the continuum (BICs) to manipulate dark excitons in the momentum space. In a monolayer tungsten diselenide under normal incidence, we observed a giant enhancement with an enhancement factor of ~3,100 for dark excitons enabled by transverse magnetic BICs with intrinsic out-of-plane electric fields. By further employing widely tunable Friedrich-Wintgen BICs, we demonstrated highly directional emission from the dark excitons with a divergence angle of merely 7 degrees. We found that the directional emission is coherent at room temperature, unambiguously shown in polarization analyses and interference measurements. Therefore, the BICs reintroduced as a momentum-space photonic environment could be an intriguing platform to reshape and redefine light-matter interactions in nearby quantum materials, such as low-dimensional materials, otherwise challenging or even impossible to achieve.

physics.optics↗

arXiv2021

A universal deep learning strategy for designing high-quality-factor photonic resonances

Resonance is instrumental in modern optics and photonics for novel phenomena such as cavity quantum electrodynamics and electric-field-induced transparency. While one can use numerical simulations to sweep geometric and material parameters of optical structures, these simulations usually require considerably long calculation time (spanning from several hours to several weeks) and substantial computational resources. Such requirements significantly limit their applicability in understanding and inverse designing structures with desired resonance performances. Recently, the introduction of artificial intelligence allows for faster predictions of resonance with less demanding computational requirements. However, current end-to-end deep learning approaches generally fail to predict resonances with high quality-factors (Q-factor). Here, we introduce a universal deep learning strategy that can predict ultra-high Q-factor resonances by decomposing spectra with an adaptive data acquisition (ADA) method while incorporating resonance information. We exploit bound states in the continuum (BICs) with an infinite Q-factor to testify this resonance-informed deep learning (RIDL) strategy. The trained RIDL strategy achieves high-accuracy prediction of reflection spectra and photonic band structures while using a considerably small training dataset. We further develop an inverse design algorithm based on the RIDL strategy for a symmetry-protected BIC on a suspended silicon nitride photonic crystal (PhC) slab. The predicted and measured angle-resolved band structures show minimum differences. We expect the RIDL strategy to apply to many other physical phenomena which exhibit Gaussian, Lorentzian, and Fano resonances.

physics.optics↗

arXiv2021

Efficient Processing of k-regret Minimization Queries with Theoretical Guarantees

Assisting end users to identify desired results from a large dataset is an important problem for multi-criteria decision making. To address this problem, top-k and skyline queries have been widely adopted, but they both have inherent drawbacks, i.e., the user either has to provide a specific utility function or faces many results. The k-regret minimization query is proposed, which integrates the merits of top-k and skyline queries. Due to the NP-hardness of the problem, the k-regret minimization query is time consuming and the greedy framework is widely adopted. However, formal theoretical analysis of the greedy approaches for the quality of the returned results is still lacking. In this paper, we first fill this gap by conducting a nontrivial theoretical analysis of the approximation ratio of the returned results. To speed up query processing, a sampling-based method, StocPreGreed,, is developed to reduce the evaluation cost. In addition, a theoretical analysis of the required sample size is conducted to bound the quality of the returned results. Finally, comprehensive experiments are conducted on both real and synthetic datasets to demonstrate the efficiency and effectiveness of the proposed methods.

cs.DB↗

arXiv2020

Single Image Super-resolution via Dense Blended Attention Generative Adversarial Network for Clinical Diagnosis

During training phase, more connections (e.g. channel concatenation in last layer of DenseNet) means more occupied GPU memory and lower GPU utilization, requiring more training time. The increase of training time is also not conducive to launch application of SR algorithms. This's why we abandoned DenseNet as basic network. Futhermore, we abandoned this paper due to its limitation only applied on medical images. Please view our lastest work applied on general images at arXiv:1911.03464.

eess.IV↗

arXiv2020

Perception-oriented Single Image Super-Resolution via Dual Relativistic Average Generative Adversarial Networks

The presence of residual and dense neural networks which greatly promotes the development of image Super-Resolution(SR) have witnessed a lot of impressive results. Depending on our observation, although more layers and connections could always improve performance, the increase of model parameters is not conducive to launch application of SR algorithms. Furthermore, algorithms supervised by L1/L2 loss can achieve considerable performance on traditional metrics such as PSNR and SSIM, yet resulting in blurry and over-smoothed outputs without sufficient high-frequency details, namely low perceptual index(PI). Regarding the issues, this paper develops a perception-oriented single image SR algorithm via dual relativistic average generative adversarial networks. In the generator part, a novel residual channel attention block is proposed to recalibrate significance of specific channels, further increasing feature expression capabilities. Parameters of convolutional layers within each block are shared to expand receptive fields while maintain the amount of tunable parameters unchanged. The feature maps are subsampled using sub-pixel convolution to obtain reconstructed high-resolution images. The discriminator part consists of two relativistic average discriminators that work in pixel domain and feature domain, respectively, fully exploiting the prior that half of data in a mini-batch are fake. Different weighted combinations of perceptual loss and adversarial loss are utilized to supervise the generator to equilibrate perceptual quality and objective results. Experimental results and ablation studies show that our proposed algorithm can rival state-of-the-art SR algorithms, both perceptually(PI-minimization) and objectively(PSNR-maximization) with fewer parameters.

eess.IV↗

arXiv2019

Medical image super-resolution method based on dense blended attention network

In order to address the issue that medical image would suffer from severe blurring caused by the lack of high-frequency details in the process of image super-resolution reconstruction, a novel medical image super-resolution method based on dense neural network and blended attention mechanism is proposed. The proposed method adds blended attention blocks to dense neural network(DenseNet), so that the neural network can concentrate more attention to the regions and channels with sufficient high-frequency details. Batch normalization layers are removed to avoid loss of high-frequency texture details. Final obtained high resolution medical image are obtained using deconvolutional layers at the very end of the network as up-sampling operators. Experimental results show that the proposed method has an improvement of 0.05db to 11.25dB and 0.6% to 14.04% on the peak signal-to-noise ratio(PSNR) metric and structural similarity index(SSIM) metric, respectively, compared with the mainstream image super-resolution methods. This work provides a new idea for theoretical studies of medical image super-resolution reconstruction.

cs.CV↗

arXiv2015

Vehicle Speed Prediction using Deep Learning

Global optimization of the energy consumption of dual power source vehicles such as hybrid electric vehicles, plug-in hybrid electric vehicles, and plug in fuel cell electric vehicles requires knowledge of the complete route characteristics at the beginning of the trip. One of the main characteristics is the vehicle speed profile across the route. The profile will translate directly into energy requirements for a given vehicle. However, the vehicle speed that a given driver chooses will vary from driver to driver and from time to time, and may be slower, equal to, or faster than the average traffic flow. If the specific driver speed profile can be predicted, the energy usage can be optimized across the route chosen. The purpose of this paper is to research the application of Deep Learning techniques to this problem to identify at the beginning of a drive cycle the driver specific vehicle speed profile for an individual driver repeated drive cycle, which can be used in an optimization algorithm to minimize the amount of fossil fuel energy used during the trip.

cs.LG↗

arXiv2001

Optimal Constructions of Hybrid Algorithms

We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda <= w, we have a computer with lambda disjoint memory areas, each of which can be used to run a basic algorithm and store its intermediate results. In the worst case, only one basic algorithm can solve Q in finite time, and all the other basic algorithms run forever without solving Q. To solve Q with a hybrid algorithm constructed from the basic algorithms, we run a basic algorithm for some time, then switch to another, and continue this process until Q is solved. The goal is to solve Q in the least amount of time. Using competitive ratios to measure the efficiency of a hybrid algorithm, we construct an optimal deterministic hybrid algorithm and an efficient randomized hybrid algorithm. This resolves an open question on searching with multiple robots posed by Baeza-Yates, Culberson and Rawlins. We also prove that our randomized algorithm is optimal for lambda = 1, settling a conjecture of Kao, Reif and Tate.

cs.DM↗