In recent years, the use of graph theory in image analysis has gained traction, offering a flexible approach to handling complex data. This study explores the application of graph-based clustering techniques to embryo...
详细信息
ISBN:
(纸本)9783031821226;9783031821233
In recent years, the use of graph theory in image analysis has gained traction, offering a flexible approach to handling complex data. This study explores the application of graph-based clustering techniques to embryo images captured during various developmental stages. We represent these images as graphs, where nodes correspond to enriched features extracted from image patches, and edges are established based on proximity and visual similarities. Dimensionality reduction was performed using Principal Component Analysis (PCA) and t-Distributed Stochastic Neighbor Embedding (t-SNE), followed by clustering using algorithms such as KMeans, Agglomerative Clustering, Gaussian Mixture Models (GMM), Spectral Clustering, and Birch. Our results indicate that GMM outperformed other methods, achieving the highest scores in metrics such as Adjusted Rand Index (0.1673), Normalized Mutual Information (0.2455), Homogeneity (0.2443), Completeness (0.2467), and V-Measure (0.2455), along with a strong Silhouette Score (0.4026). Notably, significant clustering tendencies were observed in the tB and tPN stages, while other stages exhibited a more mixed distribution, particularly in the tn and tSC stages. This research not only pioneers the use of graph-based methods in embryology but also suggests the potential for future improvements through the integration of advanced deep learning techniques and the expansion of data sets. The findings contribute significantly to the field of reproductive medicine, providing new tools for the analysis and classification of embryonic development stages.
graph-based models form a fundamental aspect of datarepresentation in data Sciences and play a key role in modeling complex networked systems. In particular, recently there is an ever-increasing interest in modeling ...
详细信息
ISBN:
(纸本)9781467382731
graph-based models form a fundamental aspect of datarepresentation in data Sciences and play a key role in modeling complex networked systems. In particular, recently there is an ever-increasing interest in modeling dynamic complex networks, i.e. networks in which the topological structure (nodes and edges) may vary over time. In this context, we propose a novel model for representing finite discrete Time-Varying graphs (TVGs), which are typically used to model dynamic complex networked systems. We analyze the data structures built from our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is in the order of the cardinality of the set of edges. Further, we show that our proposal is an unifying model that can represent several previous (classes of) models for dynamic networks found in the recent literature, which in general are unable to represent each other. In contrast to previous models, our proposal is also able to intrinsically model cyclic (i.e. periodic) behavior in dynamic networks. These representation capabilities attest the expressive power of our proposed unifying model for TVGs. We thus believe our unifying model for TVGs is a step forward in the theoretical foundations for data analysis of complex networked systems.
暂无评论