Browse
Submit Data
Databases
API
Help

Dataset Information

29 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Sliding motion compensated low-rank plus sparse (SMC-LS) reconstruction for high spatiotemporal free-breathing liver 4D DCE-MRI.

ABSTRACT: Liver dynamic contrast-enhanced MRI (DCE-MRI) requires high spatiotemporal resolution and large field of view to clearly visualize all relevant enhancement phases and detect early-stage liver lesions. The low-rank plus sparse (L?+?S) reconstruction outperforms standard sparsity-only-based reconstruction through separation of low-rank background component (L) and sparse dynamic components (S). However, the L?+?S decomposition is sensitive to respiratory motion so that image quality is compromised when breathing occurs during long time data acquisition. To enable high quality reconstruction for free-breathing liver 4D DCE-MRI, this paper presents a novel method called SMC-LS, which incorporates Sliding Motion Compensation into the standard L?+?S reconstruction. The global superior-inferior displacement of the internal abdominal organs is inferred directly from the undersampled raw data and then used to correct the breathing induced sliding motion which is the dominant component of respiratory motion. With sliding motion compensation, the reconstructed temporal frames are roughly registered before applying the standard L?+?S decomposition. The proposed method has been validated using free-breathing liver 4D MRI phantom data, free-breathing liver 4D DCE-MRI phantom data, and in vivo free breathing liver 4D MRI dataset. Results demonstrated that SMC-LS reconstruction can effectively reduce motion blurring artefacts and preserve both spatial structures and temporal variations at a sub-second temporal frame rate for free-breathing whole-liver 4D DCE-MRI.

SUBMITTER: Qiu W

PROVIDER: S-EPMC6411681 | biostudies-literature | 2019 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition.

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

Bayesian sparse reduced rank multivariate regression.

Project description:Many modern statistical problems can be cast in the framework of multivariate regression, where the main task is to make statistical inference for a possibly sparse and low-rank coefficient matrix. The low-rank structure in the coefficient matrix is of intrinsic multivariate nature, which, when combined with sparsity, can further lift dimension reduction, conduct variable selection, and facilitate model interpretation. Using a Bayesian approach, we develop a unified sparse and low-rank multivariate regression method to both estimate the coefficient matrix and obtain its credible region for making inference. The newly developed sparse and low-rank prior for the coefficient matrix enables rank reduction, predictor selection and response selection simultaneously. We utilize the marginal likelihood to determine the regularization hyperparameter, so our method maximizes its posterior probability given the data. For theoretical aspect, the posterior consistency is established to discuss an asymptotic behavior of the proposed method. The efficacy of the proposed approach is demonstrated via simulation studies and a real application on yeast cell cycle data.

| S-EPMC5628626 | biostudies-literature

Sparse Reduced Rank Huber Regression in High Dimensions.

Project description:We propose a sparse reduced rank Huber regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained nonconvex optimization problem, which is then solved using a block coordinate descent and an alternating direction method of multipliers algorithm. We establish nonasymptotic estimation error bounds under both Frobenius and nuclear norms in the high-dimensional setting. This is a major contribution over existing results in reduced rank regression, which mainly focus on rank selection and prediction consistency. Our theoretical results quantify the tradeoff between heavy-tailedness of the random noise and statistical bias. For random noise with bounded (1+δ) th moment with δ∈(0,1), the rate of convergence is a function of δ, and is slower than the sub-Gaussian-type deviation bounds; for random noise with bounded second moment, we obtain a rate of convergence as if sub-Gaussian noise were assumed. We illustrate the performance of the proposed method via extensive numerical studies and a data application. Supplementary materials for this article are available online.

| S-EPMC10812838 | biostudies-literature

Sparse reduced-rank regression for integrating omics data.

