SearcharxivSearch

arXiv subjects

Haiye Huo

Publications and source records attributed to Haiye Huo.

14 recordsLinked to original sources

BrainCast: A Spatio-Temporal Forecasting Model for Whole-Brain fMRI Time Series Prediction

Functional magnetic resonance imaging (fMRI) enables noninvasive investigation of brain function, while short clinical scan durations, arising from human and non-human factors, usually lead to reduced data quality and limited statistical power for neuroimaging research. In this paper, we propose BrainCast, a novel spatio-temporal forecasting framework specifically tailored for whole-brain fMRI time series forecasting, to extend informative fMRI time series without additional data acquisition. It formulates fMRI time series forecasting as a multivariate time series prediction task and jointly models temporal dynamics within regions of interest (ROIs) and spatial interactions across ROIs. Specifically, BrainCast integrates a Spatial Interaction Awareness module to characterize inter-ROI dependencies via embedding every ROI time series as a token, a Temporal Feature Refinement module to capture intrinsic neural dynamics within each ROI by enhancing both low- and high-energy temporal components of fMRI time series at the ROI level, and a Spatio-temporal Pattern Alignment module to combine spatial and temporal representations for producing informative whole-brain features. Experimental results on resting-state and task fMRI datasets from the Human Connectome Project demonstrate the superiority of BrainCast over state-of-the-art time series forecasting baselines. Moreover, fMRI time series extended by BrainCast improve downstream cognitive ability prediction, highlighting the clinical and neuroscientific impact brought by whole-brain fMRI time series forecasting in scenarios with restricted scan durations.

cs.CV

DDS-UDA: Dual-Domain Synergy for Unsupervised Domain Adaptation in Joint Segmentation of Optic Disc and Optic Cup

Convolutional neural networks (CNNs) have achieved exciting performance in joint segmentation of optic disc and optic cup on single-institution datasets. However, their clinical translation is hindered by two major challenges: limited availability of large-scale, high-quality annotations and performance degradation caused by domain shift during deployment across heterogeneous imaging protocols and acquisition platforms. While unsupervised domain adaptation (UDA) provides a way to mitigate these limitations, most existing approaches do not address cross-domain interference and intra-domain generalization within a unified framework. In this paper, we present the Dual-Domain Synergy UDA (DDS-UDA), a novel UDA framework that comprises two key modules. First, a bi-directional cross-domain consistency regularization module is enforced to mitigate cross-domain interference through feature-level semantic information exchange guided by a coarse-to-fine dynamic mask generator, suppressing noise propagation while preserving structural coherence. Second, a frequency-driven intra-domain pseudo label learning module is used to enhance intra-domain generalization by synthesizing spectral amplitude-mixed supervision signals, which ensures high-fidelity feature alignment across domains. Implemented within a teacher-student architecture, DDS-UDA disentangles domain-specific biases from domain-invariant feature-level representations, thereby achieving robust adaptation to heterogeneous imaging environments. We conduct a comprehensive evaluation of our proposed method on two multi-domain fundus image datasets, demonstrating that it outperforms several existing UDA based methods and therefore providing an effective way for optic disc and optic cup segmentation.

cs.CV

Sparse Phase Retrieval with Redundant Dictionary via $\ell_q (0<q\le 1)$-Analysis Model

Sparse phase retrieval with redundant dictionary is to reconstruct the signals of interest that are (nearly) sparse in a redundant dictionary or frame from the phaseless measurements via the optimization models. Gao [7] presented conditions on the measurement matrix, called null space property (NSP) and strong dictionary restricted isometry property (S-DRIP), for exact and stable recovery of dictionary-$k$-sparse signals via the $\ell_1$-analysis model for sparse phase retrieval with redundant dictionary, respectively, where, in particularly, the S-DRIP of order $tk$ with $t>1$ was derived. In this paper, motivated by many advantages of the $\ell_q$ minimization with $0<q\leq1$, e.g., reduction of the number of measurements required, we generalize these two conditions to the $\ell_q$-analysis model. Specifically, we first present two NSP variants for exact recovery of dictionary-$k$-sparse signals via the $\ell_q$-analysis model in the noiseless scenario. Moreover, we investigate the S-DRIP of order $tk$ with $0<t<\frac{4}{3}$ for stable recovery of dictionary-$k$-sparse signals via the $\ell_q$-analysis model in the noisy scenario, which will complement the existing result of the S-DRIP of order $tk$ with $t\geq2$ obtained in [4].

cs.IT

SVD-Based Graph Fractional Fourier Transform on Directed Graphs and Its Application

