Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A new approach to compressed sensing for NMR.

ABSTRACT: Compressed sensing (CS) has attracted a great deal of recent interest as an approach for spectrum analysis of nonuniformly sampled NMR data. Although theoretical justification for the method is abundant, it suffers from several weaknesses, among them poor convergence of some algorithms, and it remains an open question whether NMR spectra satisfy the sparsity requirements of CS theorems. The versions of CS used in NMR involve minimizing the l1 norm of the spectrum. They bear similarity to maximum entropy (MaxEnt) reconstruction, but critical comparison of the methods can be difficult. Here we describe a formalism that places CS and MaxEnt reconstruction on equal footing, enabling critical comparison of the two methods. We also describe a new algorithm for CS that restricts the computation of the l1 norm to the real channel for complex spectra and ensures causality. Preliminary 1D results demonstrate that this approach ameliorates some artifacts that can occur when using the l1 norm of the complex spectrum.

SUBMITTER: Stern AS

PROVIDER: S-EPMC5776145 | biostudies-literature | 2015 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A new approach to compressed sensing for NMR.

Stern Alan S AS Hoch Jeffrey C JC

Magnetic resonance in chemistry : MRC 20150810 11

Compressed sensing (CS) has attracted a great deal of recent interest as an approach for spectrum analysis of nonuniformly sampled NMR data. Although theoretical justification for the method is abundant, it suffers from several weaknesses, among them poor convergence of some algorithms, and it remains an open question whether NMR spectra satisfy the sparsity requirements of CS theorems. The versions of CS used in NMR involve minimizing the l1 norm of the spectrum. They bear similarity to maximum ...[more]

PMID: 26256110

Similar Datasets

Sampling scheme and compressed sensing applied to solid-state NMR spectroscopy.

Project description:We describe the incorporation of non-uniform sampling (NUS) compressed sensing (CS) into oriented sample (OS) solid-state NMR for stationary aligned samples and magic angle spinning (MAS) Solid-state NMR for unoriented 'powder' samples. Both simulated and experimental results indicate that 25-33% of a full linearly sampled data set is required to reconstruct two- and three-dimensional solid-state NMR spectra with high fidelity. A modest increase in signal-to-noise ratio accompanies the reconstruction.

| S-EPMC3851314 | biostudies-literature

Improving resolution in multidimensional NMR using random quadrature detection with compressed sensing reconstruction.

Project description:NMR spectroscopy is central to atomic resolution studies in biology and chemistry. Key to this approach are multidimensional experiments. Obtaining such experiments with sufficient resolution, however, is a slow process, in part since each time increment in every indirect dimension needs to be recorded twice, in quadrature. We introduce a modified compressed sensing (CS) algorithm enabling reconstruction of data acquired with random acquisition of quadrature components in gradient-selection NMR. We name this approach random quadrature detection (RQD). Gradient-selection experiments are essential to the success of modern NMR and with RQD, a 50 % reduction in the number of data points per indirect dimension is possible, by only acquiring one quadrature component per time point. Using our algorithm (CSRQD), high quality reconstructions are achieved. RQD is modular and combined with non-uniform sampling we show that this provides increased flexibility in designing sampling schedules leading to improved resolution with increasing benefits as dimensionality of experiments increases, with particular advantages for 4- and higher dimensional experiments.

| S-EPMC5504140 | biostudies-literature

Faster STORM using compressed sensing.

Project description:In super-resolution microscopy methods based on single-molecule switching, the rate of accumulating single-molecule activation events often limits the time resolution. Here we developed a sparse-signal recovery technique using compressed sensing to analyze images with highly overlapping fluorescent spots. This method allows an activated fluorophore density an order of magnitude higher than what conventional single-molecule fitting methods can handle. Using this method, we demonstrated imaging microtubule dynamics in living cells with a time resolution of 3 s.

| S-EPMC3477591 | biostudies-literature

Compressed Sensing/Sparse-Recovery Approach for Improved Range Resolution in Narrow-Band Radar.

Project description:A compressed sensing/sparse-recovery procedure is adopted to obtain enhanced range resolution capability from the processing of data acquired with narrow-band SFCW radars. A mathematical formulation for the proposed approach is reported and validity limitations are fully discussed, by demonstrating the ability to identify a great number of targets, up to 20, in the range direction. Both numerical and experimental validations are presented, by assuming also noise conditions. The proposed method can be usefully applied for the accurate detection of parameters with very small variations, such as those involved in the monitoring of soil deformations or biological objects.

| S-EPMC4753000 | biostudies-other

Subtyping glioblastoma by combining miRNA and mRNA expression data using compressed sensing-based approach.

Project description:In the clinical practice, many diseases such as glioblastoma, leukemia, diabetes, and prostates have multiple subtypes. Classifying subtypes accurately using genomic data will provide individualized treatments to target-specific disease subtypes. However, it is often difficult to obtain satisfactory classification accuracy using only one type of data, because the subtypes of a disease can exhibit similar patterns in one data type. Fortunately, multiple types of genomic data are often available due to the rapid development of genomic techniques. This raises the question on whether the classification performance can significantly be improved by combining multiple types of genomic data. In this article, we classified four subtypes of glioblastoma multiforme (GBM) with multiple types of genome-wide data (e.g., mRNA and miRNA expression) from The Cancer Genome Atlas (TCGA) project. We proposed a multi-class compressed sensing-based detector (MCSD) for this study. The MCSD was trained with data from TCGA and then applied to subtype GBM patients using an independent testing data. We performed the classification on the same patient subjects with three data types, i.e., miRNA expression data, mRNA (or gene expression) data, and their combinations. The classification accuracy is 69.1% with the miRNA expression data, 52.7% with mRNA expression data, and 90.9% with the combination of both mRNA and miRNA expression data. In addition, some biomarkers identified by the integrated approaches have been confirmed with results from the published literatures. These results indicate that the combined analysis can significantly improve the accuracy of classifying GBM subtypes and identify potential biomarkers for disease diagnosis.

| S-EPMC3651309 | biostudies-literature

A new bound on the block restricted isometry constant in compressed sensing.

Project description:This paper focuses on the sufficient condition of block sparse recovery with the [Formula: see text]-minimization. We show that if the measurement matrix satisfies the block restricted isometry property with [Formula: see text], then every block s-sparse signal can be exactly recovered via the [Formula: see text]-minimization approach in the noiseless case and is stably recovered in the noisy measurement case. The result improves the bound on the block restricted isometry constant [Formula: see text] of Lin and Li (Acta Math. Sin. Engl. Ser. 29(7):1401-1412, 2013).

| S-EPMC5539310 | biostudies-other

Message-passing algorithms for compressed sensing.

Project description:Compressed sensing aims to undersample certain high-dimensional signals yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a known basis. Currently, the best known sparsity-undersampling tradeoff is achieved when reconstructing by convex optimization, which is expensive in important large-scale applications. Fast iterative thresholding algorithms have been intensively studied as alternatives to convex optimization for large-scale problems. Unfortunately known fast algorithms offer substantially worse sparsity-undersampling tradeoffs than convex optimization. We introduce a simple costless modification to iterative thresholding making the sparsity-undersampling tradeoff of the new algorithms equivalent to that of the corresponding convex optimization procedures. The new iterative-thresholding algorithms are inspired by belief propagation in graphical models. Our empirical measurements of the sparsity-undersampling tradeoff for the new algorithms agree with theoretical calculations. We show that a state evolution formalism correctly derives the true sparsity-undersampling tradeoff. There is a surprising agreement between earlier calculations based on random convex polytopes and this apparently very different theoretical formalism.

| S-EPMC2767368 | biostudies-literature

Deep Compressed Sensing for Learning Submodular Functions.

Project description:The AI community has been paying attention to submodular functions due to their various applications (e.g., target search and 3D mapping). Learning submodular functions is a challenge since the number of a function's outcomes of N sets is 2 N . The state-of-the-art approach is based on compressed sensing techniques, which are to learn submodular functions in the Fourier domain and then recover the submodular functions in the spatial domain. However, the number of Fourier bases is relevant to the number of sets' sensing overlapping. To overcome this issue, this research proposed a submodular deep compressed sensing (SDCS) approach to learning submodular functions. The algorithm consists of learning autoencoder networks and Fourier coefficients. The learned networks can be applied to predict 2 N values of submodular functions. Experiments conducted with this approach demonstrate that the algorithm is more efficient than the benchmark approach.

| S-EPMC7249116 | biostudies-literature

Compressed Sensing in On-Grid MIMO Radar.

Project description:The accurate detection of targets is a significant problem in multiple-input multiple-output (MIMO) radar. Recent advances of Compressive Sensing offer a means of efficiently accomplishing this task. The sparsity constraints needed to apply the techniques of Compressive Sensing to problems in radar systems have led to discretizations of the target scene in various domains, such as azimuth, time delay, and Doppler. Building upon recent work, we investigate the feasibility of on-grid Compressive Sensing-based MIMO radar via a threefold azimuth-delay-Doppler discretization for target detection and parameter estimation. We utilize a colocated random sensor array and transmit distinct linear chirps to a small scene with few, slowly moving targets. Relying upon standard far-field and narrowband assumptions, we analyze the efficacy of various recovery algorithms in determining the parameters of the scene through numerical simulations, with particular focus on the ? 1-squared Nonnegative Regularization method.

| S-EPMC4870333 | biostudies-literature

Compressed sensing for highly efficient imaging transcriptomics.

Project description:Recent methods for spatial imaging of tissue samples can identify up to ~100 individual proteins1-3 or RNAs4-10 at single-cell resolution. However, the number of proteins or genes that can be studied in these approaches is limited by long imaging times. Here we introduce Composite In Situ Imaging (CISI), a method that leverages structure in gene expression across both cells and tissues to limit the number of imaging cycles needed to obtain spatially resolved gene expression maps. CISI defines gene modules that can be detected using composite measurements from imaging probes for subsets of genes. The data are then decompressed to recover expression values for individual genes. CISI further reduces imaging time by not relying on spot-level resolution, enabling lower magnification acquisition, and is overall about 500-fold more efficient than current methods. Applying CISI to 12 mouse brain sections, we accurately recovered the spatial abundance of 37 individual genes from 11 composite measurements covering 180 mm2 and 476,276 cells.

| S-EPMC8355028 | 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