Searcharxiv⌕ Search

arXiv subjects

Sheng Wu

Publications and source records attributed to Sheng Wu.

At least 37 records · Page 2Linked to original sources

DecomCAM: Advancing Beyond Saliency Maps through Decomposition and Integration

Interpreting complex deep networks, notably pre-trained vision-language models (VLMs), is a formidable challenge. Current Class Activation Map (CAM) methods highlight regions revealing the model's decision-making basis but lack clear saliency maps and detailed interpretability. To bridge this gap, we propose DecomCAM, a novel decomposition-and-integration method that distills shared patterns from channel activation maps. Utilizing singular value decomposition, DecomCAM decomposes class-discriminative activation maps into orthogonal sub-saliency maps (OSSMs), which are then integrated together based on their contribution to the target concept. Extensive experiments on six benchmarks reveal that DecomCAM not only excels in locating accuracy but also achieves an optimizing balance between interpretability and computational efficiency. Further analysis unveils that OSSMs correlate with discernible object components, facilitating a granular understanding of the model's reasoning. This positions DecomCAM as a potential tool for fine-grained interpretation of advanced deep learning models. The code is avaible at https://github.com/CapricornGuang/DecomCAM.

cs.CV↗

Integrated Sensing-Communication-Computation for Edge Artificial Intelligence

Edge artificial intelligence (AI) has been a promising solution towards 6G to empower a series of advanced techniques such as digital twins, holographic projection, semantic communications, and auto-driving, for achieving intelligence of everything. The performance of edge AI tasks, including edge learning and edge AI inference, depends on the quality of three highly coupled processes, i.e., sensing for data acquisition, computation for information extraction, and communication for information transmission. However, these three modules need to compete for network resources for enhancing their own quality-of-services. To this end, integrated sensing-communication-computation (ISCC) is of paramount significance for improving resource utilization as well as achieving the customized goals of edge AI tasks. By investigating the interplay among the three modules, this article presents various kinds of ISCC schemes for federated edge learning tasks and edge AI inference tasks in both application and physical layers.

cs.IT↗

AIMDiT: Modality Augmentation and Interaction via Multimodal Dimension Transformation for Emotion Recognition in Conversations

Emotion Recognition in Conversations (ERC) is a popular task in natural language processing, which aims to recognize the emotional state of the speaker in conversations. While current research primarily emphasizes contextual modeling, there exists a dearth of investigation into effective multimodal fusion methods. We propose a novel framework called AIMDiT to solve the problem of multimodal fusion of deep features. Specifically, we design a Modality Augmentation Network which performs rich representation learning through dimension transformation of different modalities and parameter-efficient inception block. On the other hand, the Modality Interaction Network performs interaction fusion of extracted inter-modal features and intra-modal features. Experiments conducted using our AIMDiT framework on the public benchmark dataset MELD reveal 2.34% and 2.87% improvements in terms of the Acc-7 and w-F1 metrics compared to the state-of-the-art (SOTA) models.

cs.MM↗

A2CI: A Cloud-based, Service-oriented Geospatial Cyberinfrastructure to Support Atmospheric Research

Big earth science data offers the scientific community great opportunities. Many more studies at large-scales, over long-terms and at high resolution can now be conducted using the rich information collected by remote sensing satellites, ground-based sensor networks, and even social media input. However, the hundreds of terabytes of information collected and compiled on an hourly basis by NASA and other government agencies present a significant challenge for atmospheric scientists seeking to improve the understanding of the Earth atmospheric system. These challenges include effective discovery, organization, analysis and visualization of large amounts of data. This paper reports the outcomes of an NSF-funded project that developed a geospatial cyberinfrastructure -- the A2CI (Atmospheric Analysis Cyberinfrastructure) -- to support atmospheric research. We first introduce the service-oriented system framework then describe in detail the implementation of the data discovery module, data management module, data integration module, data analysis and visualization modules following the cloud computing principles-Data-as-a-Service, Software-as-a-Service, Platform-as-a-Service and Infrastructure-as-a-Service. We demonstrate the graphic user interface by performing an analysis between Sea Surface Temperature and the intensity of tropical storms in the North Atlantic and Pacific oceans. We expect this work to contribute to the technical advancement of cyberinfrastructure research as well as to the development of an online, collaborative scientific analysis system for atmospheric science.

cs.CY↗

Integrated Sensing-Communication-Computation for Over-the-Air Edge AI Inference

Edge-device co-inference refers to deploying well-trained artificial intelligent (AI) models at the network edge under the cooperation of devices and edge servers for providing ambient intelligent services. For enhancing the utilization of limited network resources in edge-device co-inference tasks from a systematic view, we propose a task-oriented scheme of integrated sensing, computation and communication (ISCC) in this work. In this system, all devices sense a target from the same wide view to obtain homogeneous noise-corrupted sensory data, from which the local feature vectors are extracted. All local feature vectors are aggregated at the server using over-the-air computation (AirComp) in a broadband channel with the orthogonal-frequency-division-multiplexing technique for suppressing the sensing and channel noise. The aggregated denoised global feature vector is further input to a server-side AI model for completing the downstream inference task. A novel task-oriented design criterion, called maximum minimum pair-wise discriminant gain, is adopted for classification tasks. It extends the distance of the closest class pair in the feature space, leading to a balanced and enhanced inference accuracy. Under this criterion, a problem of joint sensing power assignment, transmit precoding and receive beamforming is formulated. The challenge lies in three aspects: the coupling between sensing and AirComp, the joint optimization of all feature dimensions' AirComp aggregation over a broadband channel, and the complicated form of the maximum minimum pair-wise discriminant gain. To solve this problem, a task-oriented ISCC scheme with AirComp is proposed. Experiments based on a human motion recognition task are conducted to verify the advantages of the proposed scheme over the existing scheme and a baseline.

cs.IT↗

Self-Enhancement Improves Text-Image Retrieval in Foundation Visual-Language Models

The emergence of cross-modal foundation models has introduced numerous approaches grounded in text-image retrieval. However, on some domain-specific retrieval tasks, these models fail to focus on the key attributes required. To address this issue, we propose a self-enhancement framework, A^{3}R, based on the CLIP-ViT/G-14, one of the largest cross-modal models. First, we perform an Attribute Augmentation strategy to enrich the textual description for fine-grained representation before model learning. Then, we propose an Adaption Re-ranking method to unify the representation space of textual query and candidate images and re-rank candidate images relying on the adapted query after model learning. The proposed framework is validated to achieve a salient improvement over the baseline and other teams' solutions in the cross-modal image retrieval track of the 1st foundation model challenge without introducing any additional samples. The code is available at \url{https://github.com/CapricornGuang/A3R}.

cs.CV↗

Hybrid Driven Learning for Channel Estimation in Intelligent Reflecting Surface Aided Millimeter Wave Communications

Intelligent reflecting surfaces (IRS) have been proposed in millimeter wave (mmWave) and terahertz (THz) systems to achieve both coverage and capacity enhancement, where the design of hybrid precoders, combiners, and the IRS typically relies on channel state information. In this paper, we address the problem of uplink wideband channel estimation for IRS aided multiuser multiple-input single-output (MISO) systems with hybrid architectures. Combining the structure of model driven and data driven deep learning approaches, a hybrid driven learning architecture is devised for joint estimation and learning the properties of the channels. For a passive IRS aided system, we propose a residual learned approximate message passing as a model driven network. A denoising and attention network in the data driven network is used to jointly learn spatial and frequency features. Furthermore, we design a flexible hybrid driven network in a hybrid passive and active IRS aided system. Specifically, the depthwise separable convolution is applied to the data driven network, leading to less network complexity and fewer parameters at the IRS side. Numerical results indicate that in both systems, the proposed hybrid driven channel estimation methods significantly outperform existing deep learning-based schemes and effectively reduce the pilot overhead by about 60% in IRS aided systems.

cs.IT↗

Distribution of gamma-ray bursts on the t90-hardness ratio plane and their classification revisited

Using four mixed bivariate distributions (Normal distribution, Skew-Normal distribution, Student distribution, Skew-Student distribution) and bootstrap re-sampling analysis, we analyze the samples of CGRO/BATSE, Swift/BAT and Fermi/GBM gamma-ray bursts in detail on the t90-hardness ratio plane. The Bayesian information criterion is used to judge the goodness of fit for each sample, comprehensively. It is found that all the three samples show a symmetric (either normal or student) distribution. It is also found that the existence of three classes of gamma-ray bursts is preferred by the three samples, but the strength of this preference varies with the sample size: when the sample size of the data set is larger, the preference of three classes scheme becomes weaker. Therefore, the appearance of an intermediate class may be caused by a small sample size and the possibility that there are only two classes of gamma-ray bursts still cannot be expelled yet. A further bootstrap re-sampling analysis also confirms this result.

