scholarly journals GWRA: grey wolf based reconstruction algorithm for compressive sensing signals

2019 ◽  
Vol 5 ◽  
pp. e217
Author(s):  
Ahmed Aziz ◽  
Karan Singh ◽  
Ahmed Elsawy ◽  
Walid Osamy ◽  
Ahmed M. Khedr

The recent advances in compressive sensing (CS) based solutions make it a promising technique for signal acquisition, image processing and other types of data compression needs. In CS, the most challenging problem is to design an accurate and efficient algorithm for reconstructing the original data. Greedy-based reconstruction algorithms proved themselves as a good solution to this problem because of their fast implementation and low complex computations. In this paper, we propose a new optimization algorithm called grey wolf reconstruction algorithm (GWRA). GWRA is inspired from the benefits of integrating both the reversible greedy algorithm and the grey wolf optimizer algorithm. The effectiveness of GWRA technique is demonstrated and validated through rigorous simulations. The simulation results show that GWRA significantly exceeds the greedy-based reconstruction algorithms such as sum product, orthogonal matching pursuit, compressive sampling matching pursuit and filtered back projection and swarm based techniques such as BA and PSO in terms of reducing the reconstruction error, the mean absolute percentage error and the average normalized mean squared error.

2018 ◽  
Vol 11 (02) ◽  
pp. 1750014 ◽  
Author(s):  
Jingjing Yu ◽  
Qiyue Li ◽  
Haiyu Wang

Bioluminescence tomography (BLT) is an important noninvasive optical molecular imaging modality in preclinical research. To improve the image quality, reconstruction algorithms have to deal with the inherent ill-posedness of BLT inverse problem. The sparse characteristic of bioluminescent sources in spatial distribution has been widely explored in BLT and many L1-regularized methods have been investigated due to the sparsity-inducing properties of L1 norm. In this paper, we present a reconstruction method based on L[Formula: see text] regularization to enhance sparsity of BLT solution and solve the nonconvex L[Formula: see text] norm problem by converting it to a series of weighted L1 homotopy minimization problems with iteratively updated weights. To assess the performance of the proposed reconstruction algorithm, simulations on a heterogeneous mouse model are designed to compare it with three representative sparse reconstruction algorithms, including the weighted interior-point, L1 homotopy, and the Stagewise Orthogonal Matching Pursuit algorithm. Simulation results show that the proposed method yield stable reconstruction results under different noise levels. Quantitative comparison results demonstrate that the proposed algorithm outperforms the competitor algorithms in location accuracy, multiple-source resolving and image quality.


2020 ◽  
Vol 34 (30) ◽  
pp. 2050294
Author(s):  
Shuheng Fang ◽  
Zhengmin Kong ◽  
Ping Hu ◽  
Li Ding

In real-world scenarios, it is difficult to know about the complete topology of a huge network with different types of links. In this brief, we propose a method to identify the topology of multidimensional networks from information transmission data. We consider information propagating over edges of a two-dimensional (2D) network, where one type of links is known and the other type is unknown. Given the state of all nodes at each unit time, we can transform the topology identification problem into a compressive sensing framework. A modified reconstruction algorithm, called Sparsity Adaptive Matching Pursuit with Mixed Threshold Mechanism (SAMPMTM), is proposed to tackle the problem. Compared with the classical Sparsity Adaptive Matching Pursuit (SAMP) algorithm, the proposed SAMPMTM algorithm can reduce the conflict rate and improve the accuracy of network recovery. We further demonstrate the performance of this improved algorithm through Monte-Carlo simulations under different network models.


2019 ◽  
Vol 15 (7) ◽  
pp. 155014771986488 ◽  
Author(s):  
Junxin Chen ◽  
Jiazhu Xing ◽  
Leo Yu Zhang ◽  
Lin Qi

In the past decades, compressed sensing emerges as a promising technique for signal acquisition in low-cost sensor networks. For prolonging the monitoring duration of biosignals, compressed sensing is also exploited for simultaneous sampling and compression of electrocardiogram signals in the wireless body sensor network. This article presents a comprehensive analysis of compressed sensing for electrocardiogram acquisition. The performances of involved important factors, such as wavelet basis, overcomplete dictionaries, and the reconstruction algorithms, are comparatively illustrated, with the purpose to give data reference for practical applications. Drawn from a bulk of comparative experiments, the potential of compressed sensing in electrocardiogram acquisition is evaluated in different compression levels, while preferred sparsifying basis and reconstruction algorithm are also suggested. Relative perspectives and discussions are also given.


2016 ◽  
Vol 11 (2) ◽  
pp. 103-109
Author(s):  
Hongtu Zhao ◽  
Chong Chen ◽  
Chenxu Shi

As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex optimization algorithms should possess higher complexity to achieve higher reconstruction quality. Also, fixed atomic numbers used in most greedy algorithms increase the complexity of reconstruction. In this context, we propose a novel algorithm, called variable atomic number matching pursuit, which can improve the accuracy and speed of reconstruction. Simulation results show that variable atomic number matching pursuit is a fast and stable reconstruction algorithm and better than the other reconstruction algorithms under the same conditions.


Author(s):  
Ashok Naganath Shinde ◽  
Sanjay L. Lalbalwar ◽  
Anil B. Nandgaonkar

In signal processing, several applications necessitate the efficient reprocessing and representation of data. Compression is the standard approach that is used for effectively representing the signal. In modern era, many new techniques are developed for compression at the sensing level. Compressed sensing (CS) is a rising domain that is on the basis of disclosure, which is a little gathering of a sparse signal’s linear projections including adequate information for reconstruction. The sampling of the signal is permitted by the CS at a rate underneath the Nyquist sampling rate while relying on the sparsity of the signals. Additionally, the reconstruction of the original signal from some compressive measurements can be authentically exploited using the varied reconstruction algorithms of CS. This paper intends to exploit a new compressive sensing algorithm for reconstructing the signal in bio-medical data. For this purpose, the signal can be compressed by undergoing three stages: designing of stable measurement matrix, signal compression and signal reconstruction. In this, the compression stage includes a new working model that precedes three operations. They are signal transformation, evaluation of [Formula: see text] and normalization. In order to evaluate the theta ([Formula: see text]) value, this paper uses the Haar wavelet matrix function. Further, this paper ensures the betterment of the proposed work by influencing the optimization concept with the evaluation procedure. The vector coefficient of Haar wavelet function is optimally selected using a new optimization algorithm called Average Fitness-based Glowworm Swarm Optimization (AF-GSO) algorithm. Finally, the performance of the proposed model is compared over the traditional methods like Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO), Firefly (FF), Crow Search (CS) and Glowworm Swarm Optimization (GSO) algorithms.


2020 ◽  
Author(s):  
Sina Faizollahzadeh Ardabili ◽  
Amir Mosavi ◽  
Shahab Band ◽  
Annamaria R. Varkonyi-Koczy

An accurate outbreak prediction of COVID-19 can successfully help to get insight into the spread and consequences of infectious diseases. Recently, machine learning (ML) based prediction models have been successfully employed for the prediction of the disease outbreak. The present study aimed to engage an artificial neural network-integrated by grey wolf optimizer for COVID-19 outbreak predictions by employing the Global dataset. Training and testing processes have been performed by time-series data related to January 22 to September 15, 2020 and validation has been performed by time-series data related to September 16 to October 15, 2020. Results have been evaluated by employing mean absolute percentage error (MAPE) and correlation coefficient (r) values. ANN-GWO provided a MAPE of 6.23, 13.15 and 11.4% for training, testing and validating phases, respectively. According to the results, the developed model could successfully cope with the prediction task.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jiping Xiong ◽  
Qinghua Tang

Compressive sensing (CS) has been widely used in wireless sensor networks for the purpose of reducing the data gathering communication overhead in recent years. In this paper, we firstly apply 1-bit compressive sensing to wireless sensor networks to further reduce the communication overhead that each sensor needs to send. Furthermore, we propose a novel blind 1-bit CS reconstruction algorithm which outperforms other state-of-the-art blind 1-bit CS reconstruction algorithms under the settings of WSN. Experimental results on real sensor datasets demonstrate the efficiency of our method.


Author(s):  
Charu Bhardwaj ◽  
Urvashi Sharma ◽  
Shruti Jain ◽  
Meenakshi Sood

Compression serves as a significant feature for efficient storage and transmission of medical, satellite, and natural images. Transmission speed is a key challenge in transmitting a large amount of data especially for magnetic resonance imaging and computed tomography scan images. Compressive sensing is an optimization-based option to acquire sparse signal using sub-Nyquist criteria exploiting only the signal of interest. This chapter explores compressive sensing for correct sensing, acquisition, and reconstruction of clinical images. In this chapter, distinctive overall performance metrics like peak signal to noise ratio, root mean square error, structural similarity index, compression ratio, etc. are assessed for medical image evaluation by utilizing best three reconstruction algorithms: basic pursuit, least square, and orthogonal matching pursuit. Basic pursuit establishes a well-renowned reconstruction method among the examined recovery techniques. At distinct measurement samples, on increasing the number of measurement samples, PSNR increases significantly and RMSE decreases.


Sign in / Sign up

Export Citation Format

Share Document