Subharmonic analysis using singular-value decomposition of ultrasound contrast agents.
Ontology highlight
ABSTRACT:
SUBMITTER: Mamou J
PROVIDER: S-EPMC2719484 | biostudies-other | 2009 Jun
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In microarray data there are a number of biological samples, each assessed for the level of gene expression for a typically large number of genes. There is a need to examine these data with statistical techniques to help discern possible patterns in the data. Our technique applies a combination of mathematical and statistical methods to progressively take the data set apart so that different aspects can be examined for both general patterns and very specific effects. Unfortunately, these data tables are often corrupted with extreme values (outliers), missing values, and non-normal distributions that preclude standard analysis. We develop a robust analysis method to address these problems. The benefits of this robust analysis will be both the understanding of large-scale shifts in gene effects and the isolation of particular sample-by-gene effects that might be either unusual interactions or the result of experimental flaws. Our method requires a single pass and does not resort to complex "cleaning" or imputation of the data table before analysis. We illustrate the method with a commercial data set.
| S-EPMC263735 | biostudies-literature
Project description:BackgroundBoth microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies while the latter is a more targeted technique. Because of platform-dependent systematic effects, simple comparisons or merging of datasets obtained by these technologies are difficult, even though they may often be desirable. These difficulties are exacerbated if there is only partial overlap between the experimental conditions and genes probed in the two datasets.ResultsWe show here that the generalized singular value decomposition provides a practical tool for merging a small, targeted dataset obtained by quantitative real-time PCR of specific genes with a much larger microarray dataset. The technique permits, for the first time, the identification of genes present in only one dataset co-expressed with a target gene present exclusively in the other dataset, even when experimental conditions for the two datasets are not identical. With the rapidly increasing number of publically available large scale microarray datasets the latter is frequently the case. The method enables us to discover putative candidate genes involved in the biosynthesis of the (1,3;1,4)-beta-D-glucan polysaccharide found in plant cell walls.ConclusionWe show that the generalized singular value decomposition provides a viable tool for a combined analysis of two gene expression datasets with only partial overlap of both gene sets and experimental conditions. We illustrate how the decomposition can be optimized self-consistently by using a judicious choice of genes to define it. The ability of the technique to seamlessly define a concept of "co-expression" across both datasets provides an avenue for meaningful data integration. We believe that it will prove to be particularly useful for exploiting large, publicly available, microarray datasets for species with unsequenced genomes by complementing them with more limited in-house expression measurements.
| S-EPMC2562393 | biostudies-literature
Project description:MotivationHigh throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data analysis. Existing methods, aimed at signal reconstruction and deconvolution, in general, are either supervised, contain parameters that need to be estimated or present other types of ad hoc features. We here introduce SubMatrix Selection Singular Value Decomposition (SMSSVD), a parameter-free unsupervised signal decomposition and dimension reduction method, designed to reduce noise, adaptively for each low-rank-signal in a given data matrix, and represent the signals in the data in a way that enable unbiased exploratory analysis and reconstruction of multiple overlaid signals, including identifying groups of variables that drive different signals.ResultsThe SMSSVD method produces a denoised signal decomposition from a given data matrix. It also guarantees orthogonality between signal components in a straightforward manner and it is designed to make automation possible. We illustrate SMSSVD by applying it to several real and synthetic datasets and compare its performance to golden standard methods like PCA (Principal Component Analysis) and SPC (Sparse Principal Components, using Lasso constraints). The SMSSVD is computationally efficient and despite being a parameter-free method, in general, outperforms existing statistical learning methods.Availability and implementationA Julia implementation of SMSSVD is openly available on GitHub (https://github.com/rasmushenningsson/SubMatrixSelectionSVD.jl).Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6361234 | biostudies-literature
Project description:Some statistical analysis techniques may require complete data matrices, but a frequent problem in the construction of databases is the incomplete collection of information for different reasons. One option to tackle the problem is to estimate and impute the missing data. This paper describes a form of imputation that mixes regression with lower rank approximations. To improve the quality of the imputations, a generalisation is proposed that replaces the singular value decomposition (SVD) of the matrix with a regularised SVD in which the regularisation parameter is estimated by cross-validation. To evaluate the performance of the proposal, ten sets of real data from multienvironment trials were used. Missing values were created in each set at four percentages of missing not at random, and three criteria were then considered to investigate the effectiveness of the proposal. The results show that the regularised method proves very competitive when compared to the original method, beating it in several of the considered scenarios. As it is a very general system, its application can be extended to all multivariate data matrices. •The imputation method is modified through the inclusion of a stable and efficient computational algorithm that replaces the classical SVD least squares criterion by a penalised criterion. This penalty produces smoothed eigenvectors and eigenvalues that avoid overfitting problems, improving the performance of the method when the penalty is necessary. The size of the penalty can be determined by minimising one of the following criteria: the prediction errors, the Procrustes similarity statistic or the critical angles between subspaces of principal components.
| S-EPMC10407287 | biostudies-literature
Project description:We revisit a singular value decomposition (SVD) algorithm given in Chen et al. (Psychometrika 84:124-146, 2019b) for exploratory item factor analysis (IFA). This algorithm estimates a multidimensional IFA model by SVD and was used to obtain a starting point for joint maximum likelihood estimation in Chen et al. (2019b). Thanks to the analytic and computational properties of SVD, this algorithm guarantees a unique solution and has computational advantage over other exploratory IFA methods. Its computational advantage becomes significant when the numbers of respondents, items, and factors are all large. This algorithm can be viewed as a generalization of principal component analysis to binary data. In this note, we provide the statistical underpinning of the algorithm. In particular, we show its statistical consistency under the same double asymptotic setting as in Chen et al. (2019b). We also demonstrate how this algorithm provides a scree plot for investigating the number of factors and provide its asymptotic theory. Further extensions of the algorithm are discussed. Finally, simulation studies suggest that the algorithm has good finite sample performance.
| S-EPMC7385012 | biostudies-literature
Project description:BackgroundFor marker effect models and genomic animal models, computational requirements increase with the number of loci and the number of genotyped individuals, respectively. In the latter case, the inverse genomic relationship matrix (GRM) is typically needed, which is computationally demanding to compute for large datasets. Thus, there is a great need for dimensionality-reduction methods that can analyze massive genomic data. For this purpose, we developed reduced-dimension singular value decomposition (SVD) based models for genomic prediction.MethodsFast SVD is performed by analyzing different chromosomes/genome segments in parallel and/or by restricting SVD to a limited core of genotyped individuals, producing chromosome- or segment-specific principal components (PC). Given a limited effective population size, nearly all the genetic variation can be effectively captured by a limited number of PC. Genomic prediction can then be performed either by PC ridge regression (PCRR) or by genomic animal models using an inverse GRM computed from the chosen PC (PCIG). In the latter case, computation of the inverse GRM will be feasible for any number of genotyped individuals and can be readily produced row- or element-wise.ResultsUsing simulated data, we show that PCRR and PCIG models, using chromosome-wise SVD of a core sample of individuals, are appropriate for genomic prediction in a larger population, and results in virtually identical predicted breeding values as the original full-dimension genomic model (r = 1.000). Compared with other algorithms (e.g. algorithm for proven and young animals, APY), the (chromosome-wise SVD-based) PCRR and PCIG models were more robust to size of the core sample, giving nearly identical results even down to 500 core individuals. The method was also successfully tested on a large multi-breed dataset.ConclusionsSVD can be used for dimensionality reduction of large genomic datasets. After SVD, genomic prediction using dense genomic data and many genotyped individuals can be done in a computationally efficient manner. Using this method, the resulting genomic estimated breeding values were virtually identical to those computed from a full-dimension genomic model.
| S-EPMC5831701 | biostudies-literature
Project description:Brain-computer interface (BCI) multi-modal fusion has the potential to generate multiple commands in a highly reliable manner by alleviating the drawbacks associated with single modality. In the present work, a hybrid EEG-fNIRS BCI system-achieved through a fusion of concurrently recorded electroencephalography (EEG) and functional near-infrared spectroscopy (fNIRS) signals-is used to overcome the limitations of uni-modality and to achieve higher tasks classification. Although the hybrid approach enhances the performance of the system, the improvements are still modest due to the lack of availability of computational approaches to fuse the two modalities. To overcome this, a novel approach is proposed using Multi-resolution singular value decomposition (MSVD) to achieve system- and feature-based fusion. The two approaches based up different features set are compared using the KNN and Tree classifiers. The results obtained through multiple datasets show that the proposed approach can effectively fuse both modalities with improvement in the classification accuracy.
| S-EPMC7753369 | biostudies-literature
Project description:Inhibited movement patterns of carpal tunnel structures have been found in carpal tunnel syndrome (CTS) patients. Motion analysis on ultrasound images allows us to non-invasively study the (relative) movement of carpal tunnel structures and recently a speckle tracking method using singular value decomposition (SVD) has been proposed to optimize this tracking. This study aims to assess the reliability of longitudinal speckle tracking with SVD in both healthy volunteers and patients with CTS. Images from sixteen healthy volunteers and twenty-two CTS patients were used. Ultrasound clips of the third superficial flexor tendon and surrounding subsynovial connective tissue (SSCT) were acquired during finger flexion-extension. A custom made tracking algorithm was used for the analysis. Intra-class correlation coefficients (ICCs) were calculated using a single measure, two-way random model with absolute agreement and Bland-Altman plots were added for graphical representation. ICC values varied between 0.73 and 0.95 in the control group and 0.66-0.98 in the CTS patients, with the majority of the results classified as good to excellent. Tendon tracking showed higher reliability values compared to the SSCT, but values between the control and CTS groups were comparable. Speckle tracking with SVD can reliably be used to analyze longitudinal movement of anatomical structures with different sizes and compositions within the context of the carpal tunnel in both a healthy as well as a pathological state. Based on these results, this technique also holds relevant potential for areas where ultrasound based dynamic imaging requires quantification of motion.
| S-EPMC6389416 | biostudies-literature
Project description:Photoacoustic imaging (PAI) can be used to infer molecular information about myocardial health non-invasively in vivo using optical excitation at ultrasonic spatial resolution. For clinical and preclinical linear array imaging systems, conventional delay-and-sum (DAS) beamforming is typically used. However, DAS cardiac PA images are prone to artifacts such as diffuse quasi-static clutter with temporally varying noise-reducing myocardial signal specificity. Typically, multiple frame averaging schemes are utilized to improve the quality of cardiac PAI, which affects the spatial and temporal resolution and reduces sensitivity to subtle PA signal variation. Furthermore, frame averaging might corrupt myocardial oxygen saturation quantification due to the presence of natural cardiac wall motion. In this paper, a spatiotemporal singular value decomposition (SVD) processing algorithm is proposed to reduce DAS PAI artifacts and subsequent enhancement of myocardial signal specificity. Demonstrate enhancement of PA signals from myocardial tissue compared to surrounding tissues and blood inside the left-ventricular (LV) chamber using spatiotemporal SVD processing with electrocardiogram (ECG) and respiratory signal (ECG-R) gated in vivo murine cardiac PAI. In vivo murine cardiac PAI was performed by collecting single wavelength (850 nm) photoacoustic channel data on eight healthy mice. A three-dimensional (3D) volume of complex PAI data over a cardiac cycle was reconstructed using a custom ECG-R gating algorithm and DAS beamforming. Spatiotemporal SVD was applied on a two-dimensional Casorati matrix generated using the 3D volume of PAI data. The singular value spectrum (SVS) was then filtered to remove contributions from diffuse quasi-static clutter and random noise. Finally, SVD processed beamformed images were derived using filtered SVS and inverse SVD computations. Qualitative comparison with DAS and minimum variance (MV) beamforming shows that SVD processed images had better myocardial signal specificity, contrast, and target detectability. DAS, MV, and SVD images were quantitatively evaluated by calculating contrast ratio (CR), generalized contrast-to-noise ratio (gCNR), and signal-to-noise ratio (SNR). Quantitative evaluations were done at three cardiac time points (during systole, at end-systole (ES), and during diastole) identified from co-registered ultrasound M-Mode image. Mean CR, gCNR, and SNR values of SVD images at ES were 245, 115.15, and 258.17 times higher than DAS images with statistical significance evaluated with one-way analysis of variance. Our results suggest that significantly better-quality images can be realized using spatiotemporal SVD processing for in vivo murine cardiac PAI.
| S-EPMC8054608 | biostudies-literature
Project description:We describe a method by which a single experiment can reveal both association model (pathway and constants) and low-resolution structures of a self-associating system. Small-angle scattering data are collected from solutions at a range of concentrations. These scattering data curves are mass-weighted linear combinations of the scattering from each oligomer. Singular value decomposition of the data yields a set of basis vectors from which the scattering curve for each oligomer is reconstructed using coefficients that depend on the association model. A search identifies the association pathway and constants that provide the best agreement between reconstructed and observed data. Using simulated data with realistic noise, our method finds the correct pathway and association constants. Depending on the simulation parameters, reconstructed curves for each oligomer differ from the ideal by 0.05-0.99% in median absolute relative deviation. The reconstructed scattering curves are fundamental to further analysis, including interatomic distance distribution calculation and low-resolution ab initio shape reconstruction of each oligomer in solution. This method can be applied to x-ray or neutron scattering data from small angles to moderate (or higher) resolution. Data can be taken under physiological conditions, or particular conditions (e.g., temperature) can be varied to extract fundamental association parameters (DeltaH(ass), DeltaS(ass)).
| S-EPMC2397332 | biostudies-literature