astro-ph.HE↗

Asymptotic Average Mutual Information Over Finite Input Mixture Gamma Distributed Channels

This letter establishes a unified analytical framework to study the asymptotic average mutual information (AMI) of mixture gamma (MG) distributed fading channels driven by finite input signals in the high signal-to-noise ratio (SNR) regime. It is found that the AMI converges to some constant as the average SNR increases and its rate of convergence (ROC) is determined by the coding gain and diversity order. Moreover, the derived results are used to investigate the asymptotic optimal power allocation policy of a bank of parallel fading channels having finite inputs. It is suggested that in the high SNR region, the sub-channel with a lower coding gain or diversity order should be allocated with more power. Finally, numerical results are provided to collaborate the theoretical analyses.

cs.IT↗

Physical Layer Security Over Mixture Gamma Distributed Fading Channels With Discrete Inputs: A Unified and General Analytical Framework

Physical layer security is investigated over mixture Gamma (MG) distributed fading channels with discrete inputs. By the Gaussian quadrature rules, closed-form expressions are derived to characterize the average secrecy rate (ASR) and secrecy outage probability (SOP), whose accuracy is validated by numerical simulations. To show more properties of the finite-alphabet signaling, we perform an asymptotic analysis on the secrecy metrics in the large limit of the average signal-to-noise ratio (SNR) of the main channel. Leveraging the Mellin transform, we find that the ASR and SOP converge to some constants as the average SNR increases and we derive novel expressions to characterize the rates of convergence. This work establishes a unified and general analytical framework for the secrecy performance achieved by discrete inputs.

eess.SP↗

Decentralized Blockchain for Privacy-Preserving Large-Scale Contact Tracing

Activity-tracking applications and location-based services using short-range communication (SRC) techniques have been abruptly demanded in the COVID-19 pandemic, especially for automated contact tracing. The attention from both public and policy keeps raising on related practical problems, including \textit{1) how to protect data security and location privacy? 2) how to efficiently and dynamically deploy SRC Internet of Thing (IoT) witnesses to monitor large areas?} To answer these questions, in this paper, we propose a decentralized and permissionless blockchain protocol, named \textit{Bychain}. Specifically, 1) a privacy-preserving SRC protocol for activity-tracking and corresponding generalized block structure is developed, by connecting an interactive zero-knowledge proof protocol and the key escrow mechanism. As a result, connections between personal identity and the ownership of on-chain location information are decoupled. Meanwhile, the owner of the on-chain location data can still claim its ownership without revealing the private key to anyone else. 2) An artificial potential field-based incentive allocation mechanism is proposed to incentivize IoT witnesses to pursue the maximum monitoring coverage deployment. We implemented and evaluated the proposed blockchain protocol in the real-world using the Bluetooth 5.0. The storage, CPU utilization, power consumption, time delay, and security of each procedure and performance of activities are analyzed. The experiment and security analysis is shown to provide a real-world performance evaluation.

cs.CR↗

Secrecy Performance for Finite-Alphabet Inputs Over Fluctuating Two-Ray Channels in FDA Communications

To provide system design insights for practical communication systems equipped with the frequency diverse array (FDA), this paper investigates the secrecy performance of FDA systems exploiting finite-alphabet inputs over fluctuating two-ray (FTR) fading channels. More specifically, closed-form expressions for the average secrecy rate (ASR) and the secrecy outage probability (SOP) are derived, while their correctness is confirmed by numerical simulations. In addition, we perform asymptotic analysis to quantify the secrecy performance gap between Gaussian and finite-alphabet inputs, for a sufficiently large average signal-to-noise ratio (SNR) of the main channel. Compared with Gaussian inputs-based research, this letter focuses on practical scenarios which sheds lights on properties of FDA systems.

eess.SP↗

Ergodic Mutual Information for Generalized Fadings

In this paper, novel expressions are derived to evaluate the ergodic mutual information (EMI) under BPSK modulation of single-input single-output (SISO) systems operating in generalized fading channels, including $η$-$μ$ fading and $κ$-$μ$ fading. To verify our derivation, we first investigate the specific fading types, namely Rayleigh, Nakagami-$m$ and Rician, and then turn to generalized fading scenarios. It is shown that all the expressions concluded from the generalized cases can be specialized into those derived from the specific ones. Different from the conventional results of the EMI, our developed expressions contain only the simplest numerical calculations, without any Meijer's G-functions which must be implemented in the particular computing software. Additionally, it should be noted that our work provides a complete analysis of the EMI in wireless channel under discrete inputs.

