A new method based on the manifold-alternative approximating for low-rank matrix completion.
Ontology highlight
ABSTRACT:
SUBMITTER: Ren F
PROVIDER: S-EPMC6290672 | biostudies-other | 2018
REPOSITORIES: biostudies-other
Similar Datasets
Project description:PurposeTo introduce a novel method for the recovery of multi-shot diffusion weighted (MS-DW) images from echo-planar imaging (EPI) acquisitions.MethodsCurrent EPI-based MS-DW reconstruction methods rely on the explicit estimation of the motion-induced phase maps to recover artifact-free images. In the new formulation, the k-space data of the artifact-free DWI is recovered using a structured low-rank matrix completion scheme, which does not require explicit estimation of the phase maps. The structured matrix is obtained as the lifting of the multi-shot data. The smooth phase-modulations between shots manifest as null-space vectors of this matrix, which implies that the structured matrix is low-rank. The missing entries of the structured matrix are filled in using a nuclear-norm minimization algorithm subject to the data-consistency. The formulation enables the natural introduction of smoothness regularization, thus enabling implicit motion-compensated recovery of the MS-DW data.ResultsOur experiments on in-vivo data show effective removal of artifacts arising from inter-shot motion using the proposed method. The method is shown to achieve better reconstruction than the conventional phase-based methods.ConclusionWe demonstrate the utility of the proposed method to effectively recover artifact-free images from Cartesian fully/under-sampled and partial Fourier acquired data without the use of explicit phase estimates. Magn Reson Med 78:494-507, 2017. © 2016 International Society for Magnetic Resonance in Medicine.
| S-EPMC5336529 | biostudies-literature
Project description:MicroRNAs (miRNAs) performs crucial roles in various human diseases, but miRNA-related pathogenic mechanisms remain incompletely understood. Revealing the potential relationship between miRNAs and diseases is a critical problem in biomedical research. Considering limitation of existing computational approaches, we develop improved low-rank matrix recovery (ILRMR) for miRNA-disease association prediction. ILRMR is a global method that can simultaneously prioritize potential association for all diseases and does not require negative samples. ILRMR can also identify promising miRNAs for investigating diseases without any known related miRNA. By integrating miRNA-miRNA similarity information, disease-disease similarity information, and miRNA family information to matrix recovery, ILRMR performs better than other methods in cross validation and case studies.
| S-EPMC5519594 | biostudies-literature
Project description:We present a natural generalization of the recent low rank + sparse matrix decomposition and consider the decomposition of matrices into components of multiple scales. Such decomposition is well motivated in practice as data matrices often exhibit local correlations in multiple scales. Concretely, we propose a multi-scale low rank modeling that represents a data matrix as a sum of block-wise low rank matrices with increasing scales of block sizes. We then consider the inverse problem of decomposing the data matrix into its multi-scale low rank components and approach the problem via a convex formulation. Theoretically, we show that under various incoherence conditions, the convex program recovers the multi-scale low rank components either exactly or approximately. Practically, we provide guidance on selecting the regularization parameters and incorporate cycle spinning to reduce blocking artifacts. Experimentally, we show that the multi-scale low rank decomposition provides a more intuitive decomposition than conventional low rank methods and demonstrate its effectiveness in four applications, including illumination normalization for face images, motion separation for surveillance videos, multi-scale modeling of the dynamic contrast enhanced magnetic resonance imaging and collaborative filtering exploiting age information.
| S-EPMC5403160 | biostudies-literature
Project description:Single-cell RNA-sequencing (scRNA-seq) technologies enable the measurements of gene expressions in individual cells, which is helpful for exploring cancer heterogeneity and precision medicine. However, various technical noises lead to false zero values (missing gene expression values) in scRNA-seq data, termed as dropout events. These zero values complicate the analysis of cell patterns, which affects the high-precision analysis of intra-tumor heterogeneity. Recovering missing gene expression values is still a major obstacle in the scRNA-seq data analysis. In this study, taking the cell heterogeneity into consideration, we develop a novel method, called single cell Gauss–Newton Gene expression Imputation (scGNGI), to impute the scRNA-seq expression matrices by using a low-rank matrix completion. The obtained experimental results on the simulated datasets and real scRNA-seq datasets show that scGNGI can more effectively impute the missing values for scRNA-seq gene expression and improve the down-stream analysis compared to other state-of-the-art methods. Moreover, we show that the proposed method can better preserve gene expression variability among cells. Overall, this study helps explore the complex biological system and precision medicine in scRNA-seq data.
| S-EPMC9329700 | biostudies-literature
Project description:In this paper, we aim to predict conversion and time-to-conversion of mild cognitive impairment (MCI) patients using multi-modal neuroimaging data and clinical data, via cross-sectional and longitudinal studies. However, such data are often heterogeneous, high-dimensional, noisy, and incomplete. We thus propose a framework that includes sparse feature selection, low-rank affinity pursuit denoising (LRAD), and low-rank matrix completion (LRMC) in this study. Specifically, we first use sparse linear regressions to remove unrelated features. Then, considering the heterogeneity of the MCI data, which can be assumed as a union of multiple subspaces, we propose to use a low rank subspace method (i.e., LRAD) to denoise the data. Finally, we employ LRMC algorithm with three data fitting terms and one inequality constraint for joint conversion and time-to-conversion predictions. Our framework aims to answer a very important but yet rarely explored question in AD study, i.e., when will the MCI convert to AD? This is different from survival analysis, which provides the probabilities of conversion at different time points that are mainly used for global analysis, while our time-to-conversion prediction is for each individual subject. Evaluations using the ADNI dataset indicate that our method outperforms conventional LRMC and other state-of-the-art methods. Our method achieves a maximal pMCI classification accuracy of 84% and time prediction correlation of 0.665.
| S-EPMC6892173 | biostudies-literature
Project description:State-of-the-art medical studies proved that long noncoding ribonucleic acids (lncRNAs) are closely related to various diseases. However, their large-scale detection in biological experiments is problematic and expensive. To aid screening and improve the efficiency of biological experiments, this study introduced a prediction model based on the nearest neighbor concept for lncRNA-disease association prediction. We used a new similarity algorithm in the model that fused potential associations. The experimental validation of the proposed algorithm proved its superiority over the available Cosine, Pearson, and Jaccard similarity algorithms. Satisfactory results in the comparative leave-one-out cross-validation test (with AUC = 0.96) confirmed its excellent predictive performance. Finally, the proposed model's reliability was confirmed by performing predictions using a new dataset, yielding AUC = 0.92.
| S-EPMC9755128 | biostudies-literature
Project description:Unsupervised clustering is a fundamental step of single-cell RNA-sequencing (scRNA-seq) data analysis. This issue has inspired several clustering methods to classify cells in scRNA-seq data. However, accurate prediction of the cell clusters remains a substantial challenge. In this study, we propose a new algorithm for scRNA-seq data clustering based on Sparse Optimization and low-rank matrix factorization (scSO). We applied our scSO algorithm to analyze multiple benchmark datasets and showed that the cluster number predicted by scSO was close to the number of reference cell types and that most cells were correctly classified. Our scSO algorithm is available at https://github.com/QuKunLab/scSO. Overall, this study demonstrates a potent cell clustering approach that can help researchers distinguish cell types in single- scRNA-seq data.
| S-EPMC8495739 | biostudies-literature
Project description:Structured low-rank matrix models have previously been introduced to enable calibrationless MR image reconstruction from sub-Nyquist data, and such ideas have recently been extended to enable navigator-free echo-planar imaging (EPI) ghost correction. This paper presents a novel theoretical analysis which shows that, because of uniform subsampling, the structured low-rank matrix optimization problems for EPI data will always have either undesirable or non-unique solutions in the absence of additional constraints. This theory leads us to recommend and investigate problem formulations for navigator-free EPI that incorporate side information from either image-domain or k-space domain parallel imaging methods. The importance of using nonconvex low-rank matrix regularization is also identified. We demonstrate using phantom and in vivo data that the proposed methods are able to eliminate ghost artifacts for several navigator-free EPI acquisition schemes, obtaining better performance in comparison with the state-of-the-art methods across a range of different scenarios. Results are shown for both single-channel acquisition and highly accelerated multi-channel acquisition.
| S-EPMC6309699 | biostudies-literature
Project description:PurposeTo evaluate an algorithm for calibrationless parallel imaging to reconstruct undersampled parallel transmit field maps for the body and brain.MethodsUsing a combination of synthetic data and in vivo measurements from brain and body, 3 different approaches to a joint transmit and receive low-rank tensor completion algorithm are evaluated. These methods included: 1) virtual coils using the product of receive and transmit sensitivities, 2) joint-receiver coils that enforces a low rank structure across receive coils of all transmit modes, and 3) transmit low rank that uses a low rank structure for both receive and transmit modes simultaneously. The performance of each is investigated for different noise levels and different acceleration rates on an 8-channel parallel transmit 7 Tesla system.ResultsThe virtual coils method broke down with increasing noise levels or acceleration rates greater than 2, producing normalized RMS error greater than 0.1. The joint receiver coils method worked well up to acceleration factors of 4, beyond which the normalized RMS error exceeded 0.1. Transmit low rank enabled an eightfold acceleration, with most normalized RMS errors remaining below 0.1.ConclusionThis work demonstrates that undersampling factors of up to eightfold are feasible for transmit array mapping and can be reconstructed using calibrationless parallel imaging methods.
| S-EPMC7611890 | biostudies-literature
Project description:In order to monitor dynamic physiological events in near-real time, a variety of photoacoustic computed tomography (PACT) systems have been developed that can rapidly acquire data. Previously reported studies of dynamic PACT have employed conventional static methods to reconstruct a temporally ordered sequence of images on a frame-by-frame basis. Frame-by-frame image reconstruction (FBFIR) methods fail to exploit correlations between data frames and are known to be statistically and computationally suboptimal. In this study, a low-rank matrix estimation-based spatiotemporal image reconstruction (LRME-STIR) method is investigated for dynamic PACT applications. The LRME-STIR method is based on the observation that, in many PACT applications, the number of frames is much greater than the rank of the ideal noiseless data matrix. Using both computer-simulated and experimentally measured photoacoustic data, the performance of the LRME-STIR method is compared with that of conventional FBFIR method followed by image-domain filtering. The results demonstrate that the LRME-STIR method is not only computationally more efficient but also produces more accurate dynamic PACT images than a conventional FBFIR method followed by image-domain filtering.
| S-EPMC4046831 | biostudies-other