Loading...
Search for: randomly-sampling
0.01 seconds
Total 30 records

    Recovery from random samples in a big data set

    , Article IEEE Communications Letters ; Volume 19, Issue 11 , September , 2015 , Pages 1929-1932 ; 10897798 (ISSN) Molavipour, S ; Gohari, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Consider a collection of files, each of which is a sequence of letters. One of these files is randomly chosen and a random subsequence of the file is revealed. This random subsequence can be the result of a random sampling of the file. The goal is to recover the identity of the file, assuming a simple greedy matching algorithm to search the file collection. We study the fundamental limits on the maximum size of the file collection for reliable recovery in terms of the length of the random subsequence. The sequence of each file is assumed to follow a hidden Markov model (HMM), which is a common model for many data structures such as voice or DNA sequences. The connection between this problem... 

    Progressive sparse image sensing using Iterative Methods

    , Article 2012 6th International Symposium on Telecommunications, IST 2012 ; 2012 , Pages 897-901 ; 9781467320733 (ISBN) Azghani, M ; Marvasti, F ; Sharif University of Technology
    2012
    Abstract
    Progressive image transmission enables the receivers to reconstruct a transmitted image at various bit rates. Most of the works in this field are based on the conventional Shannon-Nyquist sampling theory. In the present work, progressive image transmission is investigated using sparse recovery of random samples. The sparse recovery methods such as Iterative Method with Adaptive Thresholding (IMAT) and Iterative IKMAX Thresholding (IKMAX) are exploited in this framework since they have the ability for successive reconstruction. The simulation results indicate that the proposed method performs well in progressive recovery. The IKMAX has better final reconstruction than IMAT at the cost of... 

    Bounds on discrete fourier transform of random mask

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 327-330 ; 9781538615652 (ISBN) Zarmehi, N ; Marvasti, F ; Anbarjafari, G ; Kivinukk, A ; Tamberg, G ; Sharif University of Technology
    Abstract
    This paper proposes some bounds on maximum of magnitude of a random mask in Fourier domain. The random mask is used in random sampling scheme. Having a bound on the maximum value of a random mask in Fourier domain is very useful for some iterative recovery methods that use thresholding operator. In this paper, we propose some different bounds and compare them with the empirical examples. © 2017 IEEE  

    Adaptive motion planning with artificial potential fields using a prior path

    , Article International Conference on Robotics and Mechatronics, ICROM 2015, 7 October 2015 through 9 October 2015 ; 2015 , Pages 731-736 ; 9781467372343 (ISBN) Amiryan, J ; Jamzad, M ; Sharif University of Technology
    2015
    Abstract
    Motion planning in an autonomous agent is responsible for providing smooth, safe and efficient navigation. Many solutions for dealing this problem have been offered, one of which is, Artificial Potential Fields (APF). APF is a simple and computationally low cost method which keeps the robot away from the obstacles in environment. However, this approach suffers from trapping in local minima of potential function and then fails to produce motion plans. Furthermore, Oscillation in presence of obstacles or in narrow passages is another disadvantage of the method which makes it unqualified for many planning problems. In this paper we aim to resolve these deficiencies by a novel approach which... 

    Applications of sparse signal processing

    , Article 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016, 7 December 2016 through 9 December 2016 ; 2017 , Pages 1349-1353 ; 9781509045457 (ISBN) Azghani, M ; Marvasti, F ; IEEE Signal Processing Society; The Institute of Electrical and Electronics Engineers ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    Sparse signal processing has found various applications in different research areas where the sparsity of the signal of interest plays a significant role in addressing their ill-posedness. In this invited paper, we give a brief review of a number of such applications in inverse scattering of microwave medical imaging, compressed video sensing, and missing sample recovery based on sparsity. Moreover, some of our recent results on these areas have been reported which confirms the fact that leveraging the sparsity prior of the underlying signal can improve different processing tasks in various problems. © 2016 IEEE  

    , M.Sc. Thesis Sharif University of Technology Sharifzadeh, Abdorrahman (Author) ; Behnia, Fereidoon (Supervisor)
    Abstract
    In this thesis, Particle Filter Methods are investigated in the context of moving targets tracking and the associated performance analysis. The application scope of this algorithm which is a particular case of Sequential Monte Carlo Method is far broader than tracking of moving targets. This algorithm can be used for mathematical calculations such as estimation of mathematical expectations, integrals, surface area of curves and many other mathematical calculations. In addition, it has applications in other branches of science like genetics. This algorithm is based on random sampling of a probability density function and resampling from the extracted samples. We change this algorithm in... 

    The Information Theory Approach to Communication over Deletion Channel with Hidden Markov Codebook

    , M.Sc. Thesis Sharif University of Technology Molavipour, Sina (Author) ; Aminzadeh Gohari, Amin (Supervisor)
    Abstract
    One of the main challenges in data transmission is synchronization error. In practice there are solutions to this issue, but this incurs a cost that can not be neglected. Synchronization error consists of deletion, insertion and substitution. Investigation of such errors in a communication channel has been of a great concern in information theory. Furthermore, in many applications such as biology and data storage on disks, we observe synchronization errors. Deletion channel is defined as a channel in which input symbols are deleted with a probability d independently of each other, such that the order of symbols remains unchanged. In spite of attempts to find a closed form for the capacity of... 

    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... 

    Performance Improvement of MIMO Radars Based on Compressive Sensing

    , M.Sc. Thesis Sharif University of Technology Tayefi, Javad (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    This thesis is dedicated to examine performance of compressive sensing based MIMO radar systems. MIMO radars have the ability to achieve higher target detection and parameter estimation as well as better performance in noisy and clutter environments than SISO or phased array radars. The need for high-speed analog to digital converters is one of the weaknesses in implementation of radar systems. With the advent of compressive sensing providing necessary guarantees for reconstruction of sparse signal using fewer samples than what Nyquist thorem describes, the need for such a high-speed converters that are either not available or too expensive is resolved. What allowes us to use compressive... 

    3-point RANSAC for fast vision based rotation estimation using GPU technology

    , Article IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems9 February 2017 ; 2017 , Pages 212-217 ; 9781467397087 (ISBN) Kamran, D ; Manzuri, M. T ; Marjovi, A ; Karimian, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    In many sensor fusion algorithms, the vision based RANdom Sample Consensus (RANSAC) method is used for estimating motion parameters for autonomous robots. Usually such algorithms estimate both translation and rotation parameters together which makes them inefficient solutions for merely rotation estimation purposes. This paper presents a novel 3-point RANSAC algorithm for estimating only the rotation parameters between two camera frames which can be utilized as a high rate source of information for a camera-IMU sensor fusion system. The main advantage of our proposed approach is that it performs less computations and requires fewer iterations for achieving the best result. Despite many... 

    Spectrum Sensing in Cognitive Radios Using Compressive Sensing and Random Sampling

    , M.Sc. Thesis Sharif University of Technology Dezfouli, Milad (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    Cognitive radio (CR) can successfully deal with the growing demand and scarcity of the wireless spectrum. To exploit limited spectrum efficiently, CR technology allows unlicensed users to access licensed spectrum bands. Since licensed users have priorities to use the bands, the unlicensed users need to continuously monitor the licensed users activities to avoid interference and collisions. How to obtain reliable results of the licensed users activities is the main task for spectrum sensing. Based on the sensing results, the unlicensed users should adapt their transmit powers and access strategies to protect the licensed communications. The requirement naturally presents challenges to the... 

    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... 

    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... 

    Approximate Transportation Network Reliability Measures for Solving Transportation Network Improvement Problem

    , M.Sc. Thesis Sharif University of Technology Iranitalab, Amirfarrokh (Author) ; Poorzahedy, Hossain (Supervisor)
    Abstract
    Long-term effects of natural disasters, like earthquakes, in many cases have been reported high on transportation networks. Disruption in this lifeline network's performance imposes high social and economic costs upon the society. Undoubtedly, retrofitting the structures of all network links (or constructing new links) are practically impossible and economically infeasible. One solution to this problem is finding a method for determining the network's important links, and retrofitting their structures. Based on this concept, an optimization problem of network performance improvement under these stochastic events is introduced. In this problem, a link importance index for network links is... 

    A GES/TS algorithm for the job shop scheduling

    , Article Computers and Industrial Engineering ; Volume 62, Issue 4 , 2012 , Pages 946-952 ; 03608352 (ISSN) Nasiri, M. M ; Kianfar, F ; Sharif University of Technology
    2012
    Abstract
    The job shop scheduling problem is a difficult combinatorial optimization problem. This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem. The proposed algorithm used biased random sampling to have a better covering of the solution space. In addition, a new version of N6 neighborhood is applied in a tabu search framework. In order to evaluate the algorithm, comprehensive tests are applied to it using various standard benchmark sets. Computational results confirm the effectiveness of the algorithm and its high speed. Besides, 19 new upper bounds among the unsolved problems are found  

    Iterative block-sparse recovery method for distributed MIMO radar

    , Article 2016 Iran Workshop on Communication and Information Theory, IWCIT 2016, 3 May 2016 through 4 May 2016 ; 2016 ; 9781509019229 (ISBN) Abtahi, A ; Azghani, M ; Tayefi, J ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    In this paper, an iterative method for block-sparse recovery is suggested for target parameters estimation in a distributed MIMO radar system. The random sampling has been used as the sensing scheme in the receivers. The simulation results prove that the proposed method is superior to the other state-of-the-art techniques in the accuracy of the target estimation task. © 2016 IEEE  

    Comparison of uniform and random sampling for speech and music signals

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 552-555 ; 9781538615652 (ISBN) Zarmehi, N ; Shahsavari, S ; Marvasti, F ; Sharif University of Technology
    Abstract
    In this paper, we will provide a comparison between uniform and random sampling for speech and music signals. There are various sampling and recovery methods for audio signals. Here, we only investigate uniform and random schemes for sampling and basic low-pass filtering and iterative method with adaptive thresholding for recovery. The simulation results indicate that uniform sampling with cubic spline interpolation outperforms other sampling and recovery methods. © 2017 IEEE  

    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...