Dataset Information

Two-step proximal gradient descent algorithm for photoacoustic signal unmixing.

ABSTRACT: Photoacoustic microscopy uses multiple wavelengths to measure concentrations of different absorbers. The speed of sound limits the shortest wavelength switching time to sub-microseconds, which is a bottleneck for high-speed broad-spectrum imaging. Via computational separation of overlapped signals, we can break the sound-speed limit on the wavelength switching time. This paper presents a new signal unmixing algorithm named two-step proximal gradient descent. It is advantageous in separating multiple wavelengths with long overlapping and high noise. In the simulation, we can unmix up to nine overlapped signals and successfully separate three overlapped signals with 12-ns delay and 15.9-dB signal-to-noise ratio. We apply this technique to separate three-wavelength photoacoustic images in microvessels. In vivo results show that the algorithm can successfully unmix overlapped multi-wavelength photoacoustic signals, and the unmixed data can improve accuracy in oxygen saturation imaging.

SUBMITTER: Qu Z

PROVIDER: S-EPMC9198964 | biostudies-literature | 2022 Sep

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Two-step proximal gradient descent algorithm for photoacoustic signal unmixing.

Qu Zheng Z Liu Chao C Zhu Jingyi J Zhang Yachao Y Zhou Yingying Y Wang Lidai L

Photoacoustics 20220609

Photoacoustic microscopy uses multiple wavelengths to measure concentrations of different absorbers. The speed of sound limits the shortest wavelength switching time to sub-microseconds, which is a bottleneck for high-speed broad-spectrum imaging. Via computational separation of overlapped signals, we can break the sound-speed limit on the wavelength switching time. This paper presents a new signal unmixing algorithm named two-step proximal gradient descent. It is advantageous in separating mult ...[more]

PMID: 35722270

Similar Datasets

Project description:BackgroundGene networks in living cells can change depending on various conditions such as caused by different environments, tissue types, disease states, and development stages. Identifying the differential changes in gene networks is very important to understand molecular basis of various biological process. While existing algorithms can be used to infer two gene networks separately from gene expression data under two different conditions, and then to identify network changes, such an approach does not exploit the similarity between two gene networks, and it is thus suboptimal. A desirable approach would be clearly to infer two gene networks jointly, which can yield improved estimates of network changes.ResultsIn this paper, we developed a proximal gradient algorithm for differential network (ProGAdNet) inference, that jointly infers two gene networks under different conditions and then identifies changes in the network structure. Computer simulations demonstrated that our ProGAdNet outperformed existing algorithms in terms of inference accuracy, and was much faster than a similar approach for joint inference of gene networks. Gene expression data of breast tumors and normal tissues in the TCGA database were analyzed with our ProGAdNet, and revealed that 268 genes were involved in the changed network edges. Gene set enrichment analysis identified a significant number of gene sets related to breast cancer or other types of cancer that are enriched in this set of 268 genes. Network analysis of the kidney cancer data in the TCGA database with ProGAdNet also identified a set of genes involved in network changes, and the majority of the top genes identified have been reported in the literature to be implicated in kidney cancer. These results corroborated that the gene sets identified by ProGAdNet were very informative about the cancer disease status. A software package implementing the ProGAdNet, computer simulations, and real data analysis is available as Additional file 1.ConclusionWith its superior performance over existing algorithms, ProGAdNet provides a valuable tool for finding changes in gene networks, which may aid the discovery of gene-gene interactions changed under different conditions.

Project description:BackgroundGene Regulatory Networks (GRNs) have become a major focus of interest in recent years. Elucidating the architecture and dynamics of large scale gene regulatory networks is an important goal in systems biology. The knowledge of the gene regulatory networks further gives insights about gene regulatory pathways. This information leads to many potential applications in medicine and molecular biology, examples of which are identification of metabolic pathways, complex genetic diseases, drug discovery and toxicology analysis. High-throughput technologies allow studying various aspects of gene regulatory networks on a genome-wide scale and we will discuss recent advances as well as limitations and future challenges for gene network modeling. Novel approaches are needed to both infer the causal genes and generate hypothesis on the underlying regulatory mechanisms.MethodologyIn the present article, we introduce a new method for identifying a set of optimal gene regulatory pathways by using structural equations as a tool for modeling gene regulatory networks. The method, first of all, generates data on reaction flows in a pathway. A set of constraints is formulated incorporating weighting coefficients. Finally the gene regulatory pathways are obtained through optimization of an objective function with respect to these weighting coefficients. The effectiveness of the present method is successfully tested on ten gene regulatory networks existing in the literature. A comparative study with the existing extreme pathway analysis also forms a part of this investigation. The results compare favorably with earlier experimental results. The validated pathways point to a combination of previously documented and novel findings.ConclusionsWe show that our method can correctly identify the causal genes and effectively output experimentally verified pathways. The present method has been successful in deriving the optimal regulatory pathways for all the regulatory networks considered. The biological significance and applicability of the optimal pathways has also been discussed. Finally the usefulness of the present method on genetic engineering is depicted with an example.

Dataset Information

Two-step proximal gradient descent algorithm for photoacoustic signal unmixing.

Publications

Two-step proximal gradient descent algorithm for photoacoustic signal unmixing.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets