Combined analysis of metabolomics and 16S rRNA sequencing for ankylosing spondylitis patients before and after secukinumab therapy.

OBJECTIVE: Alterations in gut microbiota have been implicated in the pathogenesis of ankylosing spondylitis (AS), but the underlying mechanisms remain elusive. This study aims to investigate changes in gut microbiota and metabolites in individuals with AS before and after treatment with secukinumab, to identify the biological characteristics specific to AS patients and investigate the potential biomarkers, for optimizing therapeutic strategies more effectively. METHODS: Fecal microbiome data were collected from 30 AS patients before and after secukinumab therapy and compared with data from 40 healthy controls (HC). Additionally, we analyzed the metabolic profile of both groups from plasma. RESULTS: Findings indicated that the treatment-induced changes in the composition of several crucial bacterial groups, including Megamonas, Prevotella_9, Faecalibacterium, Roseburia, Bacteroides, and Agathobacter. Post-treatment, these groups exhibited a distribution more akin to that of the healthy populations compared with their pretreatment status. We identified three gut microbial taxa, namely Prevotellaceae_bacterium_Marseille_P2831, Prevotella_buccae, and Elusimicrobiota, as potential biomarkers for diagnosing individuals at a higher risk of developing AS and assessing disease outcomes. Plasma metabolomics analysis revealed 479 distinct metabolites and highlighted three disrupted metabolic pathways. Integration of microbiome and metabolomics datasets demonstrated a significant degree of correlation, underscoring the impact of the microbiome on metabolic activity. CONCLUSION: Secukinumab can restore the balance of the gut microbiome and metabolites in AS patients, rendering them more similar to those found in the healthy population. The analysis of microbiome and metabolomics data have unveiled some candidate biomarkers capable of evaluating treatment efficacy.

A novel bit-quad-based Euler number computing algorithm.

The Euler number of a binary image is an important topological property in computer vision and pattern recognition. This paper proposes a novel bit-quad-based Euler number computing algorithm. Based on graph theory and analysis on bit-quad patterns, our algorithm only needs to count two bit-quad patterns. Moreover, by use of the information obtained during processing the previous bit-quad, the average number of pixels to be checked for processing a bit-quad is only 1.75. Experimental results demonstrated that our method outperforms significantly conventional Euler number computing algorithms.

A very fast algorithm for simultaneously performing connected-component labeling and euler number computing.

Labeling connected components and calculating the Euler number in a binary image are two fundamental processes for computer vision and pattern recognition. This paper presents an ingenious method for identifying a hole in a binary image in the first scan of connected-component labeling. Our algorithm can perform connected component labeling and Euler number computing simultaneously, and it can also calculate the connected component (object) number and the hole number efficiently. The additional cost for calculating the hole number is only O(H) , where H is the hole number in the image. Our algorithm can be implemented almost in the same way as a conventional equivalent-label-set-based connected-component labeling algorithm. We prove the correctness of our algorithm and use experimental results for various kinds of images to demonstrate the power of our algorithm.

Configuration-Transition-Based Connected-Component Labeling.

This paper proposes a new approach to label-equivalence-based two-scan connected-component labeling. We use two strategies to reduce repeated checking-pixel work for labeling. The first is that instead of scanning image lines one by one and processing pixels one by one as in most conventional two-scan labeling algorithms, we scan image lines alternate lines, and process pixels two by two. The second is that by considering the transition of the configuration of pixels in the mask, we utilize the information detected in processing the last two pixels as much as possible for processing the current two pixels. With our method, any pixel checked in the mask when processing the current two pixels will not be checked again when the next two pixels are processed; thus, the efficiency of labeling can be improved. Experimental results demonstrated that our method was more efficient than all conventional labeling algorithms.

Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images.

Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.

A run-based two-scan labeling algorithm.

We present an efficient run-based two-scan algorithm for labeling connected components in a binary image. Unlike conventional label-equivalence-based algorithms, which resolve label equivalences between provisional labels, our algorithm resolves label equivalences between provisional label sets. At any time, all provisional labels that are assigned to a connected component are combined in a set, and the smallest label is used as the representative label. The corresponding relation of a provisional label and its representative label is recorded in a table. Whenever different connected components are found to be connected, all provisional label sets concerned with these connected components are merged together, and the smallest provisional label is taken as the representative label. When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label. During the second scan, we need only to replace each provisional label by its representative label. Experimental results on various types of images demonstrate that our algorithm outperforms all conventional labeling algorithms.