图表福里埃变换用于复杂器官的空间奥米克表征和分析
Yuzhou Chang1,2, Jixin Liu3, Yi Jiang1
1Department of Biomedical Informatics, College of Medicine, Ohio State University, Columbus, OH 43210, USA.
Research square
|February 27, 2024
概括
我们开发了SpaGFT,这是一种用于分析空间奥米克数据的新方法. 该工具通过准确识别分子特征并提高机器学习模型性能,提高了对组织组织和生物功能的理解.
科学领域:
- 空间奥米克斯 空间奥米克斯
- 图形信号处理 图形信号处理
- 计算生物学是一种计算生物学.
背景情况:
- 空间奥米克技术为组织和细胞组织提供了高分辨率的洞察力.
- 现有的方法缺乏对空间奥米克数据的强大,可解释和公正的表示,阻碍了生物发现.
- 需要一个理论框架来充分利用空间奥米克数据来理解生物功能.
研究的目的:
- 介绍SpaGFT (空间图里埃变换),这是一个新的空间奥米克数据的分析特征表示方法.
- 为了证明SpaGFT在阐明与关键生物过程相关的分子特征方面的能力.
- 为了提供一个新的理论模型可解释AI在空间奥米克的背景下.
主要方法:
- SpaGFT利用图形里埃转换原理适用于空间奥米克数据.
- 该方法产生独特的分析特征表示.
- 在人类/小鼠Visium和人类桃体CODEX数据集上对SpaGFT进行了评估.
主要成果:
- 在空间变量基因预测和基因表达赋值方面,SpaGFT的表现优于现有的工具.
- 整合SpaGFT在空间域识别和细胞类型注释等任务中提高了高达40%的准确性.
- SpaGFT成功地确定了免疫区域,表征了组织变异,并检测到了罕见的亚细胞器官.
结论:
- SpaGFT提供了一种强大且可解释的方法,用于空间信息学数据分析.
- 该方法增强了空间生物学中的机器学习应用,提高了准确性和生物洞察力.
- 通过可解释的AI,SpaGFT推进了对组织组织和组织功能的理论理解.
相关概念视频
Fast Fourier Transform
324
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
324
Continuous -time Fourier Transform
317
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
317
Discrete Fourier Transform
284
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
284
Magnetic Resonance Imaging
5.2K
Magnetic resonance imaging (MRI) is a noninvasive medical imaging technique based on a phenomenon of nuclear physics discovered in the 1930s, in which matter exposed to magnetic fields and radio waves was found to emit radio signals. In 1970, a physician and researcher named Raymond Damadian noticed that malignant (cancerous) tissue gave off different signals than normal body tissue. He applied for a patent for the first MRI scanning device in clinical use by the early 1980s. The early MRI...
5.2K
Basic signals of Fourier Transform
496
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
496
Properties of Fourier Transform II
215
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
215


