Kernel graph filtering-A new method for dynamic sinogram denoising.
Ontology highlight
ABSTRACT:
SUBMITTER: Guo S
PROVIDER: S-EPMC8638912 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:BACKGROUND: Protein-DNA interactions play important roles in many biological processes. Computational methods that can accurately predict DNA-binding sites on proteins will greatly expedite research on problems involving protein-DNA interactions. RESULTS: This paper presents a method for predicting DNA-binding sites on protein structures. The method represents protein surface patches using labeled graphs and uses a graph kernel method to calculate the similarities between graphs. A new surface patch is predicted to be interface or non-interface patch based on its similarities to known DNA-binding patches and non-DNA-binding patches. The proposed method achieved high accuracy when tested on a representative set of 146 protein-DNA complexes using leave-one-out cross-validation. Then, the method was applied to identify DNA-binding sites on 13 unbound structures of DNA-binding proteins. In each of the unbound structure, the top 1 patch predicted by the proposed method precisely indicated the location of the DNA-binding site. Comparisons with other methods showed that the proposed method was competitive in predicting DNA-binding sites on unbound proteins. CONCLUSIONS: The proposed method uses graphs to encode the feature's distribution in the 3-dimensional (3D) space. Thus, compared with other vector-based methods, it has the advantage of taking into account the spatial distribution of features on the proteins. Using an efficient kernel method to compare graphs the proposed method also avoids the demanding computations required for 3D objects comparison. It provides a competitive method for predicting DNA-binding sites without requiring structure alignment.
| S-EPMC4290685 | biostudies-literature
Project description:BackgroundDatabase search has been the main approach for proteoform identification by top-down tandem mass spectrometry. However, when the target proteoform that produced the spectrum contains post-translational modifications (PTMs) and/or mutations, it is quite time consuming to align a query spectrum against all protein sequences without any PTMs and mutations in a large database. Consequently, it is essential to develop efficient and sensitive filtering algorithms for speeding up database search.ResultsIn this paper, we propose a spectrum graph matching (SGM) based protein sequence filtering method for top-down mass spectral identification. It uses the subspectra of a query spectrum to generate spectrum graphs and searches them against a protein database to report the best candidates. As the sequence tag and gaped tag approaches need the preprocessing step to extract and select tags, the SGM filtering method circumvents this preprocessing step, thus simplifying data processing. We evaluated the filtration efficiency of the SGM filtering method with various parameter settings on an Escherichia coli top-down mass spectrometry data set and compared the performances of the SGM filtering method and two tag-based filtering methods on a data set of MCF-7 cells.ConclusionsExperimental results on the data sets show that the SGM filtering method achieves high sensitivity in protein sequence filtration. When coupled with a spectral alignment algorithm, the SGM filtering method significantly increases the number of identified proteoform spectrum-matches compared with the tag-based methods in top-down mass spectrometry data analysis.
| S-EPMC6157290 | biostudies-literature
Project description:BACKGROUND: Reducing the effects of sequencing errors and PCR artifacts has emerged as an essential component in amplicon-based metagenomic studies. Denoising algorithms have been designed that can reduce error rates in mock community data, but they change the sequence data in a manner that can be inconsistent with the process of removing errors in studies of real communities. In addition, they are limited by the size of the dataset and the sequencing technology used. RESULTS: FlowClus uses a systematic approach to filter and denoise reads efficiently. When denoising real datasets, FlowClus provides feedback about the process that can be used as the basis to adjust the parameters of the algorithm to suit the particular dataset. When used to analyze a mock community dataset, FlowClus produced a lower error rate compared to other denoising algorithms, while retaining significantly more sequence information. Among its other attributes, FlowClus can analyze longer reads being generated from all stages of 454 sequencing technology, as well as from Ion Torrent. It has processed a large dataset of 2.2 million GS-FLX Titanium reads in twelve hours; using its more efficient (but less precise) trie analysis option, this time was further reduced, to seven minutes. CONCLUSIONS: Many of the amplicon-based metagenomics datasets generated over the last several years have been processed through a denoising pipeline that likely caused deleterious effects on the raw data. By using FlowClus, one can avoid such negative outcomes while maintaining control over the filtering and denoising processes. Because of its efficiency, FlowClus can be used to re-analyze multiple large datasets together, thereby leading to more standardized conclusions. FlowClus is freely available on GitHub (jsh58/FlowClus); it is written in C and supported on Linux.
| S-EPMC4380255 | biostudies-literature
Project description:Understanding spatial inhomogeneity and clustering in point patterns arises in many contexts, ranging from disease outbreak monitoring to analyzing radiologically-based emphysema in biomedical images. This can often involve classifying individual points as being part of a feature/cluster or as being part of a background noise process. Existing methods for this task can struggle when there are differences in the size and/or density of individual clusters. In this work, we propose employing kernel density estimates of the underlying point process intensity function, using an existing data-driven approach to bandwidth selection, to separate feature points from noise. This is achieved by constructing a null distribution, either through asymptotic properties or Monte Carlo simulation, and comparing kernel density estimates to a given quantile of this distribution. We demonstrate that our method, termed Kernel Density and Simulation based Filtering (KDS-Filt), showed superior performance to existing alternative approaches, especially when there is inhomogeneity in cluster sizes and density. We also show the utility of KDS-Filt for identifying clinically relevant information about the spatial distribution of emphysema in lung computed tomography scans. The KDS-Filt methodology is available as part of the sncp R package, which can be downloaded at https://github.com/stop-pre16/sncp.
| S-EPMC7781288 | biostudies-literature
Project description:Total variation (TV) based models are very popular in image denoising but suffer from some drawbacks. For example, local TV methods often cannot preserve edges and textures well when they face excessive smoothing. Non-local TV methods constitute an alternative, but their computational cost is huge. To overcome these issues, we propose an image denoising method named non-local patch graph total variation (NPGTV). Its main originality stands for the graph total variation method, which combines the total variation with graph signal processing. Schematically, we first construct a K-nearest graph from the original image using a non-local patch-based method. Then the model is solved with the Douglas-Rachford Splitting algorithm. By doing so, the image details can be well preserved while being denoised. Experiments conducted on several standard natural images illustrate the effectiveness of our method when compared to some other state-of-the-art denoising methods like classical total variation, non-local means filter (NLM), non-local graph based transform (NLGBT), adaptive graph-based total variation (AGTV).
| S-EPMC6907757 | biostudies-literature
Project description:Diffusion MRI (DMRI) plays an essential role in diagnosing brain disorders related to white matter abnormalities. However, it suffers from heavy noise, which restricts its quantitative analysis. The total variance (TV) regularization is an effective noise reduction technique that penalizes noise-induced variances. However, existing TV-based denoising methods only focus on the spatial domain, overlooking that DMRI data lives in a combined spatioangular domain. It eventually results in an unsatisfactory noise reduction effect. To resolve this issue, we propose to remove the noise in DMRI using graph total variance (GTV) in the spatioangular domain. Expressly, we first represent the DMRI data using a graph, which encodes the geometric information of sampling points in the spatioangular domain. We then perform effective noise reduction using the powerful GTV regularization, which penalizes the noise-induced variances on the graph. GTV effectively resolves the limitation in existing methods, which only rely on spatial information for removing the noise. Extensive experiments on synthetic and real DMRI data demonstrate that GTV can remove the noise effectively and outperforms state-of-the-art methods.
| S-EPMC8670899 | biostudies-literature
Project description:A new hyperspectral images (HSIs) denoising method via Interpolated Block-Matching and 3D filtering and Guided Filtering (IBM3DGF) denoising method is proposed. First, inter-spectral correlation analysis is used to obtain inter-spectral correlation coefficients and divide the HSIs into several adjacent groups. Second, high-resolution HSIs are produced by using adjacent three images to interpolate. Third, Block-Matching and 3D filtering (BM3D) is conducted to reduce the noise level of each group; Fourth, the guided image filtering is utilized to denoise HSI of each group. Finally, the inverse interpolation is applied to retrieve HSI. Experimental results of synthetic and real HSIs showed that, comparing with other state-of-the-art denoising methods, the proposed IBM3DGF method shows superior performance according to spatial and spectral domain noise assessment. Therefore, the proposed method has a potential to effectively remove the spatial/spectral noise for HSIs.
| S-EPMC8323597 | biostudies-literature
Project description:HighlY constrained backPRojection (HYPR) is a promising image-processing strategy with widespread application in time-resolved MRI that is also well suited for PET applications requiring time series data. The HYPR technique involves the creation of a composite image from the entire time series. The individual time frames then provide the basis for weighting matrices of the composite. The signal-to-noise ratio (SNR) of the individual time frames can be dramatically improved using the high SNR of the composite image. In this study, we introduced the modified HYPR algorithm (the HYPR method constraining the backprojections to local regions of interest [HYPR-LR]) for the processing of dynamic PET studies. We demonstrated the performance of HYPR-LR in phantom, small-animal, and human studies using qualitative, semiquantitative, and quantitative comparisons. The results demonstrate that significant improvements in SNR can be realized in the PET time series, particularly for voxel-based analysis, without sacrificing spatial resolution. HYPR-LR processing holds great potential in nuclear medicine imaging for all applications with low SNR in dynamic scans, including for the generation of voxel-based parametric images and visualization of rapid radiotracer uptake and distribution.
| S-EPMC3250311 | biostudies-literature
Project description:The present paper proposes a novel kernel adaptive filtering algorithm, where each Gaussian kernel is parameterized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of scalar width parameter. In fact, different from conventional kernel adaptive systems, the proposed filter is structured as a superposition of non-isotropic Gaussian kernels, whose non-isotropy makes the filter more flexible. The adaptation algorithm will search for optimal parameters in a wider parameter space. This generalization brings the need of special treatment of parameters that have a geometric structure. In fact, the main contribution of this paper is to establish update rules for precision matrices on the Lie group of SPD matrices in order to ensure their symmetry and positive-definiteness. The parameters of this filter are adapted on the basis of a least-squares criterion to minimize the filtering error, together with an ℓ1-type regularization criterion to avoid overfitting and to prevent the increase of dimensionality of the dictionary. Experimental results confirm the validity of the proposed method.
| S-EPMC7428144 | biostudies-literature
Project description:MotivationKernel-based association test (KAT) has been a popular approach to evaluate the association of expressions of a gene set (e.g. pathway) with a phenotypic trait. KATs rely on kernel functions which capture the sample similarity across multiple features, to capture potential linear or non-linear relationship among features in a gene set. When calculating the kernel functions, no network graphical information about the features is considered. While genes in a functional group (e.g. a pathway) are not independent in general due to regulatory interactions, incorporating regulatory network (or graph) information can potentially increase the power of KAT. In this work, we propose a graph-embedded kernel association test, termed gKAT. gKAT incorporates prior pathway knowledge when constructing a kernel function into hypothesis testing.ResultsWe apply a diffusion kernel to capture any graph structures in a gene set, then incorporate such information to build a kernel function for further association test. We illustrate the geometric meaning of the approach. Through extensive simulation studies, we show that the proposed gKAT algorithm can improve testing power compared to the one without considering graph structures. Application to a real dataset further demonstrate the utility of the method.Availability and implementationThe R code used for the analysis can be accessed at https://github.com/JialinQu/gKAT.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC8896609 | biostudies-literature