Loading...
Search for: sparse-recovery
0.018 seconds
Total 25 records

    Corrigendum to "ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization" [Signal Processing 92 (2012) 1875-1885] (DOI:10.1016/j.sigpro.2011.09.035)

    , Article Signal Processing ; 2013 ; 01651684 (ISSN) Niazadeh, R ; Hamidi Ghalehjegh, S ; Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    2013
    Abstract
    In this paper, which is an extended version of our work at LVA/ICA 2010 [1], the problem of Inter Symbol Interface (ISI) Sparse channel estimation and equalization will be investigated. We firstly propose an adaptive method based on the idea of Least Mean Square (LMS) algorithm and the concept of smoothed l0 (SL0) norm presented in [2] for estimation of sparse ISI channels. Afterwards, a new non-adaptive fast channel estimation method based on SL0 sparse signal representation is proposed. ISI channel estimation will have a direct effect on the performance of the ISI equalizer at the receiver. So, in this paper we investigate this effect in the case of optimal Maximum Likelihood... 

    A nonlinear acceleration method for iterative algorithms

    , Article Signal Processing ; Volume 168 , 2020 Shamsi, M ; Ghandi, M ; Marvasti, F ; Sharif University of Technology
    Elsevier B.V  2020
    Abstract
    Iterative methods have led to better understanding and solving problems such as missing sampling, deconvolution, inverse systems, and impulsive and Salt and Pepper noise removal problems. However, the challenges regarding the speed of convergence and or the accuracy of the answer still remain. In order to improve the existing iterative algorithms, a non-linear method is discussed in this paper. The mentioned method is analyzed from different aspects, including its convergence and its ability to accelerate recursive algorithms. We show that this method is capable of improving Iterative Method (IM) as a non-uniform sampling reconstruction algorithm and some other iterative sparse recovery... 

    Non-Coherent DOA estimation Via majorization-minimization using sign information

    , Article IEEE Signal Processing Letters ; Volume 29 , 2022 , Pages 892-896 ; 10709908 (ISSN) Delbari, M ; Javaheri, A ; Zayyani, H ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2022
    Abstract
    In this letter, the problem of non-coherent direction of arrival (DOA) estimation is investigated exploiting the sign of the measurements in order to resolve the inherent ambiguity of the problem. Although the phase values are inaccurate, the sign of real and imaginary parts of the measurements will most likely remain correct under limited phase errors. Furthermore, a new approach for solving the problem is proposed employing a modified version of the Majorization-Minimization (MM) technique, without any prior information about the number of incident signals. Some theoretical analyses of our proposed algorithm are also provided in the paper. Finally, the simulation results are presented,... 

    Efficient Iterative Sparse Recovery Techniques

    , Ph.D. Dissertation Sharif University of Technology Azghani, Masoumeh (Author) ; Marvasti, Farokh (Supervisor)
    Abstract
    In this thesis, we aim to explore the recovery of sparse signals from their compressive or random samples. At first, the Compressed Sensing (CS) recovery is considered and an iterative method with adaptive thresholding has been suggested which has superior performance compared to its counterparts in both reconstruction quality and simplicity. Then, random sampling, a special kind of compressive sensing, is investigated which is practically more efficient to be implemented than the compressive sampling scheme. A number of random sampling recovery techniques are offered based on sparsity which has very low computational complexity in a way that largedimensional signals can efficiently be... 

    UCS-NT: An unbiased compressive sensing framework for Network Tomography

    , Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings ; 2013 , Pages 4534-4538 ; 15206149 (ISSN) ; 9781479903566 (ISBN) Mahyar, H ; Rabiee, H. R ; Hashemifar, Z. S ; Sharif University of Technology
    2013
    Abstract
    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... 

    Dictionary learning for sparse decomposition: A new criterion and algorithm

    , Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings ; 2013 , Pages 5855-5859 ; 15206149 (ISSN) ; 9781479903566 (ISBN) Sadeghipoor, Z ; Babaie Zadeh, M ; Jutten, C ; IEE Signal Processing Society ; Sharif University of Technology
    2013
    Abstract
    During the last decade, there has been a growing interest toward the problem of sparse decomposition. A very important task in this field is dictionary learning, which is designing a suitable dictionary that can sparsely represent a group of training signals. In most dictionary learning algorithms, the cost function to determine the the optimum dictionary is the ℓ0 norm of the matrix of decomposition coefficients of the training signals. However, we believe that this cost function fails to fully express the goal of dictionary learning, because it only sparsifies the whole set of coefficients for all training signals, rather than the coefficients for each training signal individually. Thus,... 

    A low-cost sparse recovery framework for weighted networks under compressive sensing

    , Article Proceedings - 2015 IEEE International Conference on Smart City, SmartCity 2015, Held Jointly with 8th IEEE International Conference on Social Computing and Networking, SocialCom 2015, 5th IEEE International Conference on Sustainable Computing and Communications, SustainCom 2015, 2015 International Conference on Big Data Intelligence and Computing, DataCom 2015, 5th International Symposium on Cloud and Service Computing, SC2 2015, 19 December 2015 through 21 December 2015 ; 2015 , Pages 183-190 ; 9781509018932 (ISBN) Mahyar, H ; Rabiee, H. R ; Movaghar, A ; Hasheminezhad, R ; Ghalebi, E ; Nazemian, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    In this paper, motivated by network inference, we introduce a general framework, called LSR-Weighted, to efficiently recover sparse characteristic of links in weighted networks. The links in many real-world networks are not only binary entities, either present or not, but rather have associated weights that record their strengths relative to one another. Such models are generally described in terms of weighted networks. The LSR-Weighted framework uses a newly emerged paradigm in sparse signal recovery named compressive sensing. We study the problem of recovering sparse link vectors with network topological constraints over weighted networks. We evaluate performance of the proposed framework... 

    Robust sparse recovery in impulsive noise via continuous mixed norm

    , Article IEEE Signal Processing Letters ; Volume 25, Issue 8 , 2018 , Pages 1146-1150 ; 10709908 (ISSN) Javaheri, A ; Zayyani, H ; Figueiredo, M. A. T ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    This letter investigates the problem of sparse signal recovery in the presence of additive impulsive noise. The heavy-tailed impulsive noise is well modeled with stable distributions. Since there is no explicit formula for the probability density function of SαS distribution, alternative approximations are used, such as, generalized Gaussian distribution, which imposes ℓp-norm fidelity on the residual error. In this letter, we exploit a continuous mixed norm (CMN) for robust sparse recovery instead of ℓp-norm. We show that in blind conditions, i.e., in the case where the parameters of the noise distribution are unknown, incorporating CMN can lead to near-optimal recovery. We apply... 

    Beamforming and DOA Estimation Using Compressive Sensing and Random Sampling

    , M.Sc. Thesis Sharif University of Technology Zamani, Hojatollah (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    Direction Of Arrival (DOA) estimation or direction finding refers to determining the arrival angle of a planar wave impinging on the array of sensors or antennas. The DOA information can be used by the smart antenna system for beam-forming and reliable data transmission. The problem of DOA estimation in propagating plane waves played a fundamental role in many applications including acoustic, wireless communication systems, navigation, biomedical imaging, radar/sonar systems, seismic sensing, and wireless 911 emergency call locating. In the conventional DOA estimating systems, an array of elements (antennas or sensors) is used that are colocated in a uniform pattern called, Uniform Linear... 

    Sparse Representation with Application to Image Inpainting

    , M.Sc. Thesis Sharif University of Technology Javaheri, Amir Hossein (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    The emerging field of compressed sensing has found wide-spread applications in signal processing. Exploiting the sparsity of natural image signals on basis of a set of atoms called dictionary, one can find numerous examples for applications of compressed sensing in the field of image processing. One of these interesting applications is to help recover missing samples of a damaged or lossy image signal which is also known as image inpainting. There are dozens of reasons why an image may get damaged, for instance, during data transmission, some blocks of an image (or frames of a video ) may get lost due to error in the telecommunication channel (this is known as block-loss). In this case image... 

    Detection of Central Nodes in Social Networks

    , Ph.D. Dissertation Sharif University of Technology Mahyar, Hamid Reza (Author) ; Movaghar, Ali (Supervisor) ; Rabiee, Hamid Reza (Supervisor)
    Abstract
    In analyzing the structural organization of many real-world networks, identifying important nodes has been a fundamental problem. The network centrality concept deals with the assessment of the relative importance of network nodes based on specific criteria. Central nodes can play significant roles on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. High computational cost and the requirement of full knowledge about the network topology are the most significant obstacles for applying the general concept of network centrality to large real-world social... 

    Sparse Recovery in Peer to Peer Networks via Compressive Sensing

    , M.Sc. Thesis Sharif University of Technology Fattaholmanan Najafabadi, Ali (Author) ; Rabiei, Hamid Reza (Supervisor)
    Abstract
    Monitoring large-scale networks is a critical yet challenging task. Enormous number of nodes and links, limited power, and lack of direct acceß to the entire network,are the most important difficulties. In applications such as network routing,where all nodes need to monitor the status of the entire network, the situation is even worse. In this thesis, a collaborative model in which nodes pick up information from measurements generated by other nodes, is proposed. Considering the fact that in most cases the networked data is sufficiently sparse, we used the Compreßive Sensing theory in the recovery phase of the proposed method. Using this model, for the first time, an upper bound is derived... 

    Sparse Representation and its Applications in Multi-Sensor Problems

    , Ph.D. Dissertation Sharif University of Technology Malek-Mohammadi, Mohammad Reza (Author) ; Babaie-Zade, Massoud (Supervisor)
    Abstract
    Recovery of low-rank matrices from compressed linear measurements is an extension for the more well-known topic of recovery of sprse vectors from underdetermined measurements.Since the natural approach (i.e., rank minimization) for recovery of low-rank matrices is generally NP-hard, several alternatives have been proposed. However, there is a large gap between what can be achieved from these alternatives and the natural approach in terms of maximum rank of the unique solutions and the error of recovery. To narrow this gap, two novel algorithms are proposed. The main idea of both algorithms is to closely approximate the rank with a smooth function of singular values and then minimize the... 

    Sparse Recovery Methods for MIMO Radar Systems

    , Ph.D. Dissertation Sharif University of Technology Abtahi Fahliani, Azra (Author) ; Marvasti, Farokh (Supervisor)
    Abstract
    Due to its higher degrees of freedom in comparison with a Single-Input Single-Output (SISO) radar , a Multiple-Input Multiple-Output (MIMO) radar has superior resolution , higher accuracy in detection and estimation , and more flexibility in beamforming . As there are multiple receivers in a MIMO radar system , if we can reduce the sampling rate and send fewer samples to the common processing center , the cost can significantly be reduced . Sometimes , the problem is not even the cost . It is the technology issues of high sampling rates . The reduction in sampling rate can be achieved using Compressive Sensing (CS) or in a much simpler form Random Sampling (RS) . In CS , we take... 

    Matrix coherency graph: A tool for improving sparse coding performance

    , Article 2015 International Conference on Sampling Theory and Applications, SampTA 2015, 25 May 2015 through 29 May 2015 ; May , 2015 , Pages 168-172 ; 9781467373531 (ISBN) Joneidi, M ; Zaeemzadeh, A ; Rahnavard, N ; Khalilsarai, M. B ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally intractable, while ℓ1 minimization will do the job when a Restricted Isometry Property holds for the dictionary. Yet, practical sparse recovery algorithms may fail to recover the vector of coefficients even when the dictionary deviates from the RIP only slightly. To enjoy ℓ1 minimization guarantees in a wider sense, a method based on a combination of full-search and ℓ1 minimization is presented. The idea is based on partitioning the dictionary into atoms which are in some sense... 

    Large Array Null Steering Using Compressed Sensing

    , Article IEEE Signal Processing Letters ; Volume 23, Issue 8 , 2016 , Pages 1032-1036 ; 10709908 (ISSN) Khosravi, M ; Fakharzadeh, M ; Bastani, M. H ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc 
    Abstract
    In this letter, array null steering is formulated as a sparse recovery problem. In addition, a novel null steering scheme for large arrays by perturbing only a few elements is presented. To achieve this goal, compressed sensing (CS) is used to exploit the sparsity of the perturbed elements. The advantages of the proposed scheme are a significant reduction in hardware cost and lower power consumption, as well as less aging of the elements and faster response. Simulation results show that the CS-based method could be efficiently used to generate wide nulls using at least two elements. The interference rejection ratio achieved by the proposed method is 10-20 dB better than the existing... 

    Recovery of missing samples using sparse approximation via a convex similarity measure

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 543-547 ; 9781538615652 (ISBN) Javaheri, A ; Zayyani, H ; Marvasti, F ; Anbarjafari, G ; Kivinukk, A ; Tamberg, G ; Sharif University of Technology
    Abstract
    In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image processing and for this purpose, we suggest an iterative sparse recovery algorithm based on constrained l1-norm minimization with a new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index, is a simplified version of the Structural SIMilarity (SSIM) index, which is convex and error-sensitive. The optimization problem incorporating this criterion, is then... 

    An adaptive iterative thresholding algorithm for distributed MIMO radars

    , Article IEEE Transactions on Aerospace and Electronic Systems ; 16 July , 2018 , Page(s): 523 - 533 ; 00189251 (ISSN) Abtahi, A ; Azghani, M ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    In this paper, a Block Iterative Method with Adaptive Thresholding for Sparse Recovery (BIMATSR) is proposed to recover the received signal in an under-sampled distributed MIMO radar. The BIMATSR scheme induces block sparsity with the aid of a signal-dependent thresholding operator which increases the accuracy of the target parameter estimation task. We have proved that under some sufficient conditions, the suggested scheme converges to a stable solution. Moreover, different simulation scenarios confirm that the BIMATSR algorithm outperforms its counterparts in terms of the target parameter estimation. This superiority is achieved at the expense of slightly more computational complexity. It... 

    Off-grid localization in mimo radars using sparsity

    , Article IEEE Signal Processing Letters ; Volume 25, Issue 2 , 2018 , Pages 313-317 ; 10709908 (ISSN) Abtahi, A ; Gazor, S ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    In this letter, we propose a new accurate approach for target localization in multiple-input multiple-output (MIMO) radars, which exploits the sparse spatial distribution of targets to reduce the sampling rate. We express the received signal of a MIMO radar in terms of the deviations of target parameters from the grid points in the form of a block sparse signal using the expansion around all the neighbor points. Applying a block sparse recovery method, we can estimate both the grid-point locations of targets and these deviations. The proposed approach can yield more accurate localization with higher detection probability compared with its counterparts. Moreover, the proposed approach can... 

    Distribution-aware block-sparse recovery via convex optimization

    , Article IEEE Signal Processing Letters ; Volume 26, Issue 4 , 2019 , Pages 528-532 ; 10709908 (ISSN) Daei, S ; Haddadi, F ; Amini, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    We study the problem of reconstructing a block-sparse signal from compressively sampled measurements. In certain applications, in addition to the inherent block-sparse structure of the signal, some prior information about the block support, i.e., blocks containing non-zero elements, might be available. Although many block-sparse recovery algorithms have been investigated in the Bayesian framework, it is still unclear how to incorporate the information about the probability of occurrence into regularization-based block-sparse recovery in an optimal sense. In this letter, we bridge between these fields by the aid of a new concept in conic integral geometry. Specifically, we solve a weighted...