检索结果-内蒙古大学图书馆

An effective method for quantification,visualization,and analysis of 3D cell shape during early embryogenesis

学校读者我要写书评

暂无评论

Quantitative Biology 2025年第1期13卷 113-126页

作者： Zelin Li Zhaoke Huang Jianfeng Cao Guoye Guan Zhongying Zhao Hong Yan Department of Electrical Engineering City University of Hong KongHong KongChina Centre for Intelligent Multidimensional Data Analysis Limited Hong KongChina Center for Quantitative Biology Peking UniversityBeijingBeijingChina Department of Systems Biology Harvard Medical SchoolBostonMassachusettsUSA Department of Data Science Dana-Farber Cancer InstituteBostonMassachusettsUSA Department of Biology Hong Kong Baptist UniversityHong KongChina State Key Laboratory of Environmental and Biological Analysis Hong Kong Baptist UniversityHong KongChina

Embryogenesis is the most basic process in developmental *** and simply quantifying cell shape is challenging for the complex and dynamic 3D embryonic *** descriptors such as volume,surface area,and mean curvature often fall short,providing only a global view and lacking in local detail and reconstruction *** this,we introduce an effective integrated method,3D Cell Shape Quantification(3DCSQ),for transforming digitized 3D cell shapes into analytical feature vectors,named eigengrid(proposed grid descriptor like eigen value),eigenharmonic,and *** uniquely combine spherical grids,spherical harmonics,and principal component analysis for cell shape *** demonstrate 3DCSQ’s effectiveness in recognizing cellular morphological phenotypes and clustering *** to Caenorhabditis elegans embryos of 29 living embryos from 4-to 350-cell stages,3DCSQ identifies and quantifies biologically reproducible cellular patterns including distinct skin cell *** also provide automatically cell shape lineaging analysis *** method not only systematizes cell shape description and evaluation but also monitors cell differentiation through shape changes,presenting an advancement in biological imaging and analysis.

关键词： Caenorhabditis elegans(C.elegans) cell shape quantification eigen features(eigengrid eigenharmonic&eigenspectrum) lineage analysis morphological reproducibility spherical harmonics(SPHARM)

LU Decomposition and Generalized Autoone-Takagi Decomposition of Dual Matrices and their Applications

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xu, Renjie Wei, Yimin Yan, Hong Center for Intelligent Multidimensional Data Analysis Hong Kong Science Park Shatin Hong Kong School of Mathematical Sciences Shanghai Key Laboratory of Contemporary Applied Mathematics Fudan University Shanghai200433 China Department of Electrical Engineering Center for Intelligent Multidimensional Data Analysis City University of Hong Kong Hong Kong

This paper uses matrix transformations to provide the Autoone-Takagi decomposition of dual complex symmetric matrices and extends it to dual quaternion η-Hermitian matrices. The LU decomposition of dual matrices is given using the general solution of the Sylvester equation, and its equivalence to the existence of rank-k decomposition and dual Moore-Penrose generalized inverse (DMPGI) is proved. Similar methods are then used to provide the Cholesky decomposition of dual real symmetric positive definite matrices. Both of our decompositions are driven by applications in numerical linear *** Codes 15A23, 15B33, 65F55 Copyright © 2025, The Authors. All rights reserved.

关键词：

Gradient neural network models for approximate Tucker decomposition of time-dependent tensors

学校读者我要写书评

暂无评论

Neurocomputing 2025年 640卷

作者： Che, Maolin Wei, Yimin Yan, Hong State Key Laboratory of Public Big Data and School of Mathematics and Statistics Guizhou University Guiyang550025 China Center for Intelligent Multidimensional Data Analysis Hong Science Park Shatin Hong Kong School of Mathematical Sciences and Key Laboratory of Mathematics for Nonlinear Sciences Fudan University Shanghai200433 China Department of Electrical Engineering and Center for Intelligent Multidimensional Data Analysis City University of Hong Kong 83 Tat Chee Avenue Kowloon Hong Kong

In this paper, we introduce a gradient neural network model for approximating the Tucker decomposition of time-dependent tensors with a specified multilinear rank bound. The behavior of this model is governed by a system of ordinary differential equations. First, based on the Karush–Kuhn–Tucker (KKT) conditions of the optimization problem for the approximate Tucker decomposition of a constant tensor, a gradient neural network model is proposed, demonstrating local stability according to Lyapunov stability theory. Next, we design a gradient neural network model specifically tailored for time-dependent tensors. Finally, using the Taylor-type difference rules, we discretize the proposed neural network models, ensuring zero stability for the implementation of digital hardware. We illustrate the effectiveness and characteristics of our approach through numerical examples. © 2025 Elsevier B.V.

关键词： Lyapunov methods

ELFATT: Efficient Linear Fast Attention for Vision Transformers

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wu, Chong Che, Maolin Xu, Renjie Ran, Zhuoheng Yan, Hong Department of Electrical Engineering Centre for Intelligent Multidimensional Data Analysis City University of Hong Kong Kowloon Hong Kong School of Mathematics and Statistics Guizhou University Guiyang550025 China

The attention mechanism is the key to the success of transformers in different machine learning tasks. However, the quadratic complexity with respect to the sequence length of the vanilla softmax-based attention mechanism becomes the major bottleneck for the application of long sequence tasks, such as vision tasks. Although various efficient linear attention mechanisms have been proposed, they need to sacrifice performance to achieve high efficiency. What’s more, memory-efficient methods, such as FlashAttention-1-3, still have quadratic computation complexity which can be further improved. In this paper, we propose a novel efficient linear fast attention (ELFATT) mechanism to achieve low memory input/output operations, linear computational complexity, and high performance at the same time. ELFATT offers 4-7x speedups over the vanilla softmax-based attention mechanism in high-resolution vision tasks without losing performance. ELFATT is FlashAttention friendly. Using FlashAttention-2 acceleration, ELFATT still offers 2-3x speedups over the vanilla softmax-based attention mechanism on high-resolution vision tasks without losing performance. Even on edge GPUs, ELFATT still offers 1.6x to 2.0x speedups compared to state-of-the-art attention mechanisms in various power modes from 5W to 60W. Furthermore, ELFATT can be used to enhance and accelerate diffusion tasks directly without training. Copyright © 2025, The Authors. All rights reserved.

关键词： Machine vision

TOWARDS SCALABLE TOPOLOGICAL REGULARIZERS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wong, Hiu-Tung Lee, Darrick Yan, Hong Centre for Intelligent Multidimensional Data Analysis Science and Technology Park Hong Kong School of Mathematics University of Edinburgh United Kingdom Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong

Latent space matching, which consists of matching distributions of features in latent space, is a crucial component for tasks such as adversarial attacks and defenses, domain adaptation, and generative modelling. Metrics for probability measures, such as Wasserstein and maximum mean discrepancy, are commonly used to quantify the differences between such distributions. However, these are often costly to compute, or do not appropriately take the geometric and topological features of the distributions into consideration. Persistent homology is a tool from topological data analysis which quantifies the multi-scale topological structure of point clouds, and has recently been used as a topological regularizer in learning tasks. However, computation costs preclude larger scale computations, and discontinuities in the gradient lead to unstable training behavior such as in adversarial tasks. We propose the use of principal persistence measures, based on computing the persistent homology of a large number of small subsamples, as a topological regularizer. We provide a parallelized GPU implementation of this regularizer, and prove that gradients are continuous for smooth densities. Furthermore, we demonstrate the efficacy of this regularizer on shape matching, image generation, and semi-supervised learning tasks, opening the door towards a scalable regularizer for topological features. © 2025, CC BY.

关键词： Probability distributions

Volume Tells: Dual Cycle-Consistent Diffusion for 3D Fluorescence Microscopy De-noising and Super-Resolution

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Zelin Wang, Chenwei Huang, Zhaoke Ma, Yiming Zhao, Cunming Zhao, Zhongying Yan, Hong Department of Electrical Engineering City University of Hong Kong Hong Kong Centre for Intelligent Multidimensional Data Analysis Hong Kong Science Park Hong Kong Department of Biology Hong Kong Baptist University Hong Kong

3D fluorescence microscopy is essential for understanding fundamental life processes through long-term live-cell imaging. However, due to inherent issues in imaging principles, it faces significant challenges including spatially varying noise and anisotropic resolution, where the axial resolution lags behind the lateral resolution up to 4.5 times. Meanwhile, laser power is kept low to maintain cell viability, leading to inaccessible low-noise and high-resolution paired ground truth (GT). To tackle these limitations, a dual Cycle-consistent Diffusion is proposed to effectively mine intra-volume imaging priors within 3D cell volumes in an unsupervised manner, i.e., Volume Tells (VTCD), achieving de-noising and super-resolution (SR) simultaneously. Specifically, a spatially iso-distributed denoiser is designed to exploit the noise distribution consistency between adjacent low-noise and high-noise regions within the 3D cell volume, suppressing the spatially varying noise. Then, in light of the structural consistency of the cell volume, a cross-plane global-propagation SR module propagates high-resolution details from the XY plane into adjacent regions in the XZ and YZ planes, progressively enhancing resolution across the entire 3D cell volume. Experimental results on 10 in vivo cellular dataset demonstrate high improvements in both denoising and super-resolution, with axial resolution enhanced from ∼ 430 nm to ∼ 90 nm. © 2025, CC BY.

关键词： Fluorescence microscopy

data Resolution and Future Challenges in Automated Undersea Cable System Design

学校读者我要写书评

暂无评论

IEEE Network 2025年

作者： Wang, Tianjiao Wang, Xinyu Moran, Bill Wang, Zengfu Zukerman, Moshe Hong Kong Science Park Center for Intelligent Multidimensional Data Analysis Hong Kong Hong Kong The University of Melbourne Department of Electrical and Electronic Engineering MelbourneVIC3010 Australia Research & Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen518057 China Northwestern Polytechnical University School of Automation Xi’an710072 China City University of Hong Kong Department of Electrical Engineering Kowloon Hong Kong

Undersea optical cables form the backbone of global Internet infrastructure, carrying nearly 99% of international Internet data. As demand for high-speed and reliable connectivity continues to grow, optimizing undersea cable path planning has become essential for reducing costs, mitigating risks, and ensuring high-quality service delivery. While traditional manual planning methods remain widely used by cable system designers, surveyors, and planners, the increasing complexity of cable deployment necessitates the integration of automated methods that leverage advanced computational techniques to enhance efficiency and decision-making. This paper reviews the state-of-the-art in cable path planning and system design, emphasizing the important role of data density in achieving optimal cable paths. In particular, we present realistic path-planning scenarios on the Earth’s surface and describe the Fast Marching Method (FMM), a computational approach that efficiently determines optimal routing based on available data. Simulation results show that increasing map resolution, along with accompanying data at the higher resolution, significantly enhances path planning accuracy, reduces deployment costs, and improves risk assessment, underscoring the importance of acquiring and utilizing high-density data. This understanding leads to a discussion of the challenges of data acquisition and computational scalability in processing large-scale datasets, and the importance of collaboration between cable system engineers, geospatial data scientists, and software developers. This paper proposes a collaborative framework in which automated algorithms complement traditional planning methods, enabling cost-effective solutions that continually adapt and become more effective through expert feedback. This research contributes to a more resilient, efficient, and adaptive global undersea communication network, paving the way for the next generation of intelligent, optimized cable infrastructur

关键词： Risk assessment

An effective method for quantification, visualization, and analysis of 3D cell shape during early embryogenesis

学校读者我要写书评

暂无评论

Quantitative Biology 2025年第1期 134-147页

作者： Zelin Li Zhaoke Huang Jianfeng Cao Guoye Guan Zhongying Zhao Hong Yan Department of Electrical Engineering City University of Hong Kong Centre for Intelligent Multidimensional Data Analysis Limited Center for Quantitative Biology Peking University Department of Systems Biology Harvard Medical School Department of Data Science Dana-Farber Cancer Institute Department of Biology Hong Kong Baptist University State Key Laboratory of Environmental and Biological Analysis Hong Kong Baptist University

Embryogenesis is the most basic process in developmental *** and simply quantifying cell shape is challenging for the complex and dynamic 3D embryonic cells. Traditional descriptors such as volume,surface area, and mean curvature often fall short, providing only a global view and lacking in local detail and reconstruction capability. Addressing this, we introduce an effective integrated method, 3D Cell Shape Quantification(3DCSQ), for transforming digitized 3D cell shapes into analytical feature vectors, named eigengrid(proposed grid descriptor like eigen value), eigenharmonic, and eigenspectrum. We uniquely combine spherical grids, spherical harmonics, and principal component analysis for cell shape quantification. We demonstrate 3DCSQ's effectiveness in recognizing cellular morphological phenotypes and clustering cells. Applied to Caenorhabditis elegans embryos of 29 living embryos from 4-to 350-cell stages,3DCSQ identifies and quantifies biologically reproducible cellular patterns including distinct skin cell deformations. We also provide automatically cell shape lineaging analysis program. This method not only systematizes cell shape description and evaluation but also monitors cell differentiation through shape changes, presenting an advancement in biological imaging and analysis.

关键词：

Efficient CUR decomposition for interpretable low-rank approximations and imaging applications

学校读者我要写书评

暂无评论

Neurocomputing 2025年 645卷

作者： Muhammad A.A. Abdelgawad Ray C.C. Cheung Hong Yan Department of Electrical Engineering and Centre for Intelligent Multidimensional Data Analysis City University of Hong Kong Hong Kong Department of Electrical Engineering Faculty of Engineering Minia University El-Minia 61517 Egypt

Low-rank approximations based on the selected columns and rows from a given matrix are an alternative approach to singular value decomposition (SVD) and offer more interpretable outputs. They have been successfully used in pattern recognition, recommendation systems, bioinformatics, and social network analysis. One popular approach is CUR matrix decomposition, which represents the data matrix using three small matrices and can be achieved through randomized or deterministic approaches. Deterministic algorithms yield higher approximation accuracy than randomized ones. However, they are highly computationally expensive, especially with large datasets. To address these limitations, we introduce a new method for efficiently computing the CUR matrix decomposition called HyCUR. It incorporates a deterministic sampling strategy based on guided information of the singular vectors and a randomized sampling to select rows and columns for efficient CUR low-rank approximation. HyCUR overcomes the main drawbacks of deterministic methods and can estimate the approximation rank using an incremental QR factorization approach, which also approximates the SVD of the data matrix instead of the classical method. Therefore, HyCUR is suitable for applications with unknown data rank. Experimental results on synthetic and real datasets of varying sizes demonstrate that HyCUR achieves comparable accuracy to recent deterministic approaches while significantly improving computational efficiency for large low-rank datasets. We validate the proposed method in two real imaging applications: simultaneous sample and feature extraction from large datasets and hyperspectral unmixing to extract endmember signatures and estimate their fractions from hyperspectral image datasets (HSIs). The experiment results show promising performance in both applications.

关键词： Feature Selection