Project description:BackgroundThe problem of assessing associations between multiple omics data including genomics and metabolomics data to identify biomarkers potentially predictive of complex diseases has garnered considerable research interest nowadays. A popular epidemiology approach is to consider an association of each of the predictors with each of the response using a univariate linear regression model, and to select predictors that meet a priori specified significance level. Although this approach is simple and intuitive, it tends to require larger sample size which is costly. It also assumes variables for each data type are independent, and thus ignores correlations that exist between variables both within each data type and across the data types.ResultsWe consider a multivariate linear regression model that relates multiple predictors with multiple responses, and to identify multiple relevant predictors that are simultaneously associated with the responses. We assume the coefficient matrix of the responses on the predictors is both row-sparse and of low-rank, and propose a group Dantzig type formulation to estimate the coefficient matrix.ConclusionExtensive simulations demonstrate the competitive performance of our proposed method when compared to existing methods in terms of estimation, prediction, and variable selection. We use the proposed method to integrate genomics and metabolomics data to identify genetic variants that are potentially predictive of atherosclerosis cardiovascular disease (ASCVD) beyond well-established risk factors. Our analysis shows some genetic variants that increase prediction of ASCVD beyond some well-established factors of ASCVD, and also suggest a potential utility of the identified genetic variants in explaining possible association between certain metabolites and ASCVD.

| S-EPMC7333421 | biostudies-literature

Clinical application of breathing-adapted 4D CT: image quality comparison to conventional 4D CT.

Project description:Purpose4D CT imaging is an integral part of 4D radiotherapy workflows. However, 4D CT data often contain motion artifacts that mitigate treatment planning. Recently, breathing-adapted 4D CT (i4DCT) was introduced into clinical practice, promising artifact reduction in in-silico and phantom studies. Here, we present an image quality comparison study, pooling clinical patient data from two centers: a new i4DCT and a conventional spiral 4D CT patient cohort.MethodsThe i4DCT cohort comprises 129 and the conventional spiral 4D CT cohort 417 4D CT data sets of lung and liver tumor patients. All data were acquired for treatment planning. The study consists of three parts: illustration of image quality in selected patients of the two cohorts with similar breathing patterns; an image quality expert rater study; and automated analysis of the artifact frequency.ResultsImage data of the patients with similar breathing patterns underline artifact reduction by i4DCT compared to conventional spiral 4D CT. Based on a subgroup of 50 patients with irregular breathing patterns, the rater study reveals a fraction of almost artifact-free scans of 89% for i4DCT and only 25% for conventional 4D CT; the quantitative analysis indicated a reduction of artifact frequency by 31% for i4DCT.ConclusionThe results demonstrate 4D CT image quality improvement for patients with irregular breathing patterns by breathing-adapted 4D CT in this first corresponding clinical data image quality comparison study.

| S-EPMC10281893 | biostudies-literature

Low-Rank and Sparse Recovery of Human Gait Data.

Project description:Due to occlusion or detached markers, information can often be lost while capturing human motion with optical tracking systems. Based on three natural properties of human gait movement, this study presents two different approaches to recover corrupted motion data. These properties are used to define a reconstruction model combining low-rank matrix completion of the measured data with a group-sparsity prior on the marker trajectories mapped in the frequency domain. Unlike most existing approaches, the proposed methodology is fully unsupervised and does not need training data or kinematic information of the user. We evaluated our methods on four different gait datasets with various gap lengths and compared their performance with a state-of-the-art approach using principal component analysis (PCA). Our results showed recovering missing data more precisely, with a reduction of at least 2 mm in mean reconstruction error compared to the literature method. When a small number of marker trajectories is available, our findings showed a reduction of more than 14 mm for the mean reconstruction error compared to the literature approach.

| S-EPMC7472490 | biostudies-literature

Group sparse reduced rank regression for neuroimaging genetic study.

Project description:The neuroimaging genetic study usually needs to deal with high dimensionality of both brain imaging data and genetic data, so that often resulting in the issue of curse of dimensionality. In this paper, we propose a group sparse reduced rank regression model to take the relations of both the phenotypes and the genotypes for the neuroimaging genetic study. Specifically, we propose designing a graph sparsity constraint as well as a reduced rank constraint to simultaneously conduct subspace learning and feature selection. The group sparsity constraint conducts feature selection to identify genotypes highly related to neuroimaging data, while the reduced rank constraint considers the relations among neuroimaging data to conduct subspace learning in the feature selection model. Furthermore, an alternative optimization algorithm is proposed to solve the resulting objective function and is proved to achieve fast convergence. Experimental results on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset showed that the proposed method has superiority on predicting the phenotype data by the genotype data, than the alternative methods under comparison.

| S-EPMC6788769 | biostudies-literature

4D cone beam CT via spatiotemporal tensor framelet.

Project description:On-board 4D cone beam CT (4DCBCT) offers respiratory phase-resolved volumetric imaging, and improves the accuracy of target localization in image guided radiation therapy. However, the clinical utility of this technique has been greatly impeded by its degraded image quality, prolonged imaging time, and increased imaging dose. The purpose of this letter is to develop a novel iterative 4DCBCT reconstruction method for improved image quality, increased imaging speed, and reduced imaging dose.The essence of this work is to introduce the spatiotemporal tensor framelet (STF), a high-dimensional tensor generalization of the 1D framelet for 4DCBCT, to effectively take into account of highly correlated and redundant features of the patient anatomy during respiration, in a multilevel fashion with multibasis sparsifying transform. The STF-based algorithm is implemented on a GPU platform for improved computational efficiency. To evaluate the method, 4DCBCT full-fan scans were acquired within 30 s, with a gantry rotation of 200°; STF is also compared with a state-of-art reconstruction method via spatiotemporal total variation regularization.Both the simulation and experimental results demonstrate that STF-based reconstruction achieved superior image quality. The reconstruction of 20 respiratory phases took less than 10 min on an NVIDIA Tesla C2070 GPU card. The STF codes are available at https://sites.google.com/site/spatiotemporaltensorframelet.By effectively utilizing the spatiotemporal coherence of the patient anatomy among different respiratory phases in a multilevel fashion with multibasis sparsifying transform, the proposed STF method potentially enables fast and low-dose 4DCBCT with improved image quality.

| S-EPMC3494730 | biostudies-other

Low-Rank and Sparse Matrix Decomposition for Genetic Interaction Data.

Project description:BackgroundEpistatic miniarray profile (EMAP) studies have enabled the mapping of large-scale genetic interaction networks and generated large amounts of data in model organisms. One approach to analyze EMAP data is to identify gene modules with densely interacting genes. In addition, genetic interaction score (S score) reflects the degree of synergizing or mitigating effect of two mutants, which is also informative. Statistical approaches that exploit both modularity and the pairwise interactions may provide more insight into the underlying biology. However, the high missing rate in EMAP data hinders the development of such approaches. To address the above problem, we adopted the matrix decomposition methodology "low-rank and sparse decomposition" (LRSDec) to decompose EMAP data matrix into low-rank part and sparse part.ResultsLRSDec has been demonstrated as an effective technique for analyzing EMAP data. We applied a synthetic dataset and an EMAP dataset studying RNA-related processes in Saccharomyces cerevisiae. Global views of the genetic cross talk between different RNA-related protein complexes and processes have been structured, and novel functions of genes have been predicted.

| S-EPMC4529927 | biostudies-literature

Sparse low-rank separated representation models for learning from data.

Project description:We consider the problem of learning a multivariate function from a set of scattered observations using a sparse low-rank separated representation (SSR) model. The model structure considered here is promising for high-dimensional learning problems; however, existing training algorithms based on alternating least-squares (ALS) are known to have convergence difficulties, particularly when the rank of the model is greater than 1. In the present work, we supplement the model structure with sparsity constraints to ensure the well posedness of the approximation problem. We propose two fast training algorithms to estimate the model parameters: (i) a cyclic coordinate descent algorithm and (ii) a block coordinate descent (BCD) algorithm. While the first algorithm is not provably convergent owing to the non-convexity of the optimization problem, the BCD algorithm guarantees convergence to a Nash equilibrium point. The computational cost of the proposed algorithms is shown to scale linearly with respect to all of the parameters in contrast to methods based on ALS. Numerical studies on synthetic and real-world regression datasets indicate that the proposed SSR model structure holds significant potential for machine learning problems.

| S-EPMC6364613 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data