Loading...
Search for: iteration-method
0.011 seconds
Total 327 records

    Designing an Efficient Non-Volatile Approximate Main Memory Through Managing the Write Process

    , M.Sc. Thesis Sharif University of Technology Karimpour, Morteza (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    Memories today expose an all-or-nothing correctness model thatincurs significant costs in performance, energy, area, and designcomplexity. But not all applications need high-precision storagefor all of their data structures all of the time. This these proposesmechan-isms that enable applications to store data approximately in a phase change memory main memoryand shows that doing so can improve the performance and reduce the power consumption by proposing two mechanisms. The First allows errors in multi-level cells by reducing the number ofprogramming pulses used to write them. The second mechanism reduces the number of error-prone patterns in the content of data block through a lightweith... 

    Iteratively Constructing Preconditioners via the Conjugate Gradient Method

    , M.Sc. Thesis Sharif University of Technology Mousa Abadian, Mohammad (Author) ; Farhadi, Hamid Reza (Supervisor)
    Abstract
    The main goal of this work is solving system of linear equations Ax = b, where A is a n_n square matrix, b is a n_1 vector and x is the vector of unknowns. When n is large, using direct methods is not economical. Thus, the system is solved by iterative methods. At first, projection method onto subspace K _ Rn with dimension m _ n is described, and then this subspace K is equalized with the krylov subspace. Then,some samples of projection methods onto the krylov subspace, such as FOM, GMRES and CG (Conjugate Gradient), are considered. The preconditioning of the linear system is explained, that is, instead of solving system Ax = b, the system PAx = Pb (P nonsingular), is solved, such that the... 

    Non-Uniform MRI Scan Time Reduction Using Iterative Methods

    , M.Sc. Thesis Sharif University of Technology Ghayem, Fateme (Author) ; Marvasti, Farrokh (Supervisor) ; Shamsollahi, Mohammad Bagher (Supervisor)
    Abstract
    Magnetic Resonance Imaging is one of the most advanced medical imaging procedure that noninvasively played in most applications. However, this imaging method is a good resolution, but not in the conventional high speed imaging method, in fact, the main problem is slow. In recent years many studies have been done to accelerate MRI that compressed sensing can be mentioned among them. Such methods, however, have had very good results but MRI systems are very complex. This project investigates the reconstruction of MR images using data from partial non-Cartesian samples aimed at reducing sampling time and also speed up the process of reconstruction of MR images have been studied. In this regard,... 

    Incremental Discovery of Representative Sample Sets in Networks

    , M.Sc. Thesis Sharif University of Technology Salehe, Mohammad (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    In many network which relationships between nodes are defined based on the similarity of attributes (Such as the World Wide Web and social networks), extracting information about networks object’s attributes may be difficult or even in many cases impossible.In these cases, predicting unknown attributes based on other objects attributes according to network structure can be extremely useful.Even more, finding a representative sample set of objects and trying to obtain their attributes in order to predict other object’s attributes with this obtained data can be an interesting problem. Finding such a set of objects with minimum size while giving maximizing accuracy in predicting other object’s... 

    Study on Non-Linear Approaches for Accelerating Iterative Methods

    , M.Sc. Thesis Sharif University of Technology Shamsi, Mahdi (Author) ; Marvasti, Farokh (Supervisor)
    Abstract
    In this correspondence, a non-linear method of convergence accelerating and improving for iteration based algorithms is introduced. After convergence analysis, some enough conditions are proposed to guarantee convergence of the algorithm.For the sake of low complexity implementation of the proposed algorithm, some simple stabilizing methods are suggested. Simulation results show desirable performance of the proposed method and its capability to stabilize the iteration based algorithms. In the literature of missing samples recovery, the proposed method is applied to an Iterative Method (IM) as a general signal reconstruction method,then it is extended to the image recovery problem where... 

    Overloaded Time-Frequency Modulation Schema for 5-6 G Mobile Systems

    , Ph.D. Dissertation Sharif University of Technology Shamsi, Mahdi (Author) ; Marvasti, Farokh (Supervisor)
    Abstract
    Increasing dynamics of mobile users intensifies the Doppler effect and degrades the performance of the communication system. Considering Fourier kernel-based modulation, in this research, we focus on dealing with the Doppler effect and compensating non-ideal communication channel response suffered from the Doppler-delay spread. In the first step, we study Zak transform and present a new transform for 2-D representation of time signals. This mapping is a well-known transformation that can be considered as a generalized discrete-time Fourier transform in the field of signal processing and can be used to represent a signal in the delay-Doppler domain. After providing a new 2-D transform, we... 

    Digital Image Processing Using Sparse Representation Based on Iterative Methods

    , M.Sc. Thesis Sharif University of Technology Salemi, Gholamali (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    The main purpose of the thesis is Digital image Processing using the sparsity of image. The issue could be described in two ways. First is reconstruction of missed blocks of an image based on the sparsity of image in the transform domain and second is impulsive noise removal using the sparsity of noise in the spatial domain. In the first approach we will review Guleryuz method and simulate and analyze it. In the second approach, two new methods named RDE and Knockout will be introduced. These methods try two remove the impulsive noise of an image using its sparseness. RDE method is a development of conventional methods, but Knockout has a completely new idea. We will show that Knockout is... 

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

    Distributed Sparse Signal Recovery

    , M.Sc. Thesis Sharif University of Technology Rahimpour, Amir (Author) ; Marvasti, Farrokh (Supervisor)
    Abstract
    Sensor Networks are set of devices which are distributed throughout an environment and are connected to each other, usually wirelessly, to collect environmental information including temperature, aire pressure, moist, pollution and physiological functions of the human body. Each device consists of a microprocessor, converter and power supply, transmitter and a receiver. In this study we intend to investigate such setup and the measured signals assuming they are sparse. A sparse signal is a discrete time signal most of indices of which are equal to zero. With this assumption at hand, we will be able to reduce the sampling rate and take advantage of sparse signal processing techniques. This... 

    Design of Detector for SEFDM Signals

    , M.Sc. Thesis Sharif University of Technology Heydari Khormizi, Javad (Author) ; Marvasti, Farokh (Supervisor)
    Abstract
    This thesis considers theoretical, analytical and engineering design issues relating to non-orthogonal Spectrally Efficient Frequency Division Multiplexing (SEFDM) communication systems that exhibit significant spectral merits when compared to Orthogonal FDM (OFDM) schemes. Alas, the practical implementation of such systems raises significant challenges, with the receivers being the bottleneck.
    This research explores detection of SEFDM signals. The mathematical foundations of such signals lead to proposals of different orthonormalisation techniques as required at the receivers of non-orthogonal FDM systems. To address SEFDM detection, two approaches are considered: either attempt to... 

    An iterative bayesian algorithm for sparse component analysis in presence of noise

    , Article IEEE Transactions on Signal Processing ; Volume 57, Issue 11 , 2009 , Pages 4378-4390 ; 1053587X (ISSN) Zayyani, H ; Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    2009
    Abstract
    We present a Bayesian approach for Sparse Component Analysis (SCA) in the noisy case. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations with additive Gaussian noise. In general, an underdetermined system of linear equations has infinitely many solutions. However, it has been shown that sufficiently sparse solutions can be uniquely identified. Our main objective is to find this unique solution. Our method is based on a novel estimation of source parameters and maximum a posteriori (MAP) estimation of sources. To tackle the great complexity of the MAP algorithm (when the number of sources and mixtures become large),... 

    Sparse component analysis in presence of noise using an iterative EM-MAP algorithm

    , Article 7th International Conference on Independent Component Analysis (ICA) and Source Separation, ICA 2007, London, 9 September 2007 through 12 September 2007 ; Volume 4666 LNCS , 2007 , Pages 438-445 ; 03029743 (ISSN); 9783540744931 (ISBN) Zayyani, H ; Babaie Zadeh, M ; Mohimani, G. H ; Jutten, C ; Sharif University of Technology
    Springer Verlag  2007
    Abstract
    In this paper, a new algorithm for source recovery in under-determined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented in the noisy case. The algorithm is essentially a method for obtaining sufficiently sparse solutions of under-determined systems of linear equations with additive Gaussian noise. The method is based on iterative Expectation-Maximization of a Maximum A Posteriori estimation of sources (EM-MAP) and a new steepest-descent method is introduced for the optimization in the Mstep. The solution obtained by the proposed algorithm is compared to the minimum ℓ1-norm solution achieved by Linear Programming (LP). It is experimentally... 

    Adaptive singular value thresholding

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 442-445 ; 9781538615652 (ISBN) Zarmehi, N ; Marvasti, F ; Anbarjafari, G ; Kivinukk, A ; Tamberg, G ; Sharif University of Technology
    Abstract
    In this paper, we propose an Adaptive Singular Value Thresholding (ASVT) for low rank recovery under affine constraints. Unlike previous iterative methods that the threshold level is independent of the iteration number, in our proposed method, the threshold in adaptively decreases during iterations. The simulation results reveal that we get better performance with this thresholding strategy. © 2017 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  

    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  

    Sparse and low-rank recovery using adaptive thresholding

    , Article Digital Signal Processing: A Review Journal ; Volume 73 , 2018 , Pages 145-152 ; 10512004 (ISSN) Zarmehi, N ; Marvasti, F ; Sharif University of Technology
    Elsevier Inc  2018
    Abstract
    In this paper, we propose an algorithm for recovery of sparse and low-rank components of matrices using an iterative method with adaptive thresholding. In each iteration of the algorithm, the low-rank and sparse components are obtained using a thresholding operator. The proposed algorithm is fast and can be implemented easily. We compare it with the state-of-the-art algorithms. We also apply it to some applications such as background modeling in video sequences, removing shadows and specularities from face images, and image restoration. The simulation results show that the proposed algorithm has a suitable performance with low run-time. © 2017 Elsevier Inc  

    Winding function model for predicting performance of 2-DOF wound rotor resolver

    , Article IEEE Transactions on Transportation Electrification ; Volume 8, Issue 2 , 2022 , Pages 2062-2069 ; 23327782 (ISSN) Zare, F ; Nasiri Gheidari, Z ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2022
    Abstract
    Two-degree-of-freedom (2-DOF) electrical machines require position sensors for their motion control. In comparison with using two independent sensors, using a 2-DOF sensor enhances the closed-loop control system's performance. However, due to the 3-D structure of the 2-DOF sensor, its performance evaluation needs 3-D analysis. Also, due to helical motion the accuracy deterioration of the sensor, under mechanical faults needs more attention. Although the finite element method (FEM) is the best way to simulate such sensors, most of the commercial packages for transient finite element simulations are not able to consider two separate motions simultaneously. Furthermore, FEM has a high... 

    Investigation of error propagation and measurement error for 2D block method in Electrical Impedance Tomography

    , Article 2015 2nd International Conference on Pattern Recognition and Image Analysis, IPRIA 2015, 11 March 2015 through 12 March 2015 ; 2015 ; 9781479984459 (ISBN) Zaravi, S ; Amirfattahi, R ; Vosoughi Vahdat, B ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    2D block method (2D BM) is a new approach to solve inverse problem as one of the most challenging case in Electrical Impedance Tomography (EIT). In this method, a tissue is modeled by some blocks to construct a medical image of a body limb. Recently, a non-iterative linear inverse solution is introduced to solve the inverse problem in the 2D BM. But effect of measurement error has not been considered for non-iterative linear inverse solution yet. In this paper, an appropriate method is proposed to investigate the error propagation in 2D BM. The effect of measurement error is considered as well through different examples. Results show that the BM is very sensitive to the measurement error and... 

    Improving 2D block method in electrical impedance tomography

    , Article 2015 22nd Iranian Conference on Biomedical Engineering, ICBME 2015, 25 November 2015 through 28 November 2015 ; 2015 , Pages 245-250 ; 9781467393515 (ISBN) Zaravi, S ; Amirfattahi, R ; Vosoughi Vahdat, B ; Hassanipour, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Block method (BM) is a simple and fast method to solve inverse and forward problems in Electrical Impedance Tomography (EIT). In BM, at first tissue is modeled by some blocks and it is assumed that each block has a specific conductivity. Then a medical image is constructed by calculation of its conductivity. Recently, a non-iterative linear inverse solution is presented for block method which we name 2D BM. In this paper, an efficient algorithm with new formulation is proposed to improve the 2D BM, and then several examples have been investigated to examine the proposed method. Results show that suggested algorithm achieves better outcomes in all situations, although its run time is... 

    A practical exact algorithm for the shortest loop design problem in a block layout

    , Article International Journal of Production Research ; Volume 43, Issue 9 , 2005 , Pages 1879-1887 ; 00207543 (ISSN) Zanjirani Farahani, R ; Laporte, G ; Sharifyazdi, M ; Sharif University of Technology
    2005
    Abstract
    The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial integer linear programming solver embedded within an iterative scheme. © 2005 Taylor & Francis Group Ltd