Loading...
Search for: matrix-estimation
0.005 seconds

    Approximated Cramér-Rao bound for estimating the mixing matrix in the two-sensor noisy Sparse Component Analysis (SCA)

    , Article Digital Signal Processing: A Review Journal ; Volume 23, Issue 3 , 2013 , Pages 771-779 ; 10512004 (ISSN) Zayyani, H ; Babaie Zadeh, M ; Sharif University of Technology
    2013
    Abstract
    In this paper, we address theoretical limitations in estimating the mixing matrix in noisy Sparse Component Analysis (SCA) in the two-sensor case. We obtain the Cramér-Rao Bound (CRB) error estimation of the mixing matrix based on the observation vector x=(x1,x2)T. Using the Bernoulli-Gaussian (BG) sparse distribution for sources, and some reasonable approximations, the Fisher Information Matrix (FIM) is approximated by a diagonal matrix. Then, the effect of off-diagonal terms in computing the CRB is investigated. Moreover, we compute an oracle CRB versus the blind uniform CRB and show that this is only 3 dB better than the blind uniform CRB. Finally, the CRB, the approximated CRB, the... 

    Design and Implementation of Distributed Dimensionality Reduction Algorithms under Communication Constraints

    , M.Sc. Thesis Sharif University of Technology Rahmani, Mohammad Reza (Author) ; Maddah Ali, Mohammad Ali (Supervisor) ; Salehkaleybar, Saber (Supervisor)
    Abstract
    Nowadays we are witnessing the emergence of machine learning in various applications. One of the key problems in data science and machine learning is the problem of dimensionality reduction, which deals with finding a mapping that embeds samples to a lower-dimensional space such that, the relationships between the samples and their properties are preserved in the secondary space as much as possible. Obtaining such mapping is essential in today's high-dimensional settings. Moreover, due to the large volume of data and high-dimensional samples, it is infeasible or insecure to process and store all data in a single machine. As a result, we need to process data in a distributed manner.In this... 

    The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

    , Article Transportation Planning and Technology ; Volume 38, Issue 7 , 2015 , Pages 795-815 ; 03081060 (ISSN) Talebian, A ; Shafahi, Y ; Sharif University of Technology
    Routledge  2015
    Abstract
    Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential... 

    Estimation of origin–destination matrices using link counts and partial path data

    , Article Transportation ; Volume 47, Issue 6 , 2020 , Pages 2923-2950 Rostami Nasab, M ; Shafahi, Y ; Sharif University of Technology
    Springer  2020
    Abstract
    After several decades of work by several talented researchers, estimation of the origin–destination matrix using traffic data has remained very challenging. This paper presents a set of innovative methods for estimation of the origin–destination matrix of large-scale networks, using vehicle counts on links, partial path data obtained from an automated vehicle identification system, and combinations of both data. These innovative methods are used to solve three origin–destination matrix estimation models. The first model is an extension of Spiess’s model which uses vehicle count data while the second model is an extension of Jamali’s model and it uses partial path data. The third model is a... 

    Robust and rapid converging adaptive beamforming via a subspace method for the signal-plusinterferences covariance matrix estimation

    , Article IET Signal Processing ; Vol. 8, Issue. 5 , July , 2014 , pp. 507-520 ; ISSN: 17519675 Rahmani, M ; Bastani, M. H ; Sharif University of Technology
    Abstract
    The presence of the desired signal (DS) in the training snapshots makes the adaptive beamformer sensitive to any steering vector mismatch and dramatically reduces the convergence rate. Even the performance of the most of the existing robust adaptive beamformers is degraded when the signal-to-noise ratio (SNR) is increased. In this study, a high converging rate robust adaptive beamformer is proposed. This method is a promoted eigenspace-based beamformer. In this paper, a new signal-plus-interferences (SPI) covariance matrix estimator is proposed. The subspace of the ideal SPI covariance matrices is exploited and the estimated covariance matrix is projected into this subspace. This projection... 

    Optimal input experiment design and parameter estimation in core-scale pressure oscillation experiments

    , Article Journal of Hydrology ; Volume 534 , 2016 , Pages 534-552 ; 00221694 (ISSN) Potters, M. G ; Mansoori, M ; Bombois, X ; Jansen, J. D ; Van den Hof, P. M. J ; Sharif University of Technology
    Elsevier 
    Abstract
    This paper considers Pressure Oscillation (PO) experiments for which we find the minimum experiment time that guarantees user-imposed parameter variance upper bounds and honours actuator limits. The parameters permeability and porosity are estimated with a classical least-squares estimation method for which an expression of the covariance matrix of the estimates is calculated. This expression is used to tackle the optimization problem. We study the Dynamic Darcy Cell experiment set-up (Heller et al., 2002) and focus on data generation using square wave actuator signals, which, as we shall prove, deliver shorter experiment times than sinusoidal ones. Parameter identification is achieved using... 

    Using empirical covariance matrix in enhancing prediction accuracy of linear models with missing information

    , Article 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017, 3 July 2017 through 7 July 2017 ; 2017 , Pages 446-450 ; 9781538615652 (ISBN) Moradipari, A ; Shahsavari, S ; Esmaeili, A ; Marvasti, F ; Sharif University of Technology
    Abstract
    Inference and Estimation in Missing Information (MI) scenarios are important topics in Statistical Learning Theory and Machine Learning (ML). In ML literature, attempts have been made to enhance prediction through precise feature selection methods. In sparse linear models, LASSO is well-known in extracting the desired support of the signal and resisting against noisy systems. When sparse models are also suffering from MI, the sparse recovery and inference of the missing models are taken into account simultaneously. In this paper, we will introduce an approach which enjoys sparse regression and covariance matrix estimation to improve matrix completion accuracy, and as a result enhancing... 

    A novel algorithm for fast and efficient multifocus wavefront shaping

    , Article Photons Plus Ultrasound: Imaging and Sensing 2018, 28 January 2018 through 1 February 2018 ; Volume 10494 , 2018 ; 16057422 (ISSN); 9781510614734 (ISBN) Fayyaz, Z ; Nasiriavanaki, M ; Sharif University of Technology
    SPIE  2018
    Abstract
    Wavefront shaping using spatial light modulator (SLM) is a popular method for focusing light through a turbid media, such as biological tissues. Usually, in iterative optimization methods, due to the very large number of pixels in SLM, larger pixels are formed, bins, and the phase value of the bins are changed to obtain an optimum phase map, hence a focus. In this study an efficient optimization algorithm is proposed to obtain an arbitrary map of focus utilizing all the SLM pixels or small bin sizes. The application of such methodology in dermatology, hair removal in particular, is explored and discussed. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only  

    On the cramer-rao bound for estimating the mixing matrix in noisy sparse component analysis

    , Article IEEE Signal Processing Letters ; Volume 15 , 2008 , Pages 609-612 ; 10709908 (ISSN) Zayyani, H ; Babaie Zadeh, M ; Haddadi, F ; Jutten, C ; Sharif University of Technology
    2008
    Abstract
    In this letter, we address the theoretical limitations in estimating the mixing matrix in noisy sparse component analysis (SCA) for the two-sensor case. We obtain the Cramer-Rao lower bound (CRLB) error estimation of the mixing matrix. Using the Bernouli-Gaussian (BG) sparse distribution, and some simple assumptions, an approximation of the Fisher information matrix (FIM) is calculated. Moreover, this CRLB is compared to some of the main methods of mixing matrix estimation in the literature. © 2008 IEEE  

    A practical O-D matrix estimation model based on fuzzy set theory for large cities

    , Article Proceedings - 23rd European Conference on Modelling and Simulation, ECMS 2009, 9 June 2009 through 12 June 2009, Madrid ; 2009 , Pages 77-83 ; 0 ; 9780955301889 (ISBN) Shafahi, Y ; Faturechi, R ; Sharif University of Technology
    Abstract
    Estimanon of the origin-destination trip danad matrix (O-D) plays a key role in travel analysis and transportation planning and operations. Many researchers have developed different O-D maths estimation mediods using traffic counts, which allow simple data collection as opposed to die costly traditional direct estimation methods based on home and roadside interviews. In mis papet, a new fuzzy O-D matrix estimation model (FODMEM) is proposed to estimate die O-D matrix from traffic count. A gradient-based aigoridnn. containing 3 fuzzy rule based approach to control die estimated O-D matrix changes, is proposed to solve FODMEM Since link data only represents a snapshot situation, resulting in...