Sharif Digital Repository

Heart rate monitoring using wrist-type using photoplethysmographic (PPG) signals during subjects' intensive exercises is a challenging problem, since signals are strongly affected by motion artifacts caused by unexpected movements. This paper presents a method that uses both time and frequency characteristics of signals; using sparse signal reconstruction for high-resolution spectrum estimation. Experimental results on type data sets recorded from 12 subjects during fast running at peak speed of 15 km/hour. The results have a performance with the average absolute error being 1.80 beat per minute  

Clipping the OFDM signals in the digital part of the transmitter is one of the simplest methods to reduce the peak factor. However, it suffers from additional clipping distortion, peak regrowth after digital to analog conversion, and out-of-band radiation in the case of oversampled sequence clipping. In this letter, we use oversampled sequence clipping to combat the effect of peak regrowth and propose a method to reconstruct the clipped samples and mitigate the clipping distortion in the presence of channel noise at the expense of bandwidth expansion. We show through extensive simulations that by slightly increasing the bandwidth of the system, we can significantly improve the performance... 

The multidimensional Discrete Wavelet Transform (DWT) has been widely used in signal and image processing for regularly sampled data. For irregularly sampled data, however, other techniques should be used including the Least Square Wavelet Decomposition (LSWD). The commonly used level by level (sequential) wavelet decomposition, which calculates the wavelet coefficients in each resolution separately, may result in a gross interpolation error. To overcome this drawback, a different approach called the Simultaneous Least Square Wavelet Decomposition, which computes all wavelet coefficients simultaneously, have been proposed by the authors. In this paper, we extend the simultaneous LSWD... 

This paper addresses the problem of recovering sparse link vectors with network topological constraints that is motivated by network inference and tomography applications. We propose a novel framework called UCS-NT in the context of compressive sensing for sparse recovery in networks. In order to efficiently recover sparse specification of link vectors, we construct a feasible measurement matrix using this framework through connected paths. It is theoretically shown that, only O(k log(n)) path measurements are sufficient for uniquely recovering any k-sparse link vector. Moreover, extensive simulations demonstrate that this framework would converge to an accurate solution for a wide class of... 

This paper presents a new Compressive Sensing (CS) scheme for detecting network congested links. We focus on decreasing the required number of measurements to detect all congested links in the context of network tomography. We have expanded the LASSO objective function by adding a new term corresponding to the prior knowledge based on the relationship between the congested links and the corresponding link Betweenness Centrality (BC). The accuracy of the proposed model is verified by simulations on two real datasets. The results demonstrate that our model outperformed the state-of-the-art CS based method with significant improvements in terms of F-Score  

This paper deals with the problem of estimating the position of emitters using only direction of arrival information. We propose an improvement of newly developed algorithm for position finding of a stationary emitter called sensitivity analysis. The proposed method uses Taylor series expansion iteratively to enhance the estimation of the emitter location and reduce position finding error. Simulation results show that our proposed method makes a great improvement on accuracy of position finding with respect to sensitivity analysis method  

In this paper, we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar m × n RIP fulfilling ± 1 matrices of order k such that m ≤ script O sign (k(log2 n) log2 k/ln log2 k). The columns of these matrices are binary BCH code vectors where the zeros are replaced by -1. Since the RIP is established by means of coherence, the simple greedy algorithms such as Matching Pursuit are able to recover the sparse solution from the noiseless samples. Due to the cyclic property of the BCH codes, we show that the FFT algorithm can be employed in the reconstruction methods to considerably reduce the computational... 

In this paper we extended a previously investigated modular method that is designed to compensate for interpolation distortions of one-dimensional signals, to two dimensions (2-D). Next the proposed 2-D modular technique was applied in an iterative fashion and was shown through both simulations and theoretical analyses to enhance the convergence of the iterative technique. In fact, with only a few modules we were able to achieve drastic improvements in signal reconstruction, and with a much less computational complexity. Moreover, both the simulations and the theoretical analysis confirmed the robustness of the proposed scheme against additive noise  

In this paper, based on a successively accuracy-increasing approximation of the ℓ0 norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class of concave functions that aggressively induce sparsity and their closeness to the ℓ0 norm can be controlled. We prove that the series of the approximations asymptotically coincides with the ℓ1 and ℓ0 norms when the approximation accuracy changes from the worst fitting to the best fitting. When measurements are noise-free, an optimization scheme is proposed that leads to a number of weighted ℓ1 minimization programs, whereas, in the presence of noise, we propose... 

For the target parameter estimation in MIMO radars in the presence of strong clutter, non-adaptive compressive sensing methods have a poor performance. On the other hand, the adaptive ones usually need higher data acquisition time. In this paper, we propose an adaptive compressive sensing method called L-BGT that has tolerable data acquisition time. furthermore, we have presented the essential changes in a distributed MIMO radar to exploit an adaptive group testing compressive sensing method  

In this paper, we suggest to use a modified version of Smoothed- ℓ0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in the sparse representation of the training signals, while previous algorithms assumed that it is known in advance. Our simulation results show the advantages of our method over K-SVD in terms of complexity and performance. ©2009 IEEE  

Sparse Decomposition (SD) of a signal on an overcomplete dictionary has recently attracted a lot of interest in signal processing and statistics, because of its potential application in many different areas including Compressive Sensing (CS). However, in the current literature, the dictionary matrix has generally been assumed to be of full-rank. In this paper, we consider non-full-rank dictionaries (which are not even necessarily overcomplete), and extend the definition of SD over these dictionaries. Moreover, we present an approach which enables to use previously developed SD algorithms for this non-full-rank case. Besides this general approach, for the special case of the Smoothed ℓ0 (SL0)... 

It has been shown that more accurate signal recovery can be achieved with low-coherence dictionaries in sparse signal processing. In this Letter, the authors extend the low-coherence attribute to receptive fields in convolutional neural networks. A new constrained formulation to train low-coherence convolutional neural network is presented and an efficient algorithm is proposed to train the network. The resulting formulation produces a direct link between the receptive fields of a layer through training procedure that can be used to extract more informative representations from the subsequent layers. Simulation results over three benchmark datasets confirm superiority of the proposed... 

This work is about the total variation (TV) minimization which is used for recovering gradient-sparse signals from compressed measurements. Recent studies indicate that TV minimization exhibits a phase transition behavior from failure to success as the number of measurements increases. In fact, in large dimensions, TV minimization succeeds in recovering the gradient-sparse signal with high probability when the number of measurements exceeds a certain threshold; otherwise, it fails almost certainly. Obtaining a closed-form expression that approximates this threshold is a major challenge in this field and has not been appropriately addressed yet. In this work, we derive a tight lower-bound on... 

In this paper, the application of a well known mathematical theorem, Banach's fixed point theorem [1], is investigated in iterative signal processing in communications. In most practical communication systems some sort of a contraction mapping is used to enhance the operation of the system. Thus, using a suitable iterative approach, one can set the system in its fixed point and hence, the distortion produced in the transmitter, channel and the receiver can be compensated. In other words, a loosely designed transceiver can be enhanced by an iterative method. In order to verify the truth of the proposed iterative method, the distortion of A/D and D/A converters is compensated at the receiver.... 

Within the compressive sensing (CS) framework, one effective way to increase the likelihood of successful signal reconstruction is to employ random processes in the construction of the sensing matrix. This study presents a 3D holey cavity, with diverse frequency modes, to spectrally code, that is, randomize, the ultrasound wave fields. The simulated results show that the use of such a cavity enables imaging simple or complex targets, such as spheres or the letter E, by only a single transceiver—something that is not possible without the use of a coding structure like the cavity. The effect of noise on imaging results and the size of the targets on the first-order Born approximation (BA) are... 

This paper considers the problem of interpolating signals defined on graphs. A major presumption considered by many previous approaches to this problem has been low-pass/band-limitedness of the underlying graph signal. However, inspired by the findings on sparse signal reconstruction, we consider the graph signal to be rather sparse/compressible in the Graph Fourier Transform (GFT) domain and propose the Iterative Method with Adaptive Thresholding for Graph Interpolation (IMATGI) algorithm for sparsity promoting interpolation of the underlying graph signal. We analytically prove convergence of the proposed algorithm. We also demonstrate efficient performance of the proposed IMATGI algorithm...