Loading...
Search for:
babayi-zadeh--masoud
0.108 seconds
Total 737 records
Compressed Spectrum Sensing in Cognitive Radio Network
, M.Sc. Thesis Sharif University of Technology ; Nasiri-Kenari, Masoumeh (Supervisor) ; Babayi-Zadeh, Masoud (Co-Advisor)
Abstract
In recent years, the Cognitive Radio Network has received significant attentions due to its high potential for better employment of the spectrum. One of the most important parts of this technology is the spectrum sensing that requires being fast and accurate. The conventional algorithms proposed so far encounter some fundamental challenges at low SNR regimes and in wideband sensing. On the other hand, the compressed sensing algorithms, which take advantages of the sparsity of the signal of interest and utilize measurements instead of the samples, can reduce the sampling rate and thus decrease the complexity associated with the wideband sensing. In this thesis, by exploiting the...
Blind Speech Separation using Sparse Component Analysis
, M.Sc. Thesis Sharif University of Technology ; Babaei-Zadeh, Masoud (Supervisor)
Abstract
Separation of speech signals has many applications. For example, it is used human-machine communications. This problem can be divided into three categories: overdetermined, determined and underdetermined. If the number of mixtures is greater than the number of sources, the problem is called overdetermined; if it is equal to the number of sources, the problem is called determined and if it is less than the number of sources that problem is called underdetermined. This MS thesis studies the undertermined case. Moreover, speech signals are sparse in time-frequency domain, meaning that in each time-frequency point, usually only one source is active. So, for separatig the speech signals,the...
Distributed Compressed Sensing (DCS) and its Application in Wireless Sensor Network (WSN)
, M.Sc. Thesis Sharif University of Technology ; Babaei Zadeh, Masoud (Supervisor)
Abstract
Recent advances in Micro-Electro-Mechanical Systems (MEMS) technology, wireless communications,and digital electronics have enabled the development of low-cost, low-power,multifunctional sensor nodes that are small in size and communicate untethered in short distances.Wireless Sensor Network (WSN) including these sensors has been utilized in many applications, namely military and environmental applications. Due to unchangeable battery in most WSNs, Power consumption is an important challenge in such systems. A sensor node expends maximum energy in data communication. Control environmental parameter is among the most important applications of WSN. The actual physical environmental information...
Algorithms for Sparse Channel Estimation
, M.Sc. Thesis Sharif University of Technology ; Babaei Zadeh, Masoud (Supervisor)
Abstract
Recently, there has been much interest in sparse channel estimation, i.e. recovering a channel which has much less non zero tabs than its length. These channels have been observed in underwater and broadband wireless channels. In the last few years methods available to estimate these channels have used sparse structure information to improve the estimates. However, these methods are vulnerable to noise and interference. In other words, these methods do not use channel posterior information obtained from the received signal and this is detrimental to the estimator performance. In order to solve these problems in this thesis, motivated by CoSAMP algorithm which is a sparse signal processing...
Design And Implementation Of A Hand Gesture Recognition System
,
M.Sc. Thesis
Sharif University of Technology
;
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...
Matrix Completion, and Some of its Applications in Image Processing
,
M.Sc. Thesis
Sharif University of Technology
;
Babaei-Zadeh, Masoud
(Supervisor)
;
Ashtiani, Farid
(Supervisor)
Abstract
Consider a matrix that only few of its entries are known and we would like to exactly recover the matrix based on the revealed entries. More preciesly, a set of entities which had been selected uniformally are revealed. Is it possible to recover the whole of the matrix from few revealed entities? If the answer is yes, which algorithm could recover the matrix? It is clear that solving this problem is not generally possible because for any unknown entity we could map the matrix to infinity matrix which coinside the constrain of the revealed entities. But in most case of the applications, we involve with the matrix which are low-rank. Now, what about low-rank matrix? Recovery of the matrix from...
The maximum disjoint routing problem
, Article 22nd International Conference on Computing and Combinatorics, COCOON 2016, 2 August 2016 through 4 August 2016 ; Volume 9797 , 2016 , Pages 319-329 ; 03029743 (ISSN); 9783319426334 (ISBN) ; Sharif Zadeh, A. S ; Zarrabi Zadeh, H ; Sharif University of Technology
Springer Verlag
2016
Abstract
Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n2 log3 n log log n) time, improving over the current best O(n3)-time algorithm available for the problem
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) ; 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...
Direction and Range Assignment for Directional Antennae in Wireless Networks
, M.Sc. Thesis Sharif University of Technology ; Zarrabi-Zadeh, Hamid (Supervisor)
Abstract
In recent years, significant interest has been attracted towards using directional antennae in wireless and sensor networks due to it’s decreased energy consumption, increased security and decreased radio wave overlapping. Substituting omni-directional antennae with directional antennae should be performed in a way that not only guarantees connectivity, but also minimizes radius and latency in network nodes. The problem is not polynomially solvable in general and effort has been made in recent years to present approximation algorithms to solve this problem. The approximation algorithms have been made possible using unit disk
graphs, Euclidean minimum spanning trees, grouping of...
graphs, Euclidean minimum spanning trees, grouping of...
Experimental study on macro segregation behavior in short and wide range solidification of different aluminum alloys
, Article Materials Science and Technology Conference and Exhibition 2013, MS and T 2013 ; Volume 2 , 2013 , Pages 822-829 ; 9781629933092 (ISBN) ; Mohammad Salehi, E ; Hassan Nejad, H ; Shafiei Zadeh, S ; Sharif University of Technology
2013
Abstract
Data are presented on the solidification of aluminum alloys and their macro segregation behavior. Three alloys with different solidification ranges were prepared in two temperatures. Two types of molds were also prepared by sand and metallic materials. The solidification of Al alloys were studied and the effects of four parameters were determined, including cooling rate, casting temperature, degassing and nucleation effects on solidification and a comparison was conducted to Scheil model performance. Three types of aluminum alloys (Al-12.1%Si, Al-6.9%Si and Al-4.4% Cu) with short, medium and wide solidification ranges were studied and the results showed that degassing, nucleation, increasing...
On the rectangle escape problem
, Article Theoretical Computer Science ; Volume 689 , 2017 , Pages 126-136 ; 03043975 (ISSN) ; Assadi, S ; Emamjomeh Zadeh, E ; Yazdanbod, S ; Zarrabi Zadeh, H ; Sharif University of Technology
2017
Abstract
Motivated by the bus escape routing problem in printed circuit boards, we study the following rectangle escape problem: given a set S of n axis-aligned rectangles inside an axis-aligned rectangular region R, extend each rectangle in S toward one of the four borders of R so that the maximum density over the region R is minimized. The density of each point p∈R is defined as the number of extended rectangles containing p. We show that the problem is hard to approximate to within a factor better than 3/2 in general. When the optimal density is sufficiently large, we provide a randomized algorithm that achieves an approximation factor of 1+ε with high probability improving over the current best...
A higher index theorem for foliated manifolds with boundary
, Article Bulletin des Sciences Mathematiques ; Volume 136, Issue 2 , 2012 , Pages 201-238 ; 00074497 (ISSN) ; Sharif University of Technology
2012
Abstract
Following Gorokhovsky and Lott and using an extension of the b-pseudodifferential calculus of Melrose, we give a formula for the Chern character of the Dirac index class of a longitudinal Dirac type operators on a foliated manifold with boundary. For this purpose we use the Bismut local index formula in the context of noncommutative geometry. This paper uses heavily the methods and technical results developed by E. Leichtnam and P. Piazza
A note on some classical results of Gromov-Lawson
, Article Proceedings of the American Mathematical Society ; Volume 140, Issue 10 , 2012 , Pages 3663-3672 ; 00029939 (ISSN) ; Sharif University of Technology
2012
Abstract
In this paper we show how the higher index theory can be used to prove results concerning the non-existence of a complete Riemannian metric with uniformly positive scalar curvature at infinity. By improving some classical results due to M. Gromov and B. Lawson we show the efficiency of these methods to prove such non-existence theorems
Delocalized betti numbers and morse type inequalities
, Article Rocky Mountain Journal of Mathematics ; Volume 41, Issue 4 , August , 2011 , Pages 1361-1374 ; 00357596 (ISSN) ; Sharif University of Technology
2011
Abstract
In this paper we state and prove delocalized Morse type inequalities for Morse functions as well as for closed differential 1-forms. These inequalities involve delocalized Betti numbers. As an immediate consequence, we prove the vanishing of delocalized Betti numbers of manifolds fibering over the circle under a vanishing condition on the delocalizing conjugacy class
Parallel in-vitro and in-vivo techniques for optimizing cellular microenvironments by implementing biochemical, biomechanical and electromagnetic stimulations
, Article Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS ; 2012 , Pages 1397-1400 ; 1557170X (ISSN) ; 9781424441198 (ISBN) ; Heibatollahi, M ; Ghafar Zadeh, E
2012
Abstract
Development of novel engineering techniques that can promote new clinical treatments requires implementing multidisciplinary in-vitro and in-vivo approaches. In this study, we have implemented microfluidic devices and in-vivorat model to study the mechanism of neural stem cell migration and differentiation.These studies can result in the treatment of damages to the neuronal system. In this research, we have shown that by applying appropriate ranges of biochemical and biomechanical factors as well as by exposing the cells to electromagnetic fields, it is possible to improve viability, proliferation, directional migration and differentiation of neural stem cells. The results of this study can...
On vanishing of low-degree higher Â-genera
, Article Differential Geometry and its Application ; Volume 43 , 2015 , Pages 56-59 ; 09262245 (ISSN) ; Sharif University of Technology
2015
Abstract
In this short note we apply methods introduced by B. Hanke and T. Schick to prove the vanishing of (low degree) higher Â-genera for spin manifolds admitting a positive scalar curvature metric. Our aim is to provide a short proof for this beautiful result
The Minimum vulnerability problem
, Article Algorithmica ; Volume 70, Issue 4 , 2014 , pp 718-731 ; ISSN: 14320541 ; Emamjomeh-Zadeh, E ; Norouzi-Fard, A ; Yazdanbod, S ; Zarrabi-Zadeh, H ; Sharif University of Technology
2014
Abstract
We revisit the problem of finding (Formula presented.) paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the (Formula presented.) paths. We provide a (Formula presented.)-approximation algorithm for this problem, improving the best previous approximation factor of (Formula presented.). We also provide the first approximation algorithm for the problem with a sublinear approximation factor of (Formula presented.), where (Formula presented.) is the number of vertices in the input graph. For sparse graphs, such as bounded-degree and planar graphs, we show that the approximation factor of our algorithm can be...
The minimum vulnerability problem
, Article Algorithmica ; Volume 7676 LNCS , 2012 , Pages 382-391 ; 14320541(ISSN) ; 9783642352607 (ISBN) ; Emamjomeh Zadeh, E ; Norouzi Fard, A ; Yazdanbod, S ; Zarrabi Zadeh, H ; Sharif University of Technology
2012
Abstract
We revisit the problem of finding k paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the k paths. We provide a ⌊k/2⌋-approximation algorithm for this problem, improving the best previous approximation factor of k - 1. We also provide the first approximation algorithm for the problem with a sublinear approximation factor of O(n3/4), where n is the number of vertices in the input graph. For sparse graphs, such as bounded-degree and planar graphs, we show that the approximation factor of our algorithm can be improved to O(√n). While the problem is NP-hard, and even hard to approximate to within an O(log n)...
MR artifact reduction in the simultaneous acquisition of EEG and fMRI of epileptic patients
, Article 16th European Signal Processing Conference, EUSIPCO 2008, Lausanne, 25 August 2008 through 29 August 2008 ; 2008 ; 22195491 (ISSN) ; Sameni, R ; Jutten, C ; Hossein Zadeh, G. A ; Soltanian Zadeh, H ; Sharif University of Technology
2008
Abstract
Integrating high spatial resolution of functional magnetic resonance imaging (fMRI) and high temporal resolution of electroencephalogram (EEG) is promising in simultaneous EEG and fMRI analysis, especially for epileptic patients. The EEG recorded inside an MR scanner is interfered with MR artifacts. In this article, we propose new artifact reduction approaches and compare them with the conventional artifact reduction methods. Our proposed approaches are based on generalized eigenvalue decomposition (GEVD) and median filtering. The proposed methods are applied on experimental simultaneous EEG and fMRI recordings of an epileptic patient. The results show significant improvement over...
Long Term Effective Factors on House Price of Metropolises of Iran
, M.Sc. Thesis Sharif University of Technology ; Nili, Masoud (Supervisor)
Abstract
The notable share of housing sector in GDP (approximately five percent) shows this sector’s relation with macroeconomic activities. On the other hand, House as an asset leads housing sector to be affected by monetary and fiscal variables. A dynamic panel data was used in this study to evaluate the relations between housing sector and some macroeconomic variables in metropolises of Iran. As results show, in long term growth of liquidity, GDP per capita and sharp ratio have positive effects, and land per capita has negative effect on housing price in metropolises of Iran. Price increases have not been equal in different cities. Inequality of land price between metropolises and between...