RESUMEN
The gut-brain axis has recently emerged as a crucial link in the development and progression of Parkinson's disease (PD). Dysregulation of the gut microbiota has been implicated in the pathogenesis of this disease, sparking growing interest in the quest for non-invasive biomarkers derived from the gut for early PD diagnosis. Herein, an artificial intelligence-guided gut-microenvironment-triggered imaging sensor (Eu-MOF@Au-Aptmer) to achieve non-invasive, accurate screening for various stages of PD is presented. The sensor works by analyzing α-Syn in the gut using deep learning algorithms. By monitoring changes in α-Syn, the sensor can predict the onset of PD with high accuracy. This work has the potential to revolutionize the diagnosis and treatment of PD by allowing for early intervention and personalized treatment plans. Moreover, it exemplifies the promising prospects of integrating artificial intelligence (AI) and advanced sensors in the monitoring and prediction of a broad spectrum of diseases and health conditions.
Asunto(s)
Inteligencia Artificial , Microbioma Gastrointestinal , Enfermedad de Parkinson , Enfermedad de Parkinson/diagnóstico por imagen , Humanos , Biomarcadores/metabolismo , Aprendizaje Profundo , Eje Cerebro-Intestino , Animales , Técnicas Biosensibles/métodosRESUMEN
In recent years, fusing high spatial resolution multispectral images (HR-MSIs) and low spatial resolution hyperspectral images (LR-HSIs) has become a widely used approach for hyperspectral image super-resolution (HSI-SR). Various unsupervised HSI-SR methods based on deep image prior (DIP) have gained wide popularity thanks to no pre-training requirement. However, DIP-based methods often demonstrate mediocre performance in extracting latent information from the data. To resolve this performance deficiency, we propose a coupled spatial and spectral deep image priors (CS2DIPs) method for the fusion of an HR-MSI and an LR-HSI into an HR-HSI. Specifically, we integrate the nonnegative matrix-vector tensor factorization (NMVTF) into the DIP framework to jointly learn the abundance tensor and spectral feature matrix. The two coupled DIPs are designed to capture essential spatial and spectral features in parallel from the observed HR-MSI and LR-HSI, respectively, which are then used to guide the generation of the abundance tensor and spectral signature matrix for the fusion of the HSI-SR by mode-3 tensor product, meanwhile taking some inherent physical constraints into account. Free from any training data, the proposed CS2DIPs can effectively capture rich spatial and spectral information. As a result, it exhibits much superior performance and convergence speed over most existing DIP-based methods. Extensive experiments are provided to demonstrate its state-of-the-art overall performance including comparison with benchmark peer methods.
RESUMEN
Hyperspectral tensor completion (HTC) for remote sensing, critical for advancing space exploration and other satellite imaging technologies, has drawn considerable attention from recent machine learning community. Hyperspectral image (HSI) contains a wide range of narrowly spaced spectral bands hence forming unique electrical magnetic signatures for distinct materials, and thus plays an irreplaceable role in remote material identification. Nevertheless, remotely acquired HSIs are of low data purity and quite often incompletely observed or corrupted during transmission. Therefore, completing the 3-D hyperspectral tensor, involving two spatial dimensions and one spectral dimension, is a crucial signal processing task for facilitating the subsequent applications. Benchmark HTC methods rely on either supervised learning or nonconvex optimization. As reported in recent machine learning literature, John ellipsoid (JE) in functional analysis is a fundamental topology for effective hyperspectral analysis. We therefore attempt to adopt this key topology in this work, but this induces a dilemma that the computation of JE requires the complete information of the entire HSI tensor that is, however, unavailable under the HTC problem setting. We resolve the dilemma, decouple HTC into convex subproblems ensuring computational efficiency, and show state-of-the-art HTC performances of our algorithm. We also demonstrate that our method has improved the subsequent land cover classification accuracy on the recovered hyperspectral tensor.
RESUMEN
SUMMARY: In vivo dynamic contrast-enhanced imaging tools provide non-invasive methods for analyzing various functional changes associated with disease initiation, progression and responses to therapy. The quantitative application of these tools has been hindered by its inability to accurately resolve and characterize targeted tissues due to spatially mixed tissue heterogeneity. Convex Analysis of Mixtures - Compartment Modeling (CAM-CM) signal deconvolution tool has been developed to automatically identify pure-volume pixels located at the corners of the clustered pixel time series scatter simplex and subsequently estimate tissue-specific pharmacokinetic parameters. CAM-CM can dissect complex tissues into regions with differential tracer kinetics at pixel-wise resolution and provide a systems biology tool for defining imaging signatures predictive of phenotypes. AVAILABILITY: The MATLAB source code can be downloaded at the authors' website www.cbil.ece.vt.edu/software.htm CONTACT: yuewang@vt.edu SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Asunto(s)
Diagnóstico por Imagen/métodos , Algoritmos , Modelos Biológicos , Programas Informáticos , Biología de Sistemas/métodosRESUMEN
Uncertainty in arterial input function (AIF) estimation is one of the major errors in the quantification of dynamic contrast-enhanced MRI. A blind source separation algorithm was proposed to determine the AIF by selecting the voxel time course with maximum purity, which represents a minimal contamination from partial volume effects. Simulations were performed to assess the partial volume effect on the purity of AIF, the estimation accuracy of the AIF, and the influence of purity on the derived kinetic parameters. In vivo data were acquired from six patients with hypopharyngeal cancer and eight rats with brain tumor. Results showed that in simulation the AIF with the highest purity is closest to the true AIF. In patients, the manually selection had reduced purity, which could lead to underestimations of K(trans) and V(e) and an overestimation of V(p) when compared with those obtained by the proposed blind source separation algorithm. The derived kinetic parameters in the tumor were more susceptible to the changes in purity when compared with those in the muscle. The animal experiment demonstrated good reproducibility in blind source separation-AIF derived parameters. In conclusion, the blind source separation method is feasible and reproducible to identify the voxel with the tracer concentration time course closest to the true AIF.
Asunto(s)
Neoplasias Encefálicas/metabolismo , Neoplasias Encefálicas/patología , Gadolinio DTPA/farmacocinética , Aumento de la Imagen/métodos , Interpretación de Imagen Asistida por Computador/métodos , Imagen por Resonancia Magnética/métodos , Algoritmos , Animales , Línea Celular Tumoral , Simulación por Computador , Medios de Contraste/administración & dosificación , Medios de Contraste/farmacocinética , Gadolinio DTPA/administración & dosificación , Humanos , Inyecciones Intraarteriales , Modelos Biológicos , Reconocimiento de Normas Patrones Automatizadas/métodos , Ratas , Ratas Sprague-Dawley , Reproducibilidad de los Resultados , Sensibilidad y EspecificidadRESUMEN
While non-negative blind source separation (nBSS) has found many successful applications in science and engineering, model order selection, determining the number of sources, remains a critical yet unresolved problem. Various model order selection methods have been proposed and applied to real-world data sets but with limited success, with both order over- and under-estimation reported. By studying existing schemes, we have found that the unsatisfactory results are mainly due to invalid assumptions, model oversimplification, subjective thresholding, and/or to assumptions made solely for mathematical convenience. Building on our earlier work that reformulated model order selection for nBSS with more realistic assumptions and models, we report a newly and formally revised model order selection criterion rooted in the minimum description length (MDL) principle. Adopting widely invoked assumptions for achieving a unique nBSS solution, we consider the mixing matrix as consisting of deterministic unknowns, with the source signals following a multivariate Dirichlet distribution. We derive a computationally efficient, stochastic algorithm to obtain approximate maximum-likelihood estimates of model parameters and apply Monte Carlo integration to determine the description length. Our modeling and estimation strategy exploits the characteristic geometry of the data simplex in nBSS. We validate our nBSS-MDL criterion through extensive simulation studies and on four real-world data sets, demonstrating its strong performance and general applicability to nBSS. The proposed nBSS-MDL criterion consistently detects the true number of sources, in all of our case studies.
Asunto(s)
Simulación por Computador , Aprendizaje Automático , Método de Montecarlo , Redes Neurales de la Computación , Simulación por Computador/estadística & datos numéricos , Bases de Datos Factuales/estadística & datos numéricos , Aprendizaje Automático/estadística & datos numéricosRESUMEN
Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is a powerful imaging modality to study the pharmacokinetics in a suspected cancer/tumor tissue. The pharmacokinetic (PK) analysis of prostate cancer includes the estimation of time activity curves (TACs), and thereby, the corresponding kinetic parameters (KPs), and plays a pivotal role in diagnosis and prognosis of prostate cancer. In this paper, we endeavor to develop a blind source separation algorithm, namely convex-optimization-based KPs estimation (COKE) algorithm for PK analysis based on compartmental modeling of DCE-MRI data, for effective prostate tumor detection and its quantification. The COKE algorithm first identifies the best three representative pixels in the DCE-MRI data, corresponding to the plasma, fast-flow, and slow-flow TACs, respectively. The estimation accuracy of the flux rate constants (FRCs) of the fast-flow and slow-flow TACs directly affects the estimation accuracy of the KPs that provide the cancer and normal tissue distribution maps in the prostate region. The COKE algorithm wisely exploits the matrix structure (Toeplitz, lower triangular, and exponential decay) of the original nonconvex FRCs estimation problem, and reformulates it into two convex optimization problems that can reliably estimate the FRCs. After estimation of the FRCs, the KPs can be effectively estimated by solving a pixel-wise constrained curve-fitting (convex) problem. Simulation results demonstrate the efficacy of the proposed COKE algorithm. The COKE algorithm is also evaluated with DCE-MRI data of four different patients with prostate cancer and the obtained results are consistent with clinical observations.
Asunto(s)
Medios de Contraste/farmacocinética , Imagen por Resonancia Magnética/métodos , Neoplasias de la Próstata/diagnóstico por imagen , Algoritmos , Humanos , Masculino , Modelos BiológicosRESUMEN
Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) provides a noninvasive method for evaluating tumor vasculature patterns based on contrast accumulation and washout. However, due to limited imaging resolution and tumor tissue heterogeneity, tracer concentrations at many pixels often represent a mixture of more than one distinct compartment. This pixel-wise partial volume effect (PVE) would have profound impact on the accuracy of pharmacokinetics studies using existing compartmental modeling (CM) methods. We, therefore, propose a convex analysis of mixtures (CAM) algorithm to explicitly mitigate PVE by expressing the kinetics in each pixel as a nonnegative combination of underlying compartments and subsequently identifying pure volume pixels at the corners of the clustered pixel time series scatter plot simplex. The algorithm is supported theoretically by a well-grounded mathematical framework and practically by plug-in noise filtering and normalization preprocessing. We demonstrate the principle and feasibility of the CAM-CM approach on realistic synthetic data involving two functional tissue compartments, and compare the accuracy of parameter estimates obtained with and without PVE elimination using CAM or other relevant techniques. Experimental results show that CAM-CM achieves a significant improvement in the accuracy of kinetic parameter estimation. We apply the algorithm to real DCE-MRI breast cancer data and observe improved pharmacokinetic parameter estimation, separating tumor tissue into regions with differential tracer kinetics on a pixel-by-pixel basis and revealing biologically plausible tumor tissue heterogeneity patterns. This method combines the advantages of multivariate clustering, convex geometry analysis, and compartmental modeling approaches. The open-source MATLAB software of CAM-CM is publicly available from the Web.
Asunto(s)
Neoplasias de la Mama/patología , Aumento de la Imagen/métodos , Imagen por Resonancia Magnética/métodos , Algoritmos , Análisis por Conglomerados , Simulación por Computador , Femenino , Humanos , Modelos Biológicos , Reproducibilidad de los ResultadosRESUMEN
Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challenging task. In this paper, a joint correlation function of multiple signals is proposed to reveal and confirm that the observations after nonnegative mixing would have higher joint correlation than the original unknown sources. Accordingly, a new nonnegative least-correlated component analysis (n/LCA) method is proposed to design the unmixing matrix by minimizing the joint correlation function among the estimated nonnegative sources. In addition to a closed-form solution for unmixing two mixtures of two sources, the general algorithm of n/LCA for the multisource case is developed based on an iterative volume maximization (IVM) principle and linear programming. The source identifiability and required conditions are discussed and proven. The proposed n/LCA algorithm, denoted by n/LCA-IVM, is evaluated with both simulation data and real biomedical data to demonstrate its superior performance over several existing benchmark methods.