YLYifei Lou

Yifei Lou

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yifei Lou has a total of 193 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • PPG-basis: A python-based toolbox for fast photoplethysmogram decomposition and reconstruction

    by Arjun Putcha, Rachit Keyal, Luke Piasecki, Aastha Sharma, Leonid Shmuylovich, Yifei Lou, Michael Kosorok, Wubin Bai


  • Open Access

    A General Framework for Group Sparsity in Hyperspectral Unmixing Using Endmember Bundles

    by Gokul Bhusal, Yifei Lou, Cristina Garcia-Cardona, Ekaterina Merkurjev

    Due to low spatial resolution, hyperspectral data often consist of mixtures of contributions from multiple materials. This limitation motivates the task of hyperspectral unmixing (HU), which seeks to identify the spectral signatures ( endmembers ) of the materials present in an observed scene, along with their relative proportions ( fractional abundance ) in each pixel. A major challenge in HU arises from class variability among materials, which undermines accurate representation using a single spectral signature, as assumed in the conventional linear mixing model. To address this issue, we propose using group sparsity after representing each material with a set of spectral signatures, known as endmember bundles, where each group corresponds to a specific material. In particular, we develop a bundle-based framework that can enforce either inter-group sparsity or sparsity within and across groups (SWAG) on the abundance coefficients. Furthermore, our framework offers the flexibility to incorporate a variety of sparsity-promoting penalties, among which the transformed $$\ell _1$$ ℓ 1 (TL1) penalty is a novel regularization in the HU literature. Extensive experiments conducted on both synthetic and real hyperspectral data demonstrate the effectiveness and superiority of the proposed approaches.


  • Tensor Dynamic Mode Decomposition

    by Ziqin He, Mengqi Hu, Yifei Lou, Can Chen

    Dynamic mode decomposition (DMD) has emerged as a powerful data-driven technique for extracting dominant spatiotemporal patterns from complex signals. However, conventional DMD methods are limited to matrix-based formulations, which might be inefficient or inadequate for modeling inherently multidimensional data including images, videos, and multiway sensor data. In this letter, we propose tensor dynamic mode decomposition (TDMD), a novel extension of DMD to third-order tensors using recently developed transform-based tensor products. By leveraging tensor factorization techniques, TDMD provides a compact and structure-preserving representation of multidimensional signals, enabling more accurate and efficient signal reconstruction and mode extraction compared to conventional DMD approaches that require data flattening. We demonstrate the effectiveness of TDMD using numerical examples.


  • Open Access

    Image Denoising Using Transformed L1 (TL1) Regularization via ADMM

    by Nabiha Choudhury, Jianqing Jia, Yifei Lou

    Total variation (TV) regularization is a classical tool for image denoising, but its convex $\ell_1$ formulation often leads to staircase artifacts and loss of contrast. To address these issues, we introduce the Transformed $\ell_1$ (TL1) regularizer applied to image gradients. In particular, we develop a TL1-regularized denoising model and solve it using the Alternating Direction Method of Multipliers (ADMM), featuring a closed-form TL1 proximal operator and an FFT-based image update under periodic boundary conditions. Experimental results demonstrate that our approach achieves superior denoising performance, effectively suppressing noise while preserving edges and enhancing image contrast.

  • Open Access

    A Plug-and-Play Framework for Volumetric Light-Sheet Image Reconstruction

    by Yi Gong, Xinyuan Zhang, Jichen Chai, Yichen Ding, Yifei Lou

    Cardiac contraction is a rapid, coordinated process that unfolds across three-dimensional tissue on millisecond timescales. Traditional optical imaging is often inadequate for capturing dynamic cellular structure in the beating heart because of a fundamental trade-off between spatial and temporal resolution. To overcome these limitations, we propose a high-performance computational imaging framework that integrates Compressive Sensing (CS) with Light-Sheet Microscopy (LSM) for efficient, low-phototoxic cardiac imaging. The system performs compressed acquisition of fluorescence signals via random binary mask coding using a Digital Micromirror Device (DMD). We propose a Plug-and-Play (PnP) framework, solved using the alternating direction method of multipliers (ADMM), which flexibly incorporates advanced denoisers, including Tikhonov, Total Variation (TV), and BM3D. To preserve structural continuity in dynamic imaging, we further introduce temporal regularization enforcing smoothness between adjacent z-slices. Experimental results on zebrafish heart imaging under high compression ratios demonstrate that the proposed method successfully reconstructs cellular structures with excellent denoising performance and image clarity, validating the effectiveness and robustness of our algorithm in real-world high-speed, low-light biological imaging scenarios.

  • A Gradient-Based Optimization Method Using the Koopman Operator

    by Mengqi Hu, Bian Li, Yi-An Ma, Yifei Lou, Xiu Yang

    In this paper, we propose a novel approach to solving an optimization problem by reformulating it into a dynamical system, followed by the adaptive spectral Koopman (ASK) method. The Koopman operator, employed in our approach, approximates the evolution of an ordinary differential equation (ODE) using a finite number of eigenfunctions and eigenvalues. We begin by providing a brief overview of the Koopman operator and the ASK method. Subsequently, we adapt the ASK method for solving a general optimization problem. Moreover, we provide an error bound to aid in understanding the performance of the proposed approach, marking the initial step in a more comprehensive numerical analysis. Experimentally, we demonstrate the applicability and accuracy of our method across a diverse range of optimization problems, including min-max problems. Our approach consistently yields smaller gradient norms and higher success rates in finding critical points compared to state-of-the-art gradient-based methods. We also observe the proposed method works particularly well when the dynamical properties of the system can be effectively modeled by the system’s behaviors in a neighborhood of critical points.


  • Unrolling Deep Learning End-to-End Method for Phase Retrieval

    by Haiyan Cheng, Cristina Garcia-Cardona, Weihong Guo, Sara Hahner, Yuan Liu, Yifei Lou, Michela Marini, Sui Tang

  • A Comparison Study of Graph Laplacian Computation

    by Michela Marini, Haiyan Cheng, Cristina Garcia-Cardona, Weihong Guo, Sara Hahner, Yuan Liu, Yifei Lou, Sui Tang

  • Open Access

    Tensor Dynamic Mode Decomposition

    by Ziqin He, Mengqi Hu, Yifei Lou, Can Chen

    Dynamic mode decomposition (DMD) has become a powerful data-driven method for analyzing the spatiotemporal dynamics of complex, high-dimensional systems. However, conventional DMD methods are limited to matrix-based formulations, which might be inefficient or inadequate for modeling inherently multidimensional data including images, videos, and higher-order networks. In this letter, we propose tensor dynamic mode decomposition (TDMD), a novel extension of DMD to third-order tensors based on the recently developed T-product framework. By incorporating tensor factorization techniques, TDMD achieves more efficient computation and better preservation of spatial and temporal structures in multiway data for tasks such as state reconstruction and dynamic component separation, compared to standard DMD with data flattening. We demonstrate the effectiveness of TDMD on both synthetic and real-world datasets.