Real-world signals frequently reside on directed Cartesian product graphs, including digital images, sensor networks, and meteorological temperature records. Designing a transform method suitable for processing such multi-dimensional graph signals within the fractional Fourier transform domain remains a critical challenge in graph signal processing (GSP). This paper proposes two novel graph fractional Fourier transforms (GFRFTs) for multi-dimensional signals defined on such directed product graphs and comprehensively investigates their denoising capabilities. Our contributions are fourfold: (1) We propose two distinct two-dimensional GFRFTs based on singular value decompositions of some fractional Laplacian matrices; (2) We generalize these transforms to multi-dimensional graph fractional Fourier transforms (MGFRFTs), establishing a powerful fractional domain analysis framework for multi-dimensional GSP; (3) We investigate the signal reconstruction capability of our proposed GFRFTs, as well as their computational complexity; and (4) We validate the practical utility of our approach through denoising experiments on real-world meteorological temperature datasets.

eess.SP

Uniqueness of phase retrieval from offset linear canonical transform

The classical phase retrieval refers to the recovery of an unknown signal from its Fourier magnitudes, which is widely used in fields such as quantum mechanics, signal processing, optics, etc. The offset linear canonical transform (OLCT), which is a more general type of linear integral transform including Fourier transform (FT), fractional Fourier transform (FrFT), and linear canonical transform (LCT) as its special cases. Hence, in this paper, we focus on the uniqueness problem of phase retrieval in the framework of OLCT. First, we prove that all the nontrivial ambiguities in continuous OLCT phase retrieval can be represented by convolution operators, and demonstrate that a continuous compactly supported signal can be uniquely determined up to a global phase from its multiple magnitude-only OLCT measurements. Moreover, we investigate the nontrivial ambiguities in the discrete OLCT phase retrieval case. Furthermore, we demenstrate that a nonseparable function can be uniquely recovered from its magnitudes of short-time OLCT (STOLCT) up to a global phase. Finally, we show that signals which are bandlimited in FT or OLCT domain can be reconstructed from its sampled STOLCT magnitude measurements, up to a global phase, providing the ambiguity function of window function satisfies some mild conditions.

eess.SP

Stable recovery of complex dictionary-sparse signals from phaseless measurements

Dictionary-sparse phase retrieval, which is also known as phase retrieval with redundant dictionary, aims to reconstruct an original dictionary-sparse signal from its measurements without phase information. It is proved that if the measurement matrix $A$ satisfies null space property (NSP)/strong dictionary restricted isometry property (S-DRIP), then the dictionary-sparse signal can be exactly/stably recovered from its magnitude-only measurements up to a global phase. However, the S-DRIP holds only for real signals. Hence, in this paper, we mainly study the stability of the $\ell_1$-analysis minimization and its generalized $\ell_q\;(0<q\leq1)$-analysis minimization for the recovery of complex dictionary-sparse signals from phaseless measurements. First, we introduce a new $l_1$-dictionary restricted isometry property ($\ell_1$-DRIP) for rank-one and dictionary-sparse matrices, and show that complex dictionary-sparse signals can be stably recovered by magnitude-only measurements via $\ell_1$-analysis minimization provided that the quadratic measurement map $\mathcal{A}$ satisfies $\ell_1$-DRIP. Then, we generalized the $\ell_1$-DRIP condition under the framework of $\ell_q\;(0<q\leq1)$-analysis minimization.

cs.IT

Robust Multidimentional Chinese Remainder Theorem for Integer Vector Reconstruction

The problem of robustly reconstructing an integer vector from its erroneous remainders appears in many applications in the field of multidimensional (MD) signal processing. To address this problem, a robust MD Chinese remainder theorem (CRT) was recently proposed for a special class of moduli, where the remaining integer matrices left-divided by a greatest common left divisor (gcld) of all the moduli are pairwise commutative and coprime. The strict constraint on the moduli limits the usefulness of the robust MD-CRT in practice. In this paper, we investigate the robust MD-CRT for a general set of moduli. We first introduce a necessary and sufficient condition on the difference between paired remainder errors, followed by a simple sufficient condition on the remainder error bound, for the robust MD-CRT for general moduli, where the conditions are associated with (the minimum distances of) these lattices generated by gcld's of paired moduli, and a closed-form reconstruction algorithm is presented. We then generalize the above results of the robust MD-CRT from integer vectors/matrices to real ones. Finally, we validate the robust MD-CRT for general moduli by employing numerical simulations, and apply it to MD sinusoidal frequency estimation based on multiple sub-Nyquist samplers.

eess.SP

Multivariate Dynamical Sampling in $l^2(\mathbb{Z}^2)$ and Shift-Invariant Spaces Associated with Linear Canonical Transform

In this paper, we investigate the multivariate dynamical sampling problem in $l^2(\mathbb{Z}^2)$ associated with the two-dimensional discrete time non-separable linear canonical transform (2D-DT-NS-LCT) and shift-invariant spaces associated with the two-dimensional non-separable linear canonical transform (2D-NS-LCT), respectively. Specifically, we derive a sufficient and necessary condition under which a sequence in $l^2(\mathbb{Z}^2)$ (or a function in a shift-invariant space) can be stably recovered from its dynamical sampling measurements associated with the 2D-DT-NS-LCT (or the 2D-NS-LCT). We also present a simple example to elucidate our main results.

math.FA

Stable Recovery of Weighted Sparse Signals from Phaseless Measurements via Weighted l1 Minimization

The goal of phaseless compressed sensing is to recover an unknown sparse or approximately sparse signal from the magnitude of its measurements. However, it does not take advantage of any support information of the original signal. Therefore, our main contribution in this paper is to extend the theoretical framework for phaseless compressed sensing to incorporate with prior knowledge of the support structure of the signal. Specifically, we investigate two conditions that guarantee stable recovery of a weighted $k$-sparse signal via weighted l1 minimization without any phase information. We first prove that the weighted null space property (WNSP) is a sufficient and necessary condition for the success of weighted l1 minimization for weighted k-sparse phase retrievable. Moreover, we show that if a measurement matrix satisfies the strong weighted restricted isometry property (SWRIP), then the original signal can be stably recovered from the phaseless measurements.

cs.IT

A new convolution theorem associated with the linear canonical transform

In this paper, we first introduce a new notion of canonical convolution operator, and show that it satisfies the commutative, associative, and distributive properties, which may be quite useful in signal processing. Moreover, it is proved that the generalized convolution theorem and generalized Young's inequality are also hold for the new canonical convolution operator associated with the LCT. Finally, we investigate the sufficient and necessary conditions for solving a class of convolution equations associated with the LCT.

eess.SP

Uncertainty Principles for the Offset Linear Canonical Transform

The offset linear canonical transform (OLCT) provides a more general framework for a number of well known linear integral transforms in signal processing and optics, such as Fourier transform, fractional Fourier transform, linear canonical transform. In this paper, to characterize simultaneous localization of a signal and its OLCT, we extend some different uncertainty principles (UPs), including Nazarov's UP, Hardy's UP, Beurling's UP, logarithmic UP and entropic UP, which have already been well studied in the Fourier transform domain over the last few decades, to the OLCT domain in a broader sense.

eess.SP

Nonuniform Sampling for Random Signals Bandlimited in the Linear Canonical Transform Domain

In this paper, we mainly investigate the nonuniform sampling for random signals which are bandlimited in the linear canonical transform (LCT) domain. We show that the nonuniform sampling for a random signal bandlimited in the LCT domain is equal to the uniform sampling in the sense of second order statistic characters after a pre-filter in the LCT domain. Moreover, we propose an approximate recovery approach for nonuniform sampling of random signals bandlimited in the LCT domain. Furthermore, we study the mean square error of the nonuniform sampling. Finally, we do some simulations to verify the correctness of our theoretical results.

eess.SP

Uncertainty Principles Associated with the Offset Linear Canonical Transform

As a time-shifted and frequency-modulated version of the linear canonical transform (LCT), the offset linear canonical transform (OLCT) provides a more general framework of most existing linear integral transforms in signal processing and optics. To study simultaneous localization of a signal and its OLCT, the classical Heisenberg's uncertainty principle has been recently generalized for the OLCT. In this paper, we complement it by presenting another two uncertainty principles, i.e., Donoho-Stark's uncertainty principle and Amrein-Berthier-Benedicks's uncertainty principle, for the OLCT. Moreover, we generalize the short-time LCT to the short-time OLCT. We likewise present Lieb's uncertainty principle for the short-time OLCT and give a lower bound for its essential support.

eess.SP

Towards Robustness in Residue Number Systems

The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from several undersampled waveforms, wireless sensor networks, etc. Assuming that the dynamic range of the large number is the maximal possible one, i.e., the least common multiple (lcm) of all the moduli, a method called robust Chinese remainder theorem (CRT) for solving the robust remaindering problem has been recently proposed. In this paper, by relaxing the assumption that the dynamic range is fixed to be the lcm of all the moduli, a trade-off between the dynamic range and the robustness bound for two-modular systems is studied. It basically says that a decrease in the dynamic range may lead to an increase of the robustness bound. We first obtain a general condition on the remainder errors and derive the exact dynamic range with a closed-form formula for the robustness to hold. We then propose simple closed-form reconstruction algorithms. Furthermore, the newly obtained two-modular results are applied to the robust reconstruction for multi-modular systems and generalized to real numbers. Finally, some simulations are carried out to verify our proposed theoretical results.

cs.IT