Loading...
Search for: babaie-zadeh--masoud
0.14 seconds

    Design And Implementation Of A Hand Gesture Recognition System

    , M.Sc. Thesis Sharif University of Technology Tavakol Elahy, Maryam (Author) ; Babaie Zadeh, Masoud (Supervisor)
    Abstract
    This thesis discusses a real-time vision-based framework for the purpose of hand region detection and hand gesture recognition. Our proposed methods include detecting hand regions in the cluttered background, based on Viola-Jones object detection algorithm and improving the classification of detected hand gestures regions in a novel contour-based framework. Our studies have demonstrated that deformability and high degree of freedom (DoF) of human hand as a non-rigid object besides diversity of skin color types, undeniable effect of cluttered background complexity, scalability and being robustness against rotation are the main reasons for considering some simplifications in visionbased... 

    Erratum: On the stable recovery of the sparsest overcomplete representations in presence of noise (IEEE Transactions on Signal Processing (2010) 5:10 (5396-5400))

    , Article IEEE Transactions on Signal Processing ; Volume 59, Issue 4 , April , 2011 , Pages 1913- ; 1053587X (ISSN) Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    2011

    Semi-blind approaches for source separation and independent component analysis

    , Article 14th European Symposium on Artificial Neural Networks, ESANN 2006, 26 April 2006 through 28 April 2006 ; 2006 , Pages 301-312 ; 2930307064 (ISBN); 9782930307060 (ISBN) Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    d-side publication  2006
    Abstract
    This paper is a survey of semi-blind source separation approaches. Since Gaussian iid signals are not separable, simplest priors suggest to assume non Gaussian iid signals, or Gaussian non iid signals. Other priors can also been used, for instance discrete or bounded sources, positivity, etc. Although providing a generic framework for semi-blind source separation, Sparse Component Analysis and Bayesian ICA will just sketched in this paper, since two other survey papers develop in depth these approaches. © 2006 i6doc.com publication. All rights reserved  

    A general approach for mutual information minimization and its application to blind source separation

    , Article Signal Processing ; Volume 85, Issue 5 SPEC. ISS , 2005 , Pages 975-995 ; 01651684 (ISSN) Babaie Zadeh, M ; Jutten, C ; Sharif University of Technology
    Elsevier  2005
    Abstract
    In this paper, a nonparametric "gradient" of the mutual information is first introduced. It is used for showing that mutual information has no local minima. Using the introduced "gradient", two general gradient based approaches for minimizing mutual information in a parametric model are then presented. These approaches are quite general, and principally they can be used in any mutual information minimization problem. In blind source separation, these approaches provide powerful tools for separating any complicated (yet separable) mixing model. In this paper, they are used to develop algorithms for separating four separable mixing models: linear instantaneous, linear convolutive, post... 

    Learning overcomplete dictionaries from markovian data

    , Article 10th IEEE Sensor Array and Multichannel Signal Processing Workshop, SAM 2018, 8 July 2018 through 11 July 2018 ; Volume 2018-July , 2018 , Pages 218-222 ; 2151870X (ISSN); 9781538647523 (ISBN) Akhavan, S ; Esmaeili, S ; Babaie Zadeh, M ; Soltanian Zadeh, H ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    We explore the dictionary learning problem for sparse representation when the signals are dependent. In this paper, a first-order Markovian model is considered for dependency of the signals, that has many applications especially in medical signals. It is shown that the considered dependency among the signals can degrade the performance of the existing dictionary learning algorithms. Hence, we propose a method using the Maximum Log-likelihood Estimator (MLE) and the Expectation Minimization (EM) algorithm to learn the dictionary from the signals generated under the first-order Markovian model. Simulation results show the efficiency of the proposed method in comparison with the... 

    Sparse Representation and its Application in Image Denoising

    , M.Sc. Thesis Sharif University of Technology Sadeghi, Mostafa (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    Sparse signal processing (SSP), as a powerful tool and an efficient alternative to traditional complete transforms, has become a focus of attention during the last decade. In this ap-proach, we want to approximate a given signal as a linear combination of as few as possible basis signals. Each basis signal is called an atom and their collection is called a dictionary. This problem is generally difficult and belongs to the NP-hard problems; since it requires a combinatorial search. In recent years however, it has been shown both theoretically and experimentally that the sparset possible representation of a signal in an overcomplete dictio-nary is unique under some conditions and can be found in... 

    Applications of Sparse Representation in Image Processing

    , M.Sc. Thesis Sharif University of Technology Nayyer, Sara (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    The sparse decomposition problem or nding sparse solutions of underdetermined linear systems of equations is one of the fundamental issues in signal processing and statistics. In recent years, this issue has been of great interest to researches in various elds of signal processing and accordingly found to be greatly benecial in those elds. This thesis aims at the investigation of the applications of the sparse decomposition problem in image processing. Among dierent applications such as compression, reconstruction, separation and image denoising, this thesis mainly focuses on the last one. One of the methods of image denoising which is closely tied to the sparse decomposition, is the method... 

    Sparse Channel Estimation and Its Application in Channel Equalization

    , M.Sc. Thesis Sharif University of Technology Niazadeh, Rad (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    Recently, sparse channel estimation, i.e. recovering a channel which has much less non zerotaps than its length using a known training sequence, has been a major area of research in the field of sparse signal processing. It can be shown that on the one hand, the underlying unique structure of such channels will make the possibility of estimating the channel taps with the extreme performance, i.e. achieving the Cram´er-Rao bound of the estimation. On the other hand, with an appropriate use of this structure, computational complexity of the receiver (both channel estimator and equalizer) can be reduced by an order. For achieving these goals in this thesis, firstly we have proposed an... 

    Pupil Detection and Eye Tracking

    , M.Sc. Thesis Sharif University of Technology Sobhani, Elahe (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    About a century, “Eye Tracking” has been studied, and it has two definitions: • The process of measuring the point of gaze (where one is looking). • The process of measuring the motion of an eye relative to the head. Eye tracking technology has been used in many fields such as psychology. However, applications of this technology has been recently considered in marketing, computer interfacing, entertainment, training and so forth. Since pupil is a distinc area in eye images, pupil detection is one of the effective solutions of eye tracking. In most of the pupil detection approaches, the edge points of the pupil contour are detected firstly, and then the optimal ellipse is fitted to them.... 

    Sparse Representation Based Image Inpainting

    , M.Sc. Thesis Sharif University of Technology Mehrpooya, Ali (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    Sparse signal processing (SSP), as a powerful tool and an efficient alternative to traditional complete transforms, has become a focus of attention during the last decade. In this approach, we want to approximate a given signal as a linear combination of as few as possible basis signals. Each basis signal is called an atom and their collection is called a dictionary. This problem is in general difficult and belongs to the Np-hard problems; since it requires a combinatorial search. In recent years however, it has been shown both theoretically and experimentally that the sparset possible representation of a signal in an overcomplete dictionary is unique under some conditions and can be found... 

    Sparse Decomposition of two Dimensional Signals and Its Application to Image Enhancement

    , M.Sc. Thesis Sharif University of Technology Ghaffari, Aboozar (Author) ; Babaie Zadeh, Massoud (Supervisor)

    Sparse Recovery and Dictionary Learning based on Proximal Methods in Optimization

    , Ph.D. Dissertation Sharif University of Technology Sadeghi, Mostafa (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    Sparse representation has attracted much attention over the past decade. The main idea is that natural signals have information contents much lower than their ambient dimensions,and as such, they can be represented by using only a few basis signals (also called atoms). In other words, a natural signal of length n, which in general needs n atoms to be represented, can be written as a linear combination of s atoms, where s ≪ n. To achieve a sparser representation, i.e., a smaller s, the number of atoms is chosen much larger than n. In this way, there are more choices to represent a signal and we can choose the sparsest possible combination. The set of atoms is called a dictionary. Here, two... 

    Multimodal Blind Source Separation

    , Ph.D. Dissertation Sharif University of Technology Sedighin, Farnaz (Author) ; Babaie-Zadeh, Massoud (Supervisor)
    Abstract
    Blind Source Separation (BSS) is a challenging task in signal processing which aims to separate sources from their mixtures when no information is available about the sources or the mixing system. Different approaches have already been proposed for source separation.However, during the last decade, new approaches based on multimodal nature of phenomena have been proposed for source separation. Different aspects of a multimodal phenomenon can be measured by means of different instruments where each of the measured signals is called a modality of that phenomenon. Although the modalities are different signals with different features, due to the same physical origin, they usually have some... 

    Over-complete Dictionary Learning for Sparse Representation

    , M.Sc. Thesis Sharif University of Technology Parsa, Javad (Author) ; Babaie-Zadeh, Massoud (Supervisor)
    Abstract
    Sparse representation has been an important problem in recent decade. The main idea in this problem is that natural signals have information contents much lower than their ambient dimensions and as such, they can be represented by using only a few atoms. For example, if the dimension of signal is n, the purpose in sparse representation is to achieve the representation of signal in terms of s atom (s ≪ n). In sparse coding, the dictionary depends on the used signal. In some of the problem, dictionary is specified and sparse representation is obtained by this dictionary. In this case, because the dictionary is known, maybe sparse representation is not suitable for this signal. For this reason,... 

    SR-NBS: A fast sparse representation based N-best class selector for robust phoneme classification

    , Article Engineering Applications of Artificial Intelligence ; Vol. 28 , 2014 , pp. 155-164 Saeb, A ; Razzazi, F ; Babaie-Zadeh, M ; Sharif University of Technology
    2014
    Abstract
    Although exemplar based approaches have shown good accuracy in classification problems, some limitations are observed in the accuracy of exemplar based automatic speech recognition (ASR) applications. The main limitation of these algorithms is their high computational complexity which makes them difficult to extend to ASR applications. In this paper, an N-best class selector is introduced based on sparse representation (SR) and a tree search strategy. In this approach, the classification is fulfilled in three steps. At first, the set of similar training samples for the specific test sample is selected by k-dimensional (KD) tree search algorithm. Then, an SR based N-best class selector is... 

    Watermarking based on independent component analysis in spatial domain

    , Article Proceedings - 2011 UKSim 13th International Conference on Modelling and Simulation, UKSim 2011, 30 March 2011 through 1 April 2011, Cambridge ; 2011 , Pages 299-303 ; 9780769543765 (ISBN) Hajisami, A ; Rahmati, A ; Babaie Zadeh, M ; Sharif University of Technology
    2011
    Abstract
    This paper proposes an image watermarking scheme for copyright protection based on Independent Component Analysis (ICA). In the suggested scheme, embedding is carried out in cumulative form in spatial domain and ICA is used for watermark extraction. For extraction there is no need to access the original image or the watermark, and extraction is carried out only with two watermarked images. Experimental results show that the new method has better quality than famous methods [1], [2], [3] in spatial or frequency domain and is robust against various attacks. Noise addition, resizing, low pass filtering, multiple marks, gray-scale reduction, rotation, JPEG compression, and cropping are some... 

    On the error of estimating the sparsest solution of underdetermined linear systems

    , Article IEEE Transactions on Information Theory ; Volume 57, Issue 12 , December , 2011 , Pages 7840-7855 ; 00189448 (ISSN) Babaie Zadeh, M ; Jutten, C ; Mohimani, H ; Sharif University of Technology
    2011
    Abstract
    Let A be an n × m matrix with m > n, and suppose that the underdetermined linear system As = x admits a sparse solution ∥s 0∥o < 1/2spark(A). Such a sparse solution is unique due to a well-known uniqueness theorem. Suppose now that we have somehow a solution ŝ as an estimation of s0, and suppose that ŝ is only "approximately sparse", that is, many of its components are very small and nearly zero, but not mathematically equal to zero. Is such a solution necessarily close to the true sparsest solution? More generally, is it possible to construct an upper bound on the estimation error ∥ŝ - s 0∥2 without knowing s0? The answer is positive, and in this paper, we construct such a bound based on... 

    Image restoration using gaussian mixture models with spatially constrained patch clustering

    , Article IEEE Transactions on Image Processing ; Volume 24, Issue 11 , June , 2015 , Pages 3624-3636 ; 10577149 (ISSN) Niknejad, M ; Rabbani, H ; Babaie Zadeh, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    In this paper, we address the problem of recovering degraded images using multivariate Gaussian mixture model (GMM) as a prior. The GMM framework in our method for image restoration is based on the assumption that the accumulation of similar patches in a neighborhood are derived from a multivariate Gaussian probability distribution with a specific covariance and mean. Previous methods of image restoration with GMM have not considered spatial (geometric) distance between patches in clustering. Our conducted experiments show that in the case of constraining Gaussian estimates into a finite-sized windows, the patch clusters are more likely to be derived from the estimated multivariate Gaussian... 

    A geometric approach for separating post non-linear mixtures

    , Article European Signal Processing Conference, 3 September 2002 through 6 September 2002 ; Volume 2015-March , September , 2015 ; 22195491 (ISSN) Babaie Zadeh, M ; Jutten, C ; Nayebi, K ; Sharif University of Technology
    European Signal Processing Conference, EUSIPCO  2015
    Abstract
    A geometric method for separating PNL mixtures, for the case of 2 sources and 2 sensors, has been presented. The main idea is to find compensating nonlinearities to transform the scatter plot of observations to a parallelogram. It then results in a linear mixture which can be separated by any linear source separation algorithm. An indirect result of the paper is another separability proof of PNL mixtures of bounded sources for 2 sources and 2 sensors  

    Invariancy of sparse recovery algorithms

    , Article IEEE Transactions on Information Theory ; Volume 63, Issue 6 , 2017 , Pages 3333-3347 ; 00189448 (ISSN) Kharratzadeh, M ; Sharifnassab, A ; Babaie Zadeh, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    In this paper, a property for sparse recovery algorithms, called invariancy, is introduced. The significance of invariancy is that the performance of the algorithms with this property is less affected when the sensing (i.e., the dictionary) is ill-conditioned. This is because for this kind of algorithms, there exists implicitly an equivalent well-conditioned problem, which is being solved. Some examples of sparse recovery algorithms will also be considered and it will be shown that some of them, such as SL0, Basis Pursuit (using interior point LP solver), FOCUSS, and hard thresholding algorithms, are invariant, and some others, like Matching Pursuit and SPGL1, are not. Then, as an...