Search arXiv⌕ Search

arXiv subjects

Fan Jiang

Publications and source records attributed to Fan Jiang.

At least 73 records · Page 4Linked to original sources

An Efficient Two-Dimensional Functional Mixed-Effect Model Framework for Repeatedly Measured Functional Data

With the rapid development of wearable device technologies, accelerometers can record minute-by-minute physical activity for consecutive days, which provides important insight into a dynamic association between the intensity of physical activity and mental health outcomes for large-scale population studies. Using Shanghai school adolescent cohort we estimate the effect of health assessment results on physical activity profiles recorded by accelerometers throughout a week, which is recognized as repeatedly measured functional data. To achieve this goal, we propose an innovative two-dimensional functional mixed-effect model (2dFMM) for the specialized data, which smoothly varies over longitudinal day observations with covariate-dependent mean and covariance functions. The modeling framework characterizes the longitudinal and functional structures while incorporating two-dimensional fixed effects for covariates of interest. We also develop a fast three-stage estimation procedure to provide accurate fixed-effect inference for model interpretability and improve computational efficiency when encountering large datasets. We find strong evidence of intraday and interday varying significant associations between physical activity and mental health assessments among our cohort population, which shed light on possible intervention strategies targeting daily physical activity patterns to improve school adolescent mental health. Our method is also used in environmental data to illustrate the wide applicability. Supplementary materials for this article are available online.

stat.ME↗

Channel Estimation, Interpolation and Extrapolation in Doubly-dispersive Channels

The OTFS (Orthogonal Time Frequency Space) is widely acknowledged for its ability to combat Doppler spread in time-varying channels. In this paper, another advantage of OTFS over OFDM (Orthogonal Frequency Division Multiplexing) will be demonstrated: much reduced channel training overhead. Specifically, the sparsity of the channel in delay-Doppler (D-D) domain implies strong correlation of channel gains in time-frequency (T-F) domain, which can be harnessed to reduce channel training overhead through interpolation. An immediate question is how much training overhead is needed in doubly-dispersive channels? A conventional belief is that the overhead is only dependent on the product of delay and Doppler spreads, but we will show that it's also dependent on the T-F window size. The finite T-F window leads to infinite spreading in D-D domain, and aliasing will be inevitable after sampling in T-F domain. Two direct consequences of the aliasing are increased channel training overhead and interference. Another factor contributing to channel estimation error is the inter-symbol-carrier-interference (ISCI), resulting from the uncertainty principle. Both aliasing and ISCI are considered in channel modelling, a low-complexity algorithm is proposed for channel estimation and interpolation through FFT. A large T-F window is necessary for reduced channel training overhead and aliasing, but increases processing delay. Fortunately, we show that the proposed algorithm can be implemented in a pipeline fashion. Further more, we showed that data-aided channel tracking is possible in D-D domain to further reduce the channel estimation frequency, i.e., channel extrapolation. The impacts of aliasing and ISCI on channel interpolation error are analyzed.

eess.SP↗

Controllable Longer Image Animation with Diffusion Models

Generating realistic animated videos from static images is an important area of research in computer vision. Methods based on physical simulation and motion prediction have achieved notable advances, but they are often limited to specific object textures and motion trajectories, failing to exhibit highly complex environments and physical dynamics. In this paper, we introduce an open-domain controllable image animation method using motion priors with video diffusion models. Our method achieves precise control over the direction and speed of motion in the movable region by extracting the motion field information from videos and learning moving trajectories and strengths. Current pretrained video generation models are typically limited to producing very short videos, typically less than 30 frames. In contrast, we propose an efficient long-duration video generation method based on noise reschedule specifically tailored for image animation tasks, facilitating the creation of videos over 100 frames in length while maintaining consistency in content scenery and motion coordination. Specifically, we decompose the denoise process into two distinct phases: the shaping of scene contours and the refining of motion details. Then we reschedule the noise to control the generated frame sequences maintaining long-distance noise correlation. We conducted extensive experiments with 10 baselines, encompassing both commercial tools and academic methodologies, which demonstrate the superiority of our method. Our project page: https://wangqiang9.github.io/Controllable.github.io/

cs.CV↗

Integrated Communications and Localization for Massive MIMO LEO Satellite Systems

Integrated communications and localization (ICAL) will play an important part in future sixth generation (6G) networks for the realization of Internet of Everything (IoE) to support both global communications and seamless localization. Massive multiple-input multiple-output (MIMO) low earth orbit (LEO) satellite systems have great potential in providing wide coverage with enhanced gains, and thus are strong candidates for realizing ubiquitous ICAL. In this paper, we develop a wideband massive MIMO LEO satellite system to simultaneously support wireless communications and localization operations in the downlink. In particular, we first characterize the signal propagation properties and derive a localization performance bound. Based on these analyses, we focus on the hybrid analog/digital precoding design to achieve high communication capability and localization precision. Numerical results demonstrate that the proposed ICAL scheme supports both the wireless communication and localization operations for typical system setups.

