arXiv subjects

Jie Huang

Publications and source records attributed to Jie Huang.

At least 109 records · Page 6Linked to original sources

arXiv2025

Distributed Nash Equilibrium Seeking for Constrained Aggregative Games over Jointly Connected and Weight-Balanced Switching Networks

The property of the communication network and the constraints on the strategic space are two factors that determine the complexity of the distributed Nash equilibrium (DNE) seeking problem. The DNE seeking problem of aggregative games has been studied for unconstrained case over all types of communication networks and for various types of constrained games over static and connected communication networks. In this paper, we investigate the DNE seeking problem for constrained aggregative games over jointly connected and weight-balanced switching networks, which can be directed and disconnected at every time instant. By integrating the projected gradient technique and the dynamic average consensus algorithm, we convert our problem to the stability problem of a well-defined time-varying nonlinear system. By constructing a time-varying Lyapunov's function candidate for this time-varying nonlinear system, we conduct a rigorous Lyapunov's analysis to conclude the exponential stability of this system and hence solve our problem.

math.OC↗

arXiv2025

Data-Driven Cooperative Output Regulation via Distributed Internal Model

The existing result on the cooperative output regulation problem for unknown linear multi-agent systems using a data-driven distributed internal model approach is limited to the case where each follower is a single-input and single-output system and the communication network among all agents is an acyclic static digraph. In this paper, we further address the same problem for unknown linear multi-agent systems with multi-input and multi-output followers over a general static and connected digraph. Further we make two main improvements over the existing result. First, we derive a set of much simplified linear systems to be applied by the integral reinforcement learning technique. Thus, the number of the unknown variables governed by a sequence of linear algebraic equations is much smaller than that of the existing approach. Second, we show that the sequence of linear algebraic equations can be further decoupled to two sequences of linear algebraic equations. As a result of these two improvements, our approach not only drastically reduces the computational cost, but also significantly weakens the solvability conditions in terms of the the full column rank requirements for these equations.

math.OC↗

arXiv2025

Wavelet-Assisted Multi-Frequency Attention Network for Pansharpening

Pansharpening aims to combine a high-resolution panchromatic (PAN) image with a low-resolution multispectral (LRMS) image to produce a high-resolution multispectral (HRMS) image. Although pansharpening in the frequency domain offers clear advantages, most existing methods either continue to operate solely in the spatial domain or fail to fully exploit the benefits of the frequency domain. To address this issue, we innovatively propose Multi-Frequency Fusion Attention (MFFA), which leverages wavelet transforms to cleanly separate frequencies and enable lossless reconstruction across different frequency domains. Then, we generate Frequency-Query, Spatial-Key, and Fusion-Value based on the physical meanings represented by different features, which enables a more effective capture of specific information in the frequency domain. Additionally, we focus on the preservation of frequency features across different operations. On a broader level, our network employs a wavelet pyramid to progressively fuse information across multiple scales. Compared to previous frequency domain approaches, our network better prevents confusion and loss of different frequency features during the fusion process. Quantitative and qualitative experiments on multiple datasets demonstrate that our method outperforms existing approaches and shows significant generalization capabilities for real-world scenarios.

eess.IV↗

arXiv2025

Recent Advances of 6G Ultra-Massive MIMO Technologies in Spatial and Beam Domains

To explore the full potential of ultra-massive multiple-input multiple-output (MIMO) communication systems, it is fundamental to understand new ultra-massive MIMO channel characteristics and establish pervasive channel models. On this basis, large dimensional spatial-temporal transmission and random access technologies need to be investigated and evaluated for better practical implementation. Firstly, this paper reviews recent advances of ultra-massive MIMO technologies in the traditional spatial domain, including wireless channel characterization and modeling, channel estimation, spatial multiplexing, and precoding. Secondly, considering the dramatic increase of base station (BS) antennas and access users in ultra-massive MIMO systems, the confronted high dimensional complexity and computing burden of these ultra-massive MIMO technologies are indicated. To provide efficient and systematic solution, the emerging tendency to transform related technologies from the traditional spatial domain to beam domain is introduced. The utilities of large sparsity merit, reduced energy consumption, and improved usage of radio frequency (RF) chains in the beam domain channel are elaborated. At last, future challenges of ultra-massive MIMO communication systems are discussed.

cs.IT↗

arXiv2025

A Novel Non-Stationary Channel Emulator for 6G MIMO Wireless Channels

