Sharif Digital Repository

In this letter, we propose a method for real-time high density impulse noise suppression from images. In our method, we first apply an impulse detector to identify the corrupted pixels and then employ an innovative weighted-average filter to restore them. The filter takes the nearest neighboring interpolated image as the initial image and computes the weights according to the relative positions of the corrupted and uncorrupted pixels. Experimental results show that the proposed method outperforms the best existing methods in both PSNR measure and visual quality and is quite suitable for real-time applications  

This paper studies detecting matrices in random dense and sparse Code Division Multiple Access (CDMA) systems. Detecting matrices were originally introduced in the coin weighing problem. Such matrices can be used in CDMA systems in over-loaded scheme where the number of users is greater than the number of chips. We drive some conditions in the large system limit for binary and bipolar random CDMA systems to ensure that any random matrix is a detecting matrix. Furthermore, we extend our results to sparse random ternary matrices that have been using in the sparse CDMA literature. Finally, a construction method for the sparse detecting matrices is introduced  

With the advent of new positioning services, one can reach more satellites these days to find his position. Using a combination of satellites which belong to different constellations needs some considerations like addressing biases between their time references. Each constellation has progressed to the point that they have enough satellites to provide accurate position separately. According to this fact, we propose to find the position in each constellation and fusion their results in a way that final position has the minimum possible variance instead of combining the constellations in a satellite level and dealing with inter system biases. Experimental studies are conducted based on IGS... 

Transcranial Doppler ultrasound can be used to detect circulating cerebral eraboli. Embolie signals have characteristic transient chirps suitable for wavelet analysis. We have implemented and evaluated the first online selective selective wavelet transient enhancement filter to amplify embolic signals in a preprocessing system. Our approach is similar to wavelet de-noising for signal enhancement, but, in order to retain blood flow information, we do not use traditional threshold methods. The selective wavelet amplifier uses the matched filter properties of wavelets to enhance embolic signals significantly and improve classification performance using a novel noise tolerant approach. Even the... 

Least squares estimation is a widely-used technique for range-based source localization, which obtains the most probable position of mobile station. These methods cannot provide desirable accuracy in the case with a non line of sight (NLOS) path between mobile station and base stations. To circumvent this drawback, many algorithms have been proposed to identify and mitigate this error; however, they have a large run-time overhead. On the other hand, new positioning systems utilize a large set of base stations, and a practical algorithm should be fast enough to deal with them. In this paper, we propose a novel algorithm based on subspace method to identify and eliminate the NLOS error.... 

We propose to use a compressed sensing recovery method called IMATCS for improving the resolution in microwave imaging applications. The electromagnetic inverse scattering problem is solved using the Distorted Born Iterative Method combined with the IMATCS algorithm. This method manages to recover small targets in cases where traditional DBIM approaches fail. Furthermore, by applying an L2-based approach to regularize the sparse recovery algorithm, we improve the algorithm's robustness and demonstrate its ability to image complex breast structures. Although our simulation scenarios do not fully represent experimental or clinical data, our results suggest that the proposed algorithm may be... 

In this article, we present a new iterative algorithm aimed at improving the performance of the sigma-delta analog to digital (A/D) converter. We subject the existing sigma-delta modulator, without changing the configuration, to an iterative procedure to increase the signal-to-noise ratio of the reconstructed signal. In other words, we demonstrate that sigma-delta modulated signals can be decoded using the iterative algorithm. Simulation results confirm that the proposed method works very well, even when less complex filters are used. The simple and regular structure of this new A/D converter, not only makes realization of the hardware as ASIC or on FPGA boards easy, but also allows it to... 

In communication systems, efficient use of the spectrum is an indispensable concern. Recently the use of compressed sensing for the purpose of estimating orthogonal frequency division multiplexing (OFDM) sparse multipath channels has been proposed to decrease the transmitted overhead in form of the pilot subcarriers which are essential for channel estimation. In this article, we investigate the problem of deterministic pilot allocation in OFDM systems. The method is based on minimizing the coherence of the submatrix of the unitary discrete fourier transform (DFT) matrix associated with the pilot subcarriers. Unlike the usual case of equidistant pilot subcarriers, we show that non-uniform... 

The problem of extracting low-dimensional structure from high-dimensional data arises in many applications such as machine learning, statistical pattern recognition, wireless sensor networks, and data compression. If the data is restricted to a lower dimensional subspace, then simple algorithms using linear projections can find the subspace and consequently estimate its dimensionality. However, if the data lies on a low-dimensional but nonlinear space (e.g., manifolds), then its structure may be highly nonlinear and, hence, linear methods are doomed to fail. In this paper, we introduce a new technique for dimensionality reduction based on point-wise operators. More precisely, let $ {bf A} n... 

In contrast to the vast amount of literature in random matrices in the field of compressed sensing, the subject of deterministic matrix design is at its early stages. Since these deterministic matrices are usually constructed using the polynomials in finite Galois fields, the number of rows (number of samples) is restricted to some specific integers such as prime powers. In this paper, besides extending a previous matrix design based on the binary BCH codes to the p-ary codes, we introduce matrices with wide variety of options for the number of rows. Simulation results demonstrate that these matrices perform almost as well as random matrices  