cs.IT↗

UPDP: A Unified Progressive Depth Pruner for CNN and Vision Transformer

Traditional channel-wise pruning methods by reducing network channels struggle to effectively prune efficient CNN models with depth-wise convolutional layers and certain efficient modules, such as popular inverted residual blocks. Prior depth pruning methods by reducing network depths are not suitable for pruning some efficient models due to the existence of some normalization layers. Moreover, finetuning subnet by directly removing activation layers would corrupt the original model weights, hindering the pruned model from achieving high performance. To address these issues, we propose a novel depth pruning method for efficient models. Our approach proposes a novel block pruning strategy and progressive training method for the subnet. Additionally, we extend our pruning method to vision transformer models. Experimental results demonstrate that our method consistently outperforms existing depth pruning methods across various pruning configurations. We obtained three pruned ConvNeXtV1 models with our method applying on ConvNeXtV1, which surpass most SOTA efficient models with comparable inference performance. Our method also achieves state-of-the-art pruning performance on the vision transformer model.

cs.CV↗

Noisy Self-Training with Synthetic Queries for Dense Retrieval

Although existing neural retrieval models reveal promising results when training data is abundant and the performance keeps improving as training data increases, collecting high-quality annotated data is prohibitively costly. To this end, we introduce a novel noisy self-training framework combined with synthetic queries, showing that neural retrievers can be improved in a self-evolution manner with no reliance on any external models. Experimental results show that our method improves consistently over existing methods on both general-domain (e.g., MS-MARCO) and out-of-domain (i.e., BEIR) retrieval benchmarks. Extra analysis on low-resource settings reveals that our method is data efficient and outperforms competitive baselines, with as little as 30% of labelled training data. Further extending the framework for reranker training demonstrates that the proposed method is general and yields additional gains on tasks of diverse domains.\footnote{Source code is available at \url{https://github.com/Fantabulous-J/Self-Training-DPR}}

cs.CL↗

Boot and Switch: Alternating Distillation for Zero-Shot Dense Retrieval

Neural 'dense' retrieval models are state of the art for many datasets, however these models often exhibit limited domain transfer ability. Existing approaches to adaptation are unwieldy, such as requiring explicit supervision, complex model architectures, or massive external models. We present $\texttt{ABEL}$, a simple but effective unsupervised method to enhance passage retrieval in zero-shot settings. Our technique follows a straightforward loop: a dense retriever learns from supervision signals provided by a reranker, and subsequently, the reranker is updated based on feedback from the improved retriever. By iterating this loop, the two components mutually enhance one another's performance. Experimental results demonstrate that our unsupervised $\texttt{ABEL}$ model outperforms both leading supervised and unsupervised retrievers on the BEIR benchmark. Meanwhile, it exhibits strong adaptation abilities to tasks and domains that were unseen during training. By either fine-tuning $\texttt{ABEL}$ on labelled data or integrating it with existing supervised dense retrievers, we achieve state-of-the-art results.\footnote{Source code is available at \url{https://github.com/Fantabulous-J/BootSwitch}.}

cs.CL↗

Two-Timescale Transmission Design and RIS Optimization for Integrated Localization and Communications

Reconfigurable intelligent surfaces (RISs) have tremendous potential to boost communication performance, especially when the line-of-sight (LOS) path between the user equipment (UE) and base station (BS) is blocked. To control the RIS, channel state information (CSI) is needed, which entails significant pilot overhead. To reduce this overhead and the need for frequent RIS reconfiguration, we propose a novel framework for integrated localization and communications, where RIS configurations are fixed during location coherence intervals, while BS precoders are optimized every channel coherence interval. This framework leverages accurate location information obtained with the aid of several RISs as well as novel RIS optimization and channel estimation methods. Performance in terms of localization accuracy, channel estimation error, and achievable rate demonstrates the effectiveness of the proposed approach.

eess.SP↗

Robust Indoor Localization with Ranging-IMU Fusion

Indoor wireless ranging localization is a promising approach for low-power and high-accuracy localization of wearable devices. A primary challenge in this domain stems from non-line of sight propagation of radio waves. This study tackles a fundamental issue in wireless ranging: the unpredictability of real-time multipath determination, especially in challenging conditions such as when there is no direct line of sight. We achieve this by fusing range measurements with inertial measurements obtained from a low cost Inertial Measurement Unit (IMU). For this purpose, we introduce a novel asymmetric noise model crafted specifically for non-Gaussian multipath disturbances. Additionally, we present a novel Levenberg-Marquardt (LM)-family trust-region adaptation of the iSAM2 fusion algorithm, which is optimized for robust performance for our ranging-IMU fusion problem. We evaluate our solution in a densely occupied real office environment. Our proposed solution can achieve temporally consistent localization with an average absolute accuracy of $\sim$0.3m in real-world settings. Furthermore, our results indicate that we can achieve comparable accuracy even with infrequent (1Hz) range measurements.

cs.RO↗

A Novel Catastrophic Condition for Periodically Time-varying Convolutional Encoders Based on Time-varying Equivalent Convolutional Encoders

A convolutional encoder is said to be catastrophic if it maps an information sequence of infinite weight into a code sequence of finite weight. As a consequence of this mapping, a finite number of channel errors may cause an infinite number of information bit errors when decoding. This situation should be avoided. A catastrophic condition to determine if a time-invariant convolutional encoder is catastrophic or not is stated in \cite{Massey:LSC}. Palazzo developed this condition for periodically time-varying convolutional encoders in \cite{Palazzo:Analysis}. Since Palazzo's condition is based on the state transition table of the constituent encoders, its complexity increases exponentially with the number of memory elements in the encoders. A novel catastrophic condition making use of time-varying equivalent convolutional encoders is presented in this letter. A technique to convert a catastrophic periodically time-varying convolutional encoder into a non-catastrophic one can also be developed based on these encoders. Since they do not involve the state transitions of the convolutional encoder, the time complexity of these methods grows linearly with the encoder memory.

eess.SP↗

Effects From Extra Die Rolls and Choosing the Highest or Lowest

This paper looks into the gain or loss from rolling a fair die multiple times and choosing the highest or lowest number as the outcome over rolling the die just once. Specifically, this paper gives a general formula for the expected value of choosing the highest or lowest value of any number of die rolls and sides. It also shows how, for a fixed number of rolls, the ratio between this expected value and the number of sides converges as the number of sides increases asymptotically. The converging behavior of this ratio helps formulate the aforementioned gain or loss.

math.GM↗

Learned Focused Plenoptic Image Compression with Microimage Preprocessing and Global Attention

Focused plenoptic cameras can record spatial and angular information of the light field (LF) simultaneously with higher spatial resolution relative to traditional plenoptic cameras, which facilitate various applications in computer vision. However, the existing plenoptic image compression methods present ineffectiveness to the captured images due to the complex micro-textures generated by the microlens relay imaging and long-distance correlations among the microimages. In this paper, a lossy end-to-end learning architecture is proposed to compress the focused plenoptic images efficiently. First, a data preprocessing scheme is designed according to the imaging principle to remove the sub-aperture image ineffective pixels in the recorded light field and align the microimages to the rectangular grid. Then, the global attention module with large receptive field is proposed to capture the global correlation among the feature maps using pixel-wise vector attention computed in the resampling process. Also, a new image dataset consisting of 1910 focused plenoptic images with content and depth diversity is built to benefit training and testing. Extensive experimental evaluations demonstrate the effectiveness of the proposed approach. It outperforms intra coding of HEVC and VVC by an average of 62.57% and 51.67% bitrate reduction on the 20 preprocessed focused plenoptic images, respectively. Also, it achieves 18.73% bitrate saving and generates perceptually pleasant reconstructions compared to the state-of-the-art end-to-end image compression methods, which benefits the applications of focused plenoptic cameras greatly. The dataset and code are publicly available at https://github.com/VincentChandelier/GACN.

cs.CV↗

Experimental Validation of Single BS 5G mmWave Positioning and Mapping for Intelligent Transport

Positioning with 5G signals generally requires connection to several base stations (BSs), which makes positioning more demanding in terms of infrastructure than communications. To address this issue, there have been several theoretical studies on single BS positioning, leveraging high-resolution angle and delay estimation and multipath exploitation possibilities at mmWave frequencies. This paper presents the first realistic experimental validation of such studies, involving a commercial 5G mmWave BS and a user equipment (UE) development kit mounted on a test vehicle. We present the relevant signal models, signal processing methods (including channel parameter estimation and position estimation), and validate these based on real data collected in an outdoor science park environment. Our results indicate that positioning is possible, but the performance with a single BS is limited by the knowledge of the position and orientation of the infrastructure and the multipath visibility and diversity.

eess.SP↗

Inter-brain substrates of role switching during mother-child interaction

Mother-child interaction is highly dynamic and reciprocal. Switching roles in these back-and-forth interactions serves as a crucial feature of reciprocal behaviors while the underlying neural entrainment is still not well-studied. Here, we designed a role-controlled cooperative task with dual EEG recording to study how differently two brains interact when mothers and children hold different roles. When children were actors and mothers were observers, mother-child inter-brain synchrony emerged within the theta oscillations and the frontal lobe, which highly correlated with children's attachment to their mothers. When their roles were reversed, this synchrony was shifted to the alpha oscillations and the central area and associated with mothers' perception of their relationship with their children. The results suggested an observer-actor neural alignment within the actor's oscillations, which was modulated by the actor-toward-observer emotional bonding. Our findings contribute to the understanding of how inter-brain synchrony is established and dynamically changed during mother-child reciprocal interaction.

q-bio.NC↗

High-dimensional Automated Radiation Therapy Treatment Planning via Bayesian Optimization

Radiation therapy treatment planning can be viewed as an iterative hyperparameter tuning process to balance conflicting clinical goals. In this work, we investigated the performance of modern Bayesian Optimization (BO) methods on automated treatment planning problems in high-dimensional settings. 20 locally advanced rectal cancer patients treated with intensity-modulated radiation therapy (IMRT) were retrospectively selected as test cases. We implemented an automated treatment planning framework that adjusts dose objectives and weights simultaneously, and tested the performance of two BO methods on the treatment planning task: one standard BO method (GPEI) and one BO method dedicated to high-dimensional problems (SAAS-BO). A random tuning method was also included as the baseline. We compared and analyzed the three automated methods' plan quality and planning efficiency and the different search patterns of the two BO methods. For the target structures, the SAAS-BO plans achieved comparable hot spot control ($p=0.43$) and homogeneity ($p=0.96$) with the clinical plans, significantly better than the GPEI and random plans ($p<0.05$). Both SAAS-BO and GPEI plans significantly outperformed the clinical plans in conformity and dose spillage ($p<0.05$). Compared with clinical plans, the treatment plans generated by the three automated methods all made reductions in evaluated dosimetric indices for the femoral head and the bladder. The analysis of the underlying predictive models has shown that both BO procedures have identified similar important planning parameters. This work implemented a BO-based hyperparameter tuning framework for automated treatment planning. Both tested BO methods were able to produce high-quality treatment plans and the model analysis also confirmed the intrinsic low dimensionality of the tested treatment planning problems.

physics.med-ph↗

ESPRIT-Oriented Precoder Design for mmWave Channel Estimation

We consider the problem of ESPRIT-oriented precoder design for beamspace angle-of-departure (AoD) estimation in downlink mmWave multiple-input single-output communications. Standard precoders (i.e., directional/sum beams) yield poor performance in AoD estimation, while Cramer-Rao bound-optimized precoders undermine the so-called shift invariance property (SIP) of ESPRIT. To tackle this issue, the problem of designing ESPRIT-oriented precoders is formulated to jointly optimize over the precoding matrix and the SIP-restoring matrix of ESPRIT. We develop an alternating optimization approach that updates these two matrices under unit-modulus constraints for analog beamforming architectures. Simulation results demonstrate the validity of the proposed approach while providing valuable insights on the beampatterns of the ESPRIT-oriented precoders.

eess.SP↗

Wideband mmWave Massive MIMO Channel Estimation and Localization

Spatial wideband effects are known to affect channel estimation and localization performance in millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems. Based on perturbation analysis, we show that the spatial wideband effect is in fact more pronounced than previously thought and significantly degrades performance, even at moderate bandwidths, if it is not properly considered in the algorithm design. We propose a novel channel estimation method based on multidimensional ESPRIT per subcarrier, combined with unsupervised learning for pairing across subcarriers, which shows significant performance gain over existing schemes under wideband conditions.

eess.SP↗

An Iterative 5G Positioning and Synchronization Algorithm in NLOS Environments with Multi-Bounce Paths

5G positioning is a very promising area that presents many opportunities and challenges. Many existing techniques rely on multiple anchor nodes and line-of-sight (LOS) paths, or single reference node and single-bounce non-LOS (NLOS) paths. However, in dense multipath environments, identifying the LOS or single-bounce assumptions is challenging. The multi-bounce paths will make the positioning accuracy deteriorate significantly. We propose a robust 5G positioning algorithm in NLOS multipath environments. The corresponding positioning problem is formulated as an iterative and weighted least squares problem, and different weights are utilized to mitigate the effects of multi-bounce paths. Numerical simulations are carried out to evaluate the performance of the proposed algorithm. Compared with the benchmark positioning algorithms only using the single-bounce paths, similar positioning accuracy is achieved for the proposed algorithm.

eess.SP↗