The performance evaluation of sixth generation (6G) communication systems is anticipated to be a controlled and repeatable process in the lab, which brings up the demand for wireless channel emulators. However, channel emulation for 6G space-time-frequency (STF) non-stationary channels is missing currently. In this paper, a non-stationary multiple-input multiple-output (MIMO) geometry-based stochastic model (GBSM) that accurately characterizes the channel STF properties is introduced firstly. Then, a subspace-based method is proposed for reconstructing the channel fading obtained from the GBSM and a channel emulator architecture with frequency domain processing is presented for 6G MIMO systems. Moreover, the spatial time-varying channel transfer functions (CTFs) of the channel simulation and the channel emulation are compared and analyzed. The Doppler power spectral density (PSD) and delay PSD are further derived and compared between the channel model simulation and subspace-based emulation. The results demonstrate that the proposed channel emulator is capable of reproducing the non-stationary channel characteristics.

eess.SY↗

arXiv2025

Beam Domain Channel Estimation for Spatial Non-Stationary Massive MIMO Systems

In massive multiple-input multiple-output (MIMO) systems, the channel estimation scheme is subject to the spatial non-stationarity and inevitably power leakage in the beam domain. In this paper, a beam domain channel estimation scheme is investigated for spatial non-stationary (SNS) massive MIMO systems considering power leakage. %a novel beam domain channel estimation scheme is proposed for spatial non-stationary (SNS) massive MIMO systems. Specifically, a realistic massive MIMO beam domain channel model (BDCM) is introduced to capture the spatial non-stationarity considering power leakage by introducing the illustration of visibility region (VR). Then, a beam domain structure-based sparsity adaptive matching pursuit (BDS-SAMP) scheme is proposed based on the cross-block sparse structure and power ratio threshold of beam domain channel. Finally, the simulation results validate the accuracy of proposed BDS-SAMP scheme with low pilot overhead and reasonable complexity by comparing with conventional schemes.

eess.SY↗

arXiv2025

Wireless Channel Measurements and Characterization in Industrial IoT Scenarios

Wireless Fidelity (Wi-Fi) communication technologies hold significant potential for realizing the Industrial Internet of Things (IIoT). In this paper, both Single-Input Single-Output (SISO) and polarized Multiple-Input Multiple-Output (MIMO) channel measurements are conducted in an IIoT scenario at the less congested Wi-Fi band, i.e., 5.5~GHz. The purpose is to investigate wireless characteristics of communications between access points and terminals mounted on automated guided vehicles as well as those surrounding manufacturing areas. For SISO channel measurements, statistical properties including the delay Power Spectral Density (PSD), path loss, shadowing fading, delay spread, excess delay, K-factor, and amplitude distribution of small-scale fading are analyzed and compared with those observed in an office scenario. For MIMO channel measurements, results show that there are multiple Dense Multipath Component (DMC) processes in the delay PSD. An estimation algorithm based on the algorithm for a single DMC process is proposed to effectively process the multi-processes data. Moreover, delay, angular, power, and polarization properties of DMCs are investigated and compared with those of specular multipath components. Furthermore, effects of DMCs on Singular Values (SVs) and channel capacities are explored. Ignoring DMCs can overestimate SVs and underestimate channel capacities.

eess.SY↗

arXiv2025

A 3D Continuous-Space Electromagnetic Channel Model for 6G Tri-Polarized Multi-user Communications

It is envisioned that the sixth generation (6G) and beyond 6G (B6G) wireless communication networks will enable global coverage in space, air, ground, and sea. In this case, both base stations and users can be mobile and will tend to move continuously in three-dimensional (3D) space. Therefore, obtaining channel state information (CSI) in 3D continuous-space is crucial for the design and performance evaluation of future 6G and B6G wireless systems. On the other hand, new 6G technologies such as integrated sensing and communications (ISAC) will also require prior knowledge of CSI in 3D continuous-space. In this paper, a 3D continuous-space electromagnetic channel model is proposed for tri-polarized multi-user communications, taking into account scatterers and spherical wavefronts. Scattered fields are calculated using the method of moments (MoM) with high accuracy. Spherical wave functions are utilized to decompose the dyadic Green's functions that connect the transmitted source currents and the received electric fields. Simulation results demonstrate that transmit power, apertures, scatterers, and sample intervals have significant impacts on statistical properties and channel capacities, providing insights into the performance of continuous-space electromagnetic channel models and the design of future wireless systems.

eess.SY↗

arXiv2025

An Efficient Pre-Processing Method for 6G Dynamic Ray-Tracing Channel Modeling

The ray-tracing is often employed in urban areas for channel modeling with high accuracy but encounters a substantial computational complexity for high mobility scenarios. In this paper, we propose a novel pre-processing method for dynamic ray-tracing to reduce the computational burden in high-mobility scenarios by prepending the intersection judgment to the pre-processing stage. The proposed method generates an inter-visibility matrix that establishes visibility relationships among static objects in the environment considering the intersection judgment. Moreover, the inter-visibility matrix can be employed to create the inter-visibility table for mobile transmitters and receivers, which can improve the efficiency of constructing an image tree for the three-dimensional (3D) dynamic ray-tracing method. The results show that the proposed pre-processing method in dynamic ray-tracing has considerable time-saving compared with the traditional method while maintaining the same accuracy. The channel characteristics computed by the proposed method can well match to the channel measurements.

eess.SP↗

arXiv2025

Ray-Tracing Channel Modeling for LEO Satellite-to-Ground Communication Systems

Based on the vision of global coverage for sixth-generation (6G) wireless communication systems, the low earth orbit (LEO) satellite-to-ground channel model for urban scenarios has emerged as highly important for the system design. In this paper, we propose an LEO satellite-to-ground channel model through shooting and bouncing rays (SBR) algorithm to analyze the channel characteristics. The orbit of LEO is modeled by the simplified general perturbations 4 (SGP4), and an accurate celestial model is applied to calculate the Doppler shift of multipath in a transmission time window of LEO satellite-to-ground communications. Channel characteristics of LEO satellite-to-ground communications such as the root-mean-square (RMS) delay spread, the Doppler shift, and the received power at different times are obtained. The simulation results show that the received power is only significantly noticeable in the transmission time window when the satellite is close to the receiver. Proposed model validates the effectiveness of ray-tracing in actual LEO satellite-to-ground communication scenarios and extends the calculation of the Doppler shift.

eess.SY↗

arXiv2025

Zygmund's theorem for harmonic quasiregular mappings

Given an analytic function $f=u+iv$ in the unit disk $\mathbb{D}$, Zygmund's theorem gives the minimal growth restriction on $u$ which ensures that $v$ is in the Hardy space $h^1$. This need not be true if $f$ is a complex-valued harmonic function. However, we prove that Zygmund's theorem holds if $f$ is a harmonic $K$-quasiregular mapping in $\ID$. Our work makes further progress on the recent Riesz-type theorem of Liu and Zhu (Adv. Math., 2023), and the Kolmogorov-type theorem of Kalaj (J. Math. Anal. Appl., 2025), for harmonic quasiregular mappings. We also obtain a partial converse, thus showing that the proposed growth condition is the best possible. Furthermore, as an application of the classical conjugate function theorems, we establish a harmonic analogue of a well-known result of Hardy and Littlewood.

math.CV↗

arXiv2024

RefHCM: A Unified Model for Referring Perceptions in Human-Centric Scenarios

Human-centric perceptions play a crucial role in real-world applications. While recent human-centric works have achieved impressive progress, these efforts are often constrained to the visual domain and lack interaction with human instructions, limiting their applicability in broader scenarios such as chatbots and sports analysis. This paper introduces Referring Human Perceptions, where a referring prompt specifies the person of interest in an image. To tackle the new task, we propose RefHCM (Referring Human-Centric Model), a unified framework to integrate a wide range of human-centric referring tasks. Specifically, RefHCM employs sequence mergers to convert raw multimodal data -- including images, text, coordinates, and parsing maps -- into semantic tokens. This standardized representation enables RefHCM to reformulate diverse human-centric referring tasks into a sequence-to-sequence paradigm, solved using a plain encoder-decoder transformer architecture. Benefiting from a unified learning strategy, RefHCM effectively facilitates knowledge transfer across tasks and exhibits unforeseen capabilities in handling complex reasoning. This work represents the first attempt to address referring human perceptions with a general-purpose framework, while simultaneously establishing a corresponding benchmark that sets new standards for the field. Extensive experiments showcase RefHCM's competitive and even superior performance across multiple human-centric referring tasks. The code and data are publicly at https://github.com/JJJYmmm/RefHCM.

cs.CV↗

arXiv2024

Neural Degradation Representation Learning for All-In-One Image Restoration

Existing methods have demonstrated effective performance on a single degradation type. In practical applications, however, the degradation is often unknown, and the mismatch between the model and the degradation will result in a severe performance drop. In this paper, we propose an all-in-one image restoration network that tackles multiple degradations. Due to the heterogeneous nature of different types of degradations, it is difficult to process multiple degradations in a single network. To this end, we propose to learn a neural degradation representation (NDR) that captures the underlying characteristics of various degradations. The learned NDR decomposes different types of degradations adaptively, similar to a neural dictionary that represents basic degradation components. Subsequently, we develop a degradation query module and a degradation injection module to effectively recognize and utilize the specific degradation based on NDR, enabling the all-in-one restoration ability for multiple degradations. Moreover, we propose a bidirectional optimization strategy to effectively drive NDR to learn the degradation representation by optimizing the degradation and restoration processes alternately. Comprehensive experiments on representative types of degradations (including noise, haze, rain, and downsampling) demonstrate the effectiveness and generalization capability of our method.

cs.CV↗

arXiv2024

Multimodal Sentiment Analysis Based on Causal Reasoning

With the rapid development of multimedia, the shift from unimodal textual sentiment analysis to multimodal image-text sentiment analysis has obtained academic and industrial attention in recent years. However, multimodal sentiment analysis is affected by unimodal data bias, e.g., text sentiment is misleading due to explicit sentiment semantic, leading to low accuracy in the final sentiment classification. In this paper, we propose a novel CounterFactual Multimodal Sentiment Analysis framework (CF-MSA) using causal counterfactual inference to construct multimodal sentiment causal inference. CF-MSA mitigates the direct effect from unimodal bias and ensures heterogeneity across modalities by differentiating the treatment variables between modalities. In addition, considering the information complementarity and bias differences between modalities, we propose a new optimisation objective to effectively integrate different modalities and reduce the inherent bias from each modality. Experimental results on two public datasets, MVSA-Single and MVSA-Multiple, demonstrate that the proposed CF-MSA has superior debiasing capability and achieves new state-of-the-art performances. We will release the code and datasets to facilitate future research.

cs.MM↗

arXiv2024

Take Package as Language: Anomaly Detection Using Transformer

Network data packet anomaly detection faces numerous challenges, including exploring new anomaly supervision signals, researching weakly supervised anomaly detection, and improving model interpretability. This paper proposes NIDS-GPT, a GPT-based causal language model for network intrusion detection. Unlike previous work, NIDS-GPT innovatively treats each number in the packet as an independent "word" rather than packet fields, enabling a more fine-grained data representation. We adopt an improved GPT-2 model and design special tokenizers and embedding layers to better capture the structure and semantics of network data. NIDS-GPT has good scalability, supports unsupervised pre-training, and enhances model interpretability through attention weight visualization. Experiments on the CICIDS2017 and car-hacking datasets show that NIDS-GPT achieves 100\% accuracy under extreme imbalance conditions, far surpassing traditional methods; it also achieves over 90\% accuracy in one-shot learning. These results demonstrate NIDS-GPT's excellent performance and potential in handling complex network anomaly detection tasks, especially in data-imbalanced and resource-constrained scenarios. The code is available at \url{https://github.com/woshixiaobai2019/nids-gpt.gi

cs.CR↗

arXiv2024

Long-form factuality in large language models

Large language models (LLMs) often generate content that contains factual errors when responding to fact-seeking prompts on open-ended topics. To benchmark a model's long-form factuality in open domains, we first use GPT-4 to generate LongFact, a prompt set comprising thousands of questions spanning 38 topics. We then propose that LLM agents can be used as automated evaluators for long-form factuality through a method which we call Search-Augmented Factuality Evaluator (SAFE). SAFE utilizes an LLM to break down a long-form response into a set of individual facts and to evaluate the accuracy of each fact using a multi-step reasoning process comprising sending search queries to Google Search and determining whether a fact is supported by the search results. Furthermore, we propose extending F1 score as an aggregated metric for long-form factuality. To do so, we balance the percentage of supported facts in a response (precision) with the percentage of provided facts relative to a hyperparameter representing a user's preferred response length (recall). Empirically, we demonstrate that LLM agents can outperform crowdsourced human annotators - on a set of ~16k individual facts, SAFE agrees with crowdsourced human annotators 72% of the time, and on a random subset of 100 disagreement cases, SAFE wins 76% of the time. At the same time, SAFE is more than 20 times cheaper than human annotators. We also benchmark thirteen language models on LongFact across four model families (Gemini, GPT, Claude, and PaLM-2), finding that larger language models generally achieve better long-form factuality. LongFact, SAFE, and all experimental code are available at https://github.com/google-deepmind/long-form-factuality.

cs.CL↗

arXiv2024

Distributed Nash Equilibrium Seeking for a Class of Uncertain Nonlinear Systems subject to Bounded Disturbances

In this paper, we study the problem of the distributed Nash equilibrium seeking of N-player games over jointly strongly connected switching networks. The action of each player is governed by a class of uncertain nonlinear systems. Our approach integrates the consensus algorithm, the distributed estimator over jointly strongly connected switching networks, and some adaptive control technique. Furthermore, we also consider the disturbance rejection problem for bounded disturbances with unknown bounds. A special case of our results gives the solution of the distributed Nash equilibrium seeking for high-order integrator systems.

math.OC↗

arXiv2024

Adaptive Output Synchronization for a Class of Uncertain Nonlinear Multi-Agent Systems over Switching Networks

In this paper, we first study the leader-following output synchronization problem for a class of uncertain nonlinear multi-agent systems over jointly connected switching networks. Our approach integrates the output-based adaptive distributed observer, the conventional adaptive control technique, and the output regulation theory. Compared with the existing results, our control law only relies on the output of the leader instead of the state of the leader and allows the followers and the leader to have different orders. Then, we further consider the rejection of a class of bounded disturbances with unknown bounds. Our problem includes the state consensus problem as a special case if the followers and the leader have the same order.

math.OC↗