eess.SP↗

Mutual Information Approximation

To provide an efficient approach to characterize the input-output mutual information (MI) under additive white Gaussian noise (AWGN) channel, this short report fits the curves of exact MI under multilevel quadrature amplitude modulation (M-QAM) signal inputs via multi-exponential decay curve fitting (M-EDCF). Even though the definition expression for instanious MI versus Signal to Noise Ratio (SNR) is complex and the containing integral is intractable, our new developed fitting formula holds a neat and compact form, which possesses high precision as well as low complexity. Generally speaking, this approximation formula of MI can promote the research of performance analysis in practical communication system under discrete inputs.

cs.IT↗

Weakly Supervised Person Re-Identification

In the conventional person re-id setting, it is assumed that the labeled images are the person images within the bounding box for each individual; this labeling across multiple nonoverlapping camera views from raw video surveillance is costly and time-consuming. To overcome this difficulty, we consider weakly supervised person re-id modeling. The weak setting refers to matching a target person with an untrimmed gallery video where we only know that the identity appears in the video without the requirement of annotating the identity in any frame of the video during the training procedure. Hence, for a video, there could be multiple video-level labels. We cast this weakly supervised person re-id challenge into a multi-instance multi-label learning (MIML) problem. In particular, we develop a Cross-View MIML (CV-MIML) method that is able to explore potential intraclass person images from all the camera views by incorporating the intra-bag alignment and the cross-view bag alignment. Finally, the CV-MIML method is embedded into an existing deep neural network for developing the Deep Cross-View MIML (Deep CV-MIML) model. We have performed extensive experiments to show the feasibility of the proposed weakly supervised setting and verify the effectiveness of our method compared to related methods on four weakly labeled datasets.

cs.CV↗

Conditional Tail-Related Risk Estimation Using Composite Asymmetric Least Squares and Empirical Likelihood

In this article, by using composite asymmetric least squares (CALS) and empirical likelihood, we propose a two-step procedure to estimate the conditional value at risk (VaR) and conditional expected shortfall (ES) for the GARCH series. First, we perform asymmetric least square regressions at several significance levels to model the volatility structure and separate it from the innovation process in the GARCH model. Note that expectile can serve as a bond to make up the gap from VaR estimation to ES estimation because there exists a bijective mapping from expectiles to specific quantile, and ES can be induced by expectile through a simple formula. Then, we introduce the empirical likelihood method to determine the relation above; this method is data-driven and distribution-free. Theoretical studies guarantee the asymptotic properties, such as consistency and the asymptotic normal distribution of the estimator obtained by our proposed method. A Monte Carlo experiment and an empirical application are conducted to evaluate the performance of the proposed method. The results indicate that our proposed estimation method is competitive with some alternative existing tail-related risk estimation methods.

math.ST↗

A Unified Bayesian Inference Framework for Generalized Linear Models

In this letter, we present a unified Bayesian inference framework for generalized linear models (GLM) which iteratively reduces the GLM problem to a sequence of standard linear model (SLM) problems. This framework provides new perspectives on some established GLM algorithms derived from SLM ones and also suggests novel extensions for some other SLM algorithms. Specific instances elucidated under such framework are the GLM versions of approximate message passing (AMP), vector AMP (VAMP), and sparse Bayesian learning (SBL). It is proved that the resultant GLM version of AMP is equivalent to the well-known generalized approximate message passing (GAMP). Numerical results for 1-bit quantized compressed sensing (CS) demonstrate the effectiveness of this unified framework.

cs.IT↗

A Low Complexity OFDM Receiver with Combined GAMP and MF Message Passing

With a unified belief propagation (BP) and mean field (MF) framework, we propose an iterative message passing receiver, which performs joint channel state and noise precision (the reciprocal of noise variance) estimation and decoding for OFDM systems. The recently developed generalized approximate message passing (GAMP) is incorporated to the BP-MF framework, where MF is used to handle observation factor nodes with unknown noise precision and GAMP is used for channel estimation in the time-frequency domain. Compared to state-of-the-art algorithms in the literature, the proposed algorithm either delivers similar performance with much lower complexity, or delivers much better performance with similar complexity. In addition, the proposed algorithm exhibits fastest convergence.

cs.IT↗