Browse
Submit Data
Databases
API
Help

Dataset Information

35 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Deep Compressed Sensing for Learning Submodular Functions.

ABSTRACT: 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.

SUBMITTER: Tsai YC

PROVIDER: S-EPMC7249116 | biostudies-literature | 2020 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Deep Compressed Sensing for Learning Submodular Functions.

Tsai Yu-Chung YC Tseng Kuo-Shih KS

Sensors (Basel, Switzerland) 20200502 9

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 ...[more]

PMID: 32370173

Similar Datasets

Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions.

Project description:We study the problem of maximizing deep submodular functions (DSFs) [13, 3] subject to a matroid constraint. DSFs are an expressive class of submodular functions that include, as strict subfamilies, the facility location, weighted coverage, and sums of concave composed with modular functions. We use a strategy similar to the continuous greedy approach [6], but we show that the multilinear extension of any DSF has a natural and computationally attainable concave relaxation that we can optimize using gradient ascent. Our results show a guarantee of max0<?<1(1-?-?-e-?2?(k)) with a running time of O(n 2 /? 2 ) plus time for pipage rounding [6] to recover a discrete solution, where k is the rank of the matroid constraint. This bound is often better than the standard 1 - 1/e guarantee of the continuous greedy algorithm, but runs much faster. Our bound also holds even for fully curved (c = 1) functions where the guarantee of 1 - c/e degenerates to 1 - 1/e where c is the curvature of f [37]. We perform computational experiments that support our theoretical results.

| S-EPMC6351064 | biostudies-literature

Revisiting [Formula: see text]-wavelet compressed-sensing MRI in the era of deep learning.

Project description:Following their success in numerous imaging and computer vision applications, deep-learning (DL) techniques have emerged as one of the most prominent strategies for accelerated MRI reconstruction. These methods have been shown to outperform conventional regularized methods based on compressed sensing (CS). However, in most comparisons, CS is implemented with two or three hand-tuned parameters, while DL methods enjoy a plethora of advanced data science tools. In this work, we revisit [Formula: see text]-wavelet CS reconstruction using these modern tools. Using ideas such as algorithm unrolling and advanced optimization methods over large databases that DL algorithms utilize, along with conventional insights from wavelet representations and CS theory, we show that [Formula: see text]-wavelet CS can be fine-tuned to a level close to DL reconstruction for accelerated MRI. The optimized [Formula: see text]-wavelet CS method uses only 128 parameters compared to >500,000 for DL, employs a convex reconstruction at inference time, and performs within <1% of a DL approach that has been used in multiple studies in terms of quantitative quality metrics.

| S-EPMC9388129 | biostudies-literature

Net-FLICS: fast quantitative wide-field fluorescence lifetime imaging with compressed sensing - a deep learning approach.

Project description:Macroscopic fluorescence lifetime imaging (MFLI) via compressed sensed (CS) measurements enables efficient and accurate quantification of molecular interactions in vivo over a large field of view (FOV). However, the current data-processing workflow is slow, complex and performs poorly under photon-starved conditions. In this paper, we propose Net-FLICS, a novel image reconstruction method based on a convolutional neural network (CNN), to directly reconstruct the intensity and lifetime images from raw time-resolved CS data. By carefully designing a large simulated dataset, Net-FLICS is successfully trained and achieves outstanding reconstruction performance on both in vitro and in vivo experimental data and even superior results at low photon count levels for lifetime quantification.

| S-EPMC6400960 | biostudies-literature

Learning a preconditioner to accelerate compressed sensing reconstructions in MRI.

Project description:PurposeTo learn a preconditioner that accelerates parallel imaging (PI) and compressed sensing (CS) reconstructions.MethodsA convolutional neural network (CNN) with residual connections was used to train a preconditioning operator. Training and validation data were simulated using 50% brain images and 50% white Gaussian noise images. Each multichannel training example contains a simulated sampling mask, complex coil sensitivity maps, and two regularization parameter maps. The trained model was integrated in the preconditioned conjugate gradient (PCG) method as part of the split Bregman CS method. The acceleration performance was compared with that of a circulant PI-CS preconditioner for varying undersampling factors, number of coil elements and anatomies.ResultsThe learned preconditioner reduces the number of PCG iterations by a factor of 4, yielding a similar acceleration as an efficient circulant preconditioner. The method generalizes well to different sampling schemes, coil configurations and anatomies.ConclusionIt is possible to learn adaptable preconditioners for PI and CS reconstructions that meet the performance of state-of-the-art preconditioners. Further acceleration could be achieved by optimizing the network architecture and the training set. Such a preconditioner could also be integrated in fully learned reconstruction methods to accelerate the training process of unrolled networks.

| S-EPMC9299023 | biostudies-literature

Acceleration of knee magnetic resonance imaging using a combination of compressed sensing and commercially available deep learning reconstruction: a preliminary study.

Project description:PurposeTo evaluate whether deep learning reconstruction (DLR) accelerates the acquisition of 1.5-T magnetic resonance imaging (MRI) knee data without image deterioration.Materials and methodsTwenty-one healthy volunteers underwent MRI of the right knee on a 1.5-T MRI scanner. Proton-density-weighted images with one or four numbers of signal averages (NSAs) were obtained via compressed sensing, and DLR was applied to the images with 1 NSA to obtain 1NSA-DLR images. The 1NSA-DLR and 4NSA images were compared objectively (by deriving the signal-to-noise ratios of the lateral and the medial menisci and the contrast-to-noise ratios of the lateral and the medial menisci and articular cartilages) and subjectively (in terms of the visibility of the anterior cruciate ligament, the medial collateral ligament, the medial and lateral menisci, and bone) and in terms of image noise, artifacts, and overall diagnostic acceptability. The paired t-test and Wilcoxon signed-rank test were used for statistical analyses.ResultsThe 1NSA-DLR images were obtained within 100 s. The signal-to-noise ratios (lateral: 3.27 ± 0.30 vs. 1.90 ± 0.13, medial: 2.71 ± 0.24 vs. 1.80 ± 0.15, both p < 0.001) and contrast-to-noise ratios (lateral: 2.61 ± 0.51 vs. 2.18 ± 0.58, medial 2.19 ± 0.32 vs. 1.97 ± 0.36, both p < 0.001) were significantly higher for 1NSA-DLR than 4NSA images. Subjectively, all anatomical structures (except bone) were significantly clearer on the 1NSA-DLR than on the 4NSA images. Also, in the former images, the noise was lower, and the overall diagnostic acceptability was higher.ConclusionCompared with the 4NSA images, the 1NSA-DLR images exhibited less noise, higher overall image quality, and allowed more precise visualization of the menisci and ligaments.

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

Single-Nanoparticle Orientation Sensing by Deep Learning.

Project description:This paper describes a computational imaging platform to determine the orientation of anisotropic optical probes under differential interference contrast (DIC) microscopy. We established a deep-learning model based on data sets of DIC images collected from metal nanoparticle optical probes at different orientations. This model predicted the in-plane angle of gold nanorods with an error below 20°, the inherent limit of the DIC method. Using low-symmetry gold nanostars as optical probes, we demonstrated the detection of in-plane particle orientation in the full 0-360° range. We also showed that orientation predictions of the same particle were consistent even with variations in the imaging background. Finally, the deep-learning model was extended to enable simultaneous prediction of in-plane and out-of-plane rotation angles for a multibranched nanostar by concurrent analysis of DIC images measured at multiple wavelengths.

| S-EPMC7760486 | biostudies-literature

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

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