GWRA: grey wolf based reconstruction algorithm for compressive sensing signals.
Ontology highlight
ABSTRACT:
SUBMITTER: Aziz A
PROVIDER: S-EPMC7924449 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The Aquila Optimizer (AO) is a metaheuristic algorithm that is inspired by the hunting behavior of the Aquila bird. The AO approach has been proven to perform effectively on a range of benchmark optimization issues. However, the AO algorithm may suffer from limited exploration ability in specific situations. To increase the exploration ability of the AO algorithm, this work offers a hybrid approach that employs the alpha position of the Grey Wolf Optimizer (GWO) to drive the search process of the AO algorithm. At the same time, we applied the quasi-opposition-based learning (QOBL) strategy in each phase of the Aquila Optimizer algorithm. This strategy develops quasi-oppositional solutions to current solutions. The quasi-oppositional solutions are then utilized to direct the search phase of the AO algorithm. The GWO method is also notable for its resistance to noise. This means that it can perform effectively even when the objective function is noisy. The AO algorithm, on the other hand, may be sensitive to noise. By integrating the GWO approach into the AO algorithm, we can strengthen its robustness to noise, and hence, improve its performance in real-world issues. In order to evaluate the effectiveness of the technique, the algorithm was benchmarked on 23 well-known test functions and CEC2017 test functions and compared with other popular metaheuristic algorithms. The findings demonstrate that our proposed method has excellent efficacy. Finally, it was applied to five practical engineering issues, and the results showed that the technique is suitable for tough problems with uncertain search spaces.
| S-EPMC10813268 | biostudies-literature
Project description:Compressive sensing (CS) is a sub-Nyquist sampling framework that has been employed to improve the performance of numerous imaging applications during the last 15 years. Yet, its application for large and high-resolution imaging remains challenging in terms of the computation and acquisition effort involved. Often, low-resolution imaging is sufficient for most of the considered tasks and only a fraction of cases demand high resolution, but the problem is that the user does not know in advance when high-resolution acquisition is required. To address this, we propose a multiscale progressive CS method for the high-resolution imaging. The progressive sampling refines the resolution of the image, while incorporating the already sampled low-resolution information, making the process highly efficient. Moreover, the multiscale property of the progressively sensed samples is capitalized for a fast, deep learning (DL) reconstruction, otherwise infeasible due to practical limitations of training on high-resolution images. The progressive CS and the multiscale reconstruction method are analyzed numerically and demonstrated experimentally with a single pixel camera imaging system. We demonstrate 4-megapixel size progressive compressive imaging with about half the overall number of samples, more than an order of magnitude faster reconstruction, and improved reconstruction quality compared to alternative conventional CS approaches.
| S-EPMC9068919 | biostudies-literature
Project description:We introduce a novel algorithm for inference of causal gene interactions, termed CaSPIAN (Causal Subspace Pursuit for Inference and Analysis of Networks), which is based on coupling compressive sensing and Granger causality techniques. The core of the approach is to discover sparse linear dependencies between shifted time series of gene expressions using a sequential list-version of the subspace pursuit reconstruction algorithm and to estimate the direction of gene interactions via Granger-type elimination. The method is conceptually simple and computationally efficient, and it allows for dealing with noisy measurements. Its performance as a stand-alone platform without biological side-information was tested on simulated networks, on the synthetic IRMA network in Saccharomyces cerevisiae, and on data pertaining to the human HeLa cell network and the SOS network in E. coli. The results produced by CaSPIAN are compared to the results of several related algorithms, demonstrating significant improvements in inference accuracy of documented interactions. These findings highlight the importance of Granger causality techniques for reducing the number of false-positives, as well as the influence of noise and sampling period on the accuracy of the estimates. In addition, the performance of the method was tested in conjunction with biological side information of the form of sparse "scaffold networks", to which new edges were added using available RNA-seq or microarray data. These biological priors aid in increasing the sensitivity and precision of the algorithm in the small sample regime.
| S-EPMC3951243 | biostudies-literature
Project description:Acquiring swallowing accelerometry signals using a comprehensive sensing scheme may be a desirable approach for monitoring swallowing safety for longer periods of time. However, it needs to be insured that signal characteristics can be recovered accurately from compressed samples. In this paper, we considered this issue by examining the effects of the number of acquired compressed samples on the calculated swallowing accelerometry signal features. We used tri-axial swallowing accelerometry signals acquired from seventeen stroke patients (106 swallows in total). From acquired signals, we extracted typically considered signal features from time, frequency and time-frequency domains. Next, we compared these features from the original signals (sampled using traditional sampling schemes) and compressively sampled signals. Our results have shown we can obtain accurate estimates of signal features even by using only a third of original samples.
| S-EPMC5042204 | biostudies-literature
Project description:Multipath signal is often considered an interference that must be removed. The coherence between multipath and direct component makes it difficult to use conventional direction-of-arrival (DOA) estimation methods in a smart antenna system. This study demonstrates a new multipath signal DOA estimation technique. Unlike the common methods, without decoherence preprocessing, the proposed algorithm first apply a complex fast independent component analysis (cFastICA) algorithm to obtain the steering vectors with multipath information that corresponds to each source signal. Then, according to the special structure of the obtained steering vectors and spatial sparsity of the multipath signal components, the algorithm uses the solution of the sparse signal reconstruction problem in the compressive sensing (CS) theory, and the DOA estimation of the multipath signal is translated into an l1 norm minimization problem. Finally, we search the space spectrums to acquire the DOAs for each direct component and multipath component. Comparative simulation tests and analysis prove the effectiveness of the proposed algorithm in estimation accuracy in underdetermined conditions.
| S-EPMC5531488 | biostudies-literature
Project description:Analyses of Y chromosome haplotypes uniquely provide a paternal picture of evolutionary histories and offer a very useful contrast to studies based on maternally inherited mitochondrial DNA (mtDNA). Here we used a bioinformatic approach based on comparison of male and female sequence coverage to identify 4.7 Mb from the grey wolf (Canis lupis) Y chromosome, probably representing most of the male-specific, nonampliconic sequence from the euchromatic part of the chromosome. We characterized this sequence and then identified ?1,500 Y-linked single nucleotide polymorphisms in a sample of 145 resequenced male wolves, including 75 Finnish wolf genomes newly sequenced in this study, and in 24 dogs and eight other canids. We found 53 Y chromosome haplotypes, of which 26 were seen in grey wolves, that clustered in four major haplogroups. All four haplogroups were represented in samples of Finnish wolves, showing that haplogroup lineages were not partitioned on a continental scale. However, regional population structure was indicated because individual haplotypes were never shared between geographically distant areas, and genetically similar haplotypes were only found within the same geographical region. The deepest split between grey wolf haplogroups was estimated to have occurred 125,000 years ago, which is considerably older than recent estimates of the time of divergence of wolf populations. The distribution of dogs in a phylogenetic tree of Y chromosome haplotypes supports multiple domestication events, or wolf paternal introgression, starting 29,000 years ago. We also addressed the disputed origin of a recently founded population of Scandinavian wolves and observed that founding as well as most recent immigrant haplotypes were present in the neighbouring Finnish population, but not in sequenced wolves from elsewhere in the world, or in dogs.
| S-EPMC6850511 | biostudies-literature
Project description:MotivationSeeding is a rate-limiting stage in sequence alignment for next-generation sequencing reads. The existing optimization algorithms typically utilize hardware and machine-learning techniques to accelerate seeding. However, an efficient solution provided by professional next-generation sequencing compressors has been largely overlooked by far. In addition to achieving remarkable compression ratios by reordering reads, these compressors provide valuable insights for downstream alignment that reveal the repetitive computations accounting for more than 50% of seeding procedure in commonly used short read aligner BWA-MEM at typical sequencing coverage. Nevertheless, the exploited redundancy information is not fully realized or utilized.ResultsIn this study, we present a compressive seeding algorithm, named CompSeed, to fill the gap. CompSeed, in collaboration with the existing reordering-based compression tools, finishes the BWA-MEM seeding process in about half the time by caching all intermediate seeding results in compact trie structures to directly answer repetitive inquiries that frequently cause random memory accesses. Furthermore, CompSeed demonstrates better performance as sequencing coverage increases, as it focuses solely on the small informative portion of sequencing reads after compression. The innovative strategy highlights the promising potential of integrating sequence compression and alignment to tackle the ever-growing volume of sequencing data.Availability and implementationCompSeed is available at https://github.com/i-xiaohu/CompSeed.
| S-EPMC10955252 | biostudies-literature
Project description:The use of spatial light modulators to project computer generated holograms is a common strategy for optogenetic stimulation of multiple structures of interest within a three-dimensional volume. A common requirement when addressing multiple targets sparsely distributed in three dimensions is the generation of a points cloud, focusing excitation light in multiple diffraction-limited locations throughout the sample. Calculation of this type of holograms is most commonly performed with either the high-speed, low-performance random superposition algorithm, or the low-speed, high performance Gerchberg-Saxton algorithm. This paper presents a variation of the Gerchberg-Saxton algorithm that, by only performing iterations on a subset of the data, according to compressive sensing principles, is rendered significantly faster while maintaining high quality outputs. The algorithm is presented in high-efficiency and high-uniformity variants. All source code for the method implementation is available as Supplementary Materials and as open-source software. The method was tested computationally against existing algorithms, and the results were confirmed experimentally on a custom setup for in-vivo multiphoton optogenetics. The results clearly show that the proposed method can achieve computational speed performances close to the random superposition algorithm, while retaining the high performance of the Gerchberg-Saxton algorithm, with a minimal hologram quality loss.
| S-EPMC6481074 | biostudies-literature
Project description:The grey wolf optimizer is an effective and well-known meta-heuristic algorithm, but it also has the weaknesses of insufficient population diversity, falling into local optimal solutions easily, and unsatisfactory convergence speed. Therefore, we propose a hybrid grey wolf optimizer (HGWO), based mainly on the exploitation phase of the harris hawk optimization. It also includes population initialization with Latin hypercube sampling, a nonlinear convergence factor with local perturbations, some extended exploration strategies. In HGWO, the grey wolves can have harris hawks-like flight capabilities during position updates, which greatly expands the search range and improves global searchability. By incorporating a greedy algorithm, grey wolves will relocate only if the new location is superior to the current one. This paper assesses the performance of the hybrid grey wolf optimizer (HGWO) by comparing it with other heuristic algorithms and enhanced schemes of the grey wolf optimizer. The evaluation is conducted using 23 classical benchmark test functions and CEC2020. The experimental results reveal that the HGWO algorithm performs well in terms of its global exploration ability, local exploitation ability, convergence speed, and convergence accuracy. Additionally, the enhanced algorithm demonstrates considerable advantages in solving engineering problems, thus substantiating its effectiveness and applicability.
| S-EPMC10739963 | biostudies-literature
Project description:The COVID-19 pandemic is threatening billions of people's life all over the world. As of March 6, 2021, covid-19 has confirmed in 115,653,459 people worldwide. It has also a devastating effect on businesses and social activities. Since there is still no definite cure for this disease, extensive testing is the most critical issue to determine the trend of illness, appropriate medical treatment, and make social distancing policies. Besides, testing more people in a shorter time helps to contain the contagion. The PCR-based methods are the most popular tests which take about an hour to make the output result. Obviously, it makes the number of tests highly limited and consequently, hurts the efficiency of pandemic control. In this paper, we propose a new approach to identify affected individuals with a considerably reduced No. of tests. Intuitively, saving time and resources is the main advantage of our approach. We use contextual information to make a graph-based model to be used in model-based compressive sensing (CS). Our proposed model makes the testing with fewer tests required compared to traditional testing methods and even group testing. We embed contextual information such as age, underlying disease, symptoms (i.e. cough, fever, fatigue, loss of consciousness), and social contacts into a graph-based model. This model is used in model-based CS to minimize the required test. We take advantage of Discrete Graph Signal Processing on Graph (DSPG) to generate the model. Our contextual model makes CS more efficient in both the number of samples and the recovery quality. Moreover, it can be applied in the case that group testing is not applicable due to its severe dependency on sparsity. Experimental results show that the overall testing speed (individuals per test ratio) increases more than 15 times compared to the individual testing with the error of less than 5% which is dramatically lower than that of traditional compressive sensing.
| S-EPMC8362654 | biostudies-literature