We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of order statistics for heavy-tail distributions and their link with α -stable laws for 1<α<2. In many cases, our proposed definition of compressibility coincides with intuition. In particular, we prove that heavy-tail (polynomial decaying) distributions fulfill the requirements of compressibility. On the other hand, exponential decaying distributions like Laplace and Gaussian do not. The results are such that two compressible distributions... 

ABSTRACT Compressed sensing is a new theory that samples a signal below the Nyquist rate. While Gaussian and Bernoulli random measurements perform quite well on the average, structured matrices such as Toeplitz are mostly used in practice due to their simplicity. However, the signal compression performance may not be acceptable. In this paper, we propose to optimize the Toeplitz matrices to improve its compression performance to recover sparse signals. We establish the optimization on minimizing the coherence of the measurement matrix by an intelligent optimization method called Particle Swarm Optimization. Our simulation results show that the optimized Toeplitz matrix outperforms the... 

In this paper a new iterative method is used to convert analog signals to digital (A/D) using sigma delta modulator (SDM). If intelligent reconstruction technique is used for decoding, either signals with higher bandwidth can be digitized or simpler circuitry can be utilized. An optimal family of SDM has recently been devised in order to improve performance of A/D converters. In this work, we improve performance of A/D converters even more, by combining this optimal family of SDM with iterative methods  

This letter proposes a dictionary learning algorithm for solving the grid mismatch problem in direction of arrival (DOA) estimation from both the array sensor data and from the sign of the array sensor data. Discretization of the grid in the sparsity-based DOA estimation algorithms is a problem, which leads to a bias error. To compensate this bias error, a dictionary learning technique is suggested, which is based on minimizing a suitable cost function. We also propose an algorithm for the estimation of DOA from the sign of the measurements. It extends the iterative method with adaptive thresholding algorithm to the 1-b compressed sensing framework. Simulation results show the effectiveness... 

This letter presents a fast microwave imaging technique based on the concept of smoothed minimization and adaptive thresholding. The distorted Born iterative method (DBIM) is used to solve the electromagnetic (EM) inverse scattering problem. We propose to solve the set of underdetermined equations at each iteration of the DBIM algorithm using an L2 regularized iterative smoothed adaptive thresholding (L2-ISATCS) technique. Our simulation results confirm that this technique can reduce considerably the required reconstruction times for the DBIM method relative to previously suggested compressed sensing (CS)-based approaches  

We propose a new image recovery method to improve the resolution in microwave imaging applications. Scattered field data obtained from a simplified breast model with closely located targets is used to formulate an electromagnetic inverse scattering problem, which is then solved using the Distorted Born Iterative Method (DBIM). At each iteration of the DBIM method, an underdetermined set of linear equations is solved using our proposed sparse recovery algorithm, IMATCS. Our results demonstrate the ability of the proposed method to recover small targets in cases where traditional DBIM approaches fail. Furthermore, in order to regularize the sparse recovery algorithm, we propose a novel... 

In this letter, we introduce a novel method for constructing large size Generalized Welch Bound Equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constructing large size matrices and low computational complexity using Maximum Likelihood (ML) decoders for a subclass of these codes. © 2010 IEEE  

In this paper, an iterative method is proposed to jointly cancel multi-user interference and clipping noise in uplink Multi-Carrier Code Division Multiple Access (MC-CDMA) systems. Clipping is the simplest method to overcome high peak-to-average power ratio of multi-carrier signals but it makes the signals distorted. Reconstruction methods use non-distorted samples to reconstruct distorted samples in the receiver but multi-user interference causes the methods do not work properly because all the received samples are distorted due to clipping and interference and so there is no undistorted samples to be used in recovering clipped samples. On the other hand, multi-user interference... 

This letter proposes a sparse diffusion algorithm for 1-bit compressed sensing (CS) in wireless sensor networks, and the algorithm is inherently robust against impulsive noise. The approach exploits the diffusion strategy from distributed learning in the 1-bit CS framework. To estimate a common sparse vector cooperatively from only the sign of measurements, a steepest descent method that minimizes the suitable global and local convex cost functions is used. A diffusion strategy is suggested for distributive learning of the sparse vector. A new application of the proposed algorithm to sparse channel estimation is also introduced. The proposed sparse diffusion algorithm is compared with both... 

In this paper, we present a compressive sampling and multihypothesis (MH) reconstruction strategy for video sequences that has a rather simple encoder, while the decoding system is not that complex. We introduce a convex cost function that incorporates the MH technique with the sparsity constraint and the Tikhonov regularization. Consequently, we derive a new iterative algorithm based on these criteria. This algorithm surpasses its counterparts (Elasticnet and Tikhonov) in recovery performance. Besides, it is computationally much faster than Elasticnet and comparable with Tikhonov. Our extensive simulation results confirm these claims