Application of Compressive Sensing to Ultrasound Images: A Review.

Compressive sensing (CS) offers compression of data below the Nyquist rate, making it an attractive solution in the field of medical imaging, and has been extensively used for ultrasound (US) compression and sparse recovery. In practice, CS offers a reduction in data sensing, transmission, and storage. Compressive sensing relies on the sparsity of data; i.e., data should be sparse in original or in some transformed domain. A look at the literature reveals that rich variety of algorithms have been suggested to recover data using compressive sensing from far fewer samples accurately, but with tradeoffs for efficiency. This paper reviews a number of significant CS algorithms used to recover US images from the undersampled data along with the discussion of CS in 3D US images. In this paper, sparse recovery algorithms applied to US are classified in five groups. Algorithms in each group are discussed and summarized based on their unique technique, compression ratio, sparsifying transform, 3D ultrasound, and deep learning. Research gaps and future directions are also discussed in the conclusion of this paper. This study is aimed to be beneficial for young researchers intending to work in the area of CS and its applications, specifically to US.

Improved Reconstruction of MR Scanned Images by Using a Dictionary Learning Scheme.

The application of compressed sensing (CS) to biomedical imaging is sensational since it permits a rationally accurate reconstruction of images by exploiting the image sparsity. The quality of CS reconstruction methods largely depends on the use of various sparsifying transforms, such as wavelets, curvelets or total variation (TV), to recover MR images. As per recently developed mathematical concepts of CS, the biomedical images with sparse representation can be recovered from randomly undersampled data, provided that an appropriate nonlinear recovery method is used. Due to high under-sampling, the reconstructed images have noise like artifacts because of aliasing. Reconstruction of images from CS involves two steps, one for dictionary learning and the other for sparse coding. In this novel framework, we choose Simultaneous code word optimization (SimCO) patch-based dictionary learning that updates the atoms simultaneously, whereas Focal underdetermined system solver (FOCUSS) is used for sparse representation because of a soft constraint on sparsity of an image. Combining SimCO and FOCUSS, we propose a new scheme called SiFo. Our proposed alternating reconstruction scheme learns the dictionary, uses it to eliminate aliasing and noise in one stage, and afterwards restores and fills in the k-space data in the second stage. Experiments were performed using different sampling schemes with noisy and noiseless cases of both phantom and real brain images. Based on various performance parameters, it has been shown that our designed technique outperforms the conventional techniques, like K-SVD with OMP, used in dictionary learning based MRI (DLMRI) reconstruction.

History based forward and feedback mechanism in cooperative spectrum sensing including malicious users in cognitive radio network.

In cognitive radio communication, spectrum sensing plays a vital role in sensing the existence of the primary user (PU). The sensing performance is badly affected by fading and shadowing in case of single secondary user(SU). To overcome this issue, cooperative spectrum sensing (CSS) is proposed. Although the reliability of the system is improved with cooperation but existence of malicious user (MU) in the CSS deteriorates the performance. In this work, we consider the Kullback-Leibler (KL) divergence method for minimizing spectrum sensing data falsification (SSDF) attack. In the proposed CSS scheme, each SU reports the fusion center(FC) about the availability of PU and also keeps the same evidence in its local database. Based on the KL divergence value, if the FC acknowledges the user as normal, then the user will send unified energy information to the FC based on its current and previous sensed results. This method keeps the probability of detection high and energy optimum, thus providing an improvement in performance of the system. Simulation results show that the proposed KL divergence method has performed better than the existing equal gain combination (EGC), maximum gain combination (MGC) and simple KL divergence schemes in the presence of MUs.

Numerical solution to generalized Burgers'-Fisher equation using Exp-function method hybridized with heuristic computation.

In this paper, a new heuristic scheme for the approximate solution of the generalized Burgers'-Fisher equation is proposed. The scheme is based on the hybridization of Exp-function method with nature inspired algorithm. The given nonlinear partial differential equation (NPDE) through substitution is converted into a nonlinear ordinary differential equation (NODE). The travelling wave solution is approximated by the Exp-function method with unknown parameters. The unknown parameters are estimated by transforming the NODE into an equivalent global error minimization problem by using a fitness function. The popular genetic algorithm (GA) is used to solve the minimization problem, and to achieve the unknown parameters. The proposed scheme is successfully implemented to solve the generalized Burgers'-Fisher equation. The comparison of numerical results with the exact solutions, and the solutions obtained using some traditional methods, including adomian decomposition method (ADM), homotopy perturbation method (HPM), and optimal homotopy asymptotic method (OHAM), show that the suggested scheme is fairly accurate and viable for solving such problems.

A novel modulation classification approach using Gabor filter network.

A Gabor filter network based approach is used for feature extraction and classification of digital modulated signals by adaptively tuning the parameters of Gabor filter network. Modulation classification of digitally modulated signals is done under the influence of additive white Gaussian noise (AWGN). The modulations considered for the classification purpose are PSK 2 to 64, FSK 2 to 64, and QAM 4 to 64. The Gabor filter network uses the network structure of two layers; the first layer which is input layer constitutes the adaptive feature extraction part and the second layer constitutes the signal classification part. The Gabor atom parameters are tuned using Delta rule and updating of weights of Gabor filter using least mean square (LMS) algorithm. The simulation results show that proposed novel modulation classification algorithm has high classification accuracy at low signal to noise ratio (SNR) on AWGN channel.

5D parameter estimation of near-field sources using hybrid evolutionary computational techniques.

Hybrid evolutionary computational technique is developed to jointly estimate the amplitude, frequency, range, and 2D direction of arrival (elevation and azimuth angles) of near-field sources impinging on centrosymmetric cross array. Specifically, genetic algorithm is used as a global optimizer, whereas pattern search and interior point algorithms are employed as rapid local search optimizers. For this, a new multiobjective fitness function is constructed, which is the combination of mean square error and correlation between the normalized desired and estimated vectors. The performance of the proposed hybrid scheme is compared not only with the individual responses of genetic algorithm, interior point algorithm, and pattern search, but also with the existing traditional techniques. The proposed schemes produced fairly good results in terms of estimation accuracy, convergence rate, and robustness against noise. A large number of Monte-Carlo simulations are carried out to test out the validity and reliability of each scheme.

Performance analysis of relay subset selection for amplify-and-forward cognitive relay networks.

Cooperative communication is regarded as a key technology in wireless networks, including cognitive radio networks (CRNs), which increases the diversity order of the signal to combat the unfavorable effects of the fading channels, by allowing distributed terminals to collaborate through sophisticated signal processing. Underlay CRNs have strict interference constraints towards the secondary users (SUs) active in the frequency band of the primary users (PUs), which limits their transmit power and their coverage area. Relay selection offers a potential solution to the challenges faced by underlay networks, by selecting either single best relay or a subset of potential relay set under different design requirements and assumptions. The best relay selection schemes proposed in the literature for amplify-and-forward (AF) based underlay cognitive relay networks have been very well studied in terms of outage probability (OP) and bit error rate (BER), which is deficient in multiple relay selection schemes. The novelty of this work is to study the outage behavior of multiple relay selection in the underlay CRN and derive the closed-form expressions for the OP and BER through cumulative distribution function (CDF) of the SNR received at the destination. The effectiveness of relay subset selection is shown through simulation results.

Nature inspired computational technique for the numerical solution of nonlinear singular boundary value problems arising in physiology.

We present a hybrid heuristic computing method for the numerical solution of nonlinear singular boundary value problems arising in physiology. The approximate solution is deduced as a linear combination of some log sigmoid basis functions. A fitness function representing the sum of the mean square error of the given nonlinear ordinary differential equation (ODE) and its boundary conditions is formulated. The optimization of the unknown adjustable parameters contained in the fitness function is performed by the hybrid heuristic computation algorithm based on genetic algorithm (GA), interior point algorithm (IPA), and active set algorithm (ASA). The efficiency and the viability of the proposed method are confirmed by solving three examples from physiology. The obtained approximate solutions are found in excellent agreement with the exact solutions as well as some conventional numerical solutions.

A new stochastic technique for Painlevé equation-I using neural network optimized with swarm intelligence.

A methodology for solution of Painlevé equation-I is presented using computational intelligence technique based on neural networks and particle swarm optimization hybridized with active set algorithm. The mathematical model of the equation is developed with the help of linear combination of feed-forward artificial neural networks that define the unsupervised error of the model. This error is minimized subject to the availability of appropriate weights of the networks. The learning of the weights is carried out using particle swarm optimization algorithm used as a tool for viable global search method, hybridized with active set algorithm for rapid local convergence. The accuracy, convergence rate, and computational complexity of the scheme are analyzed based on large number of independents runs and their comprehensive statistical analysis. The comparative studies of the results obtained are made with MATHEMATICA solutions, as well as, with variational iteration method and homotopy perturbation method.