Marcotti Stefania, de Freitas Deandra Belo, Troughton Lee D, Kenny Fiona N, Shaw Tanya J, Stramer Brian M, Oakes Patrick W
Randall Centre for Cell and Molecular Biophysics, King's College London, London, UK.
Department of Cell and Molecular Physiology, Stritch School of Medicine, Loyola University Chicago, Maywood, Illinois, US.
Front Comput Sci. 2021 Oct;3. doi: 10.3389/fcomp.2021.745831. Epub 2021 Oct 14.
Measuring the organisation of the cellular cytoskeleton and the surrounding extracellular matrix (ECM) is currently of wide interest as changes in both local and global alignment can highlight alterations in cellular functions and material properties of the extracellular environment. Different approaches have been developed to quantify these structures, typically based on fibre segmentation or on matrix representation and transformation of the image, each with its own advantages and disadvantages. Here we present , a workflow to quantify the alignment of fibrillar features in microscopy images exploiting 2D Fast Fourier Transforms (FFT). Using pre-existing datasets of cell and ECM images, we demonstrate our approach and compare and contrast this workflow with two other well-known ImageJ algorithms to quantify image feature alignment. These comparisons reveal that has a number of advantages due to its grid-based FFT approach. 1) Flexibility in defining the window and neighbourhood sizes allows for performing a parameter search to determine an optimal length scale to carry out alignment metrics. This approach can thus easily accommodate different image resolutions and biological systems. 2) The length scale of decay in alignment can be extracted by comparing neighbourhood sizes, revealing the overall distance that features remain anisotropic. 3) The approach is ambivalent to the signal source, thus making it applicable for a wide range of imaging modalities and is dependent on fewer input parameters than segmentation methods. 4) Finally, compared to segmentation methods, this algorithm is computationally inexpensive, as high-resolution images can be evaluated in less than a second on a standard desktop computer. This makes it feasible to screen numerous experimental perturbations or examine large images over long length scales. Implementation is made available in both MATLAB and Python for wider accessibility, with example datasets for single images and batch processing. Additionally, we include an approach to automatically search parameters for optimum window and neighbourhood sizes, as well as to measure the decay in alignment over progressively increasing length scales.
测量细胞细胞骨架和周围细胞外基质(ECM)的组织目前备受关注,因为局部和全局排列的变化可以突出细胞功能和细胞外环境物质特性的改变。已经开发出不同的方法来量化这些结构,通常基于纤维分割或图像的矩阵表示与变换,每种方法都有其自身的优缺点。在这里,我们提出了一种利用二维快速傅里叶变换(FFT)来量化显微镜图像中纤维状特征排列的工作流程。使用现有的细胞和ECM图像数据集,我们展示了我们的方法,并将此工作流程与其他两种著名的ImageJ算法进行比较和对比,以量化图像特征排列。这些比较表明,由于其基于网格的FFT方法,[该方法名称未给出]具有许多优点。1)定义窗口和邻域大小的灵活性允许执行参数搜索,以确定进行排列度量的最佳长度尺度。因此,这种方法可以轻松适应不同的图像分辨率和生物系统。2)通过比较邻域大小可以提取排列衰减的长度尺度,揭示特征保持各向异性的总体距离。3)该方法对信号源不敏感,因此适用于广泛的成像模态,并且比分割方法依赖更少的输入参数。4)最后,与分割方法相比,该算法计算成本低,因为在标准台式计算机上不到一秒钟就能评估高分辨率图像。这使得筛选大量实验扰动或在长长度尺度上检查大图像成为可能。该实现可在MATLAB和Python中使用,以实现更广泛的可访问性,并提供单图像和批处理的示例数据集。此外,我们还包括一种自动搜索最佳窗口和邻域大小参数的方法,以及测量排列在逐渐增加的长度尺度上的衰减的方法。