Loading...
Search for: soleymani--t
0.101 seconds

    Sliding mode leader following control for autonomous air robots

    , Article 2011 IEEE/SICE International Symposium on System Integration, SII 2011, 20 December 2011 through 22 December 2011 ; December , 2011 , Pages 972-977 ; 9781457715235 (ISBN) Soleymani, T ; Saghafi, F ; Sharif University of Technology
    2011
    Abstract
    In this paper, we propose a leader following control for autonomous air robots. The separated design strategy with kinematic acceleration commands is used. The location of the robot with respect to the leader is specified by a range and two angles. We obtain the kinematic model of the system represented by the state-space equations. The controller is designed based on the sliding mode control which asymptotically stabilizes the tracking errors in presence of uncertainties and disturbances. In order to implement the leader following controller in the air robots, a control system is introduced which converts the acceleration commands to the actuator commands. Simulations are provided to show... 

    Behavior-based acceleration commanded formation flight control

    , Article ICCAS 2010 - International Conference on Control, Automation and Systems 2010, Article number 5670304, Pages 1340-1345 ; 2010 , Pages 1340-1345 ; 9781424474530 (ISBN) Soleymani, T ; Saghafi, F ; Sharif University of Technology
    2010
    Abstract
    In this paper, the design of a formation flight controller is investigated. Each vehicle in the formation is controlled by designing two separate control loops. The formation flight controller placed in the outer loop employs behavior-based control as a distributed control strategy to steer the vehicle by producing acceleration commands and the control system placed in the inner loop is to convert these commands to the actuator commands. Leader following architecture is applied to define the structure for the formation flight. To study the pragmatic issues of the proposed formation flight controller, it is implemented into multiple micro air vehicles which are modeled by a... 

    Fuzzy trajectory tracking control of an autonomous air vehicle

    , Article ICMEE 2010 - 2010 2nd International Conference on Mechanical and Electronics Engineering, Proceedings, 1 August 2010 through 3 August 2010 ; Volume 2 , August , 2010 , Pages V2347-V2352 ; 9781424474806 (ISBN) Soleymani, T ; Saghafi, F ; Sharif University of Technology
    2010
    Abstract
    The development and the implementation of a new guidance law are addressed for a six dimensional trajectory tracking problem, three dimensions for position tracking and three dimensions for velocity tracking, of a micro air vehicle. To generate the desired trajectory a virtual leader is defined which is moved in space. In the guidance law, position and velocity feedbacks are used by fuzzy controllers to generate two acceleration commands. Then, a fuzzy coordinator is applied to coordinate the acceleration commands. Nonlinear six-degree-of-freedom equations of motion are used to model the vehicle dynamics. Also, a bank-to-turn acceleration autopilot for vehicle is considered to follow the... 

    Unsupervised learning for distribution grid line outage and electricity theft identification

    , Article 2019 Smart Gird Conference, SGC 2019, 18 December 2019 through 19 December 2019 ; 2019 ; 9781728158945 (ISBN) Soleymani, M ; Safdarian, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    The development of smart meters enables situational awareness in electric power distribution systems. The situational awareness provides significant advantages such as line outage and electricity theft detection. This paper aims at using smart meter data to detect these anomalies. To do so, an appropriate cluster-based method as an unsupervised machine learning approach is applied. A stochastic method based on conditional correlation is also proposed to localize the anomalies. It is shown that this can be done by detecting changes in bus connections using present and historical smart meter data. Therefore, network topology inspection can be avoided if the proposed method is applied. A... 

    Development of a Distributed Algorithm for Flocking of Non-Holonomic Aerial Agents

    , M.Sc. Thesis Sharif University of Technology Soleymani, Touraj (Author) ; Saghafi, Fariborz (Supervisor)
    Abstract
    The goal of this project is the development of a control algorithm for a flock of non-holonomic aerial agents. For this purpose,the swarm architecture having some unique features such as robustness, flexibility, and scalability is utilized. Swarm is defined as a group of simple agents having local interactions between themselves and the environmentwhich shows an unpredictable emergent behavior.Behavior based control which is inspired from the animal behaviors is employed to control the swarm of mobile agents. Accordingly, the necessary behaviors which are distance adjustment, velocity agreement, and virtual leader tracking together with a fuzzy coordinator are designed. In this study, in... 

    Deep Zero-shot Learning

    , M.Sc. Thesis Sharif University of Technology Shojaee, Mohsen (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    In some of object recognition problems, labeled data may not be available for all categories. Zero-shot learning utilizes auxiliary information (also called signatures) describing each category in order to find a classifier that can recognize samples from categories with no labeled instance. On the other hand, with recent advances made by deep neural networks in computer vision, a rich representation can be obtained from images that discriminates different categorizes and therefore obtaining a unsupervised information from images is made possible. However, in the previous works, little attention has been paid to using such unsupervised information for the task of zero-shot learning. In this... 

    Multi-Modal Distance Metric Learning

    , M.Sc. Thesis Sharif University of Technology Roostaiyan, Mahdi (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    In many real-world applications, data contain multiple input channels (e.g., web pages include text, images and etc). In these cases, supervisory information may also be available in the form of distance constraints such as similar and dissimilar pairs from user feedbacks. Distance metric learning in these environments can be used for different goals such as retrieval and recommendation. In this research, we used from dual-wing harmoniums to combining text and image modals to a unified latent space when similar-dissimilar pairs are available. Euclidean distance of data represented in this latent space used as a distance metric. In this thesis, we extend the dual-wing harmoniums for... 

    Unsupervised Domain Adaptation via Representation Learning

    , M.Sc. Thesis Sharif University of Technology Gheisary, Marzieh (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    The existing learning methods usually assume that training and test data follow the same distribution, while this is not always true. Thus, in many cases the performance of these learning methods on the test data will be severely degraded. We often have sufficient labeled training data from a source domain but wish to learn a classifier which performs well on a target domain with a different distribution and no labeled training data. In this thesis, we study the problem of unsupervised domain adaptation, where no labeled data in the target domain is available. We propose a framework which finds a new representation for both the source and the target domain in which the distance between these... 

    Deep Learning for Multimodal Data

    , M.Sc. Thesis Sharif University of Technology Rastegar, Sarah (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    Recent advances in data recording has lead to different modalities like text, image, audio and video. Images are annotated and audio accompanies video. Because of distinct modality statistical properties, shallow methods have been unsuccessful in finding a shared representation which maintains the most information about different modalities. Recently, deep networks have been used for extracting high-level representations for multimodal data. In previous methods, for each modality, one modality-specific network was learned. Thus, high-level representations for different modalities were extracted. Since these high-level representations have less difference than raw modalities, a shared... 

    Data Mining of Smart Metering Data for Abnormality Detection in Electric Energy Consumption

    , M.Sc. Thesis Sharif University of Technology Soleymani, Mohammad (Author) ; Safdarian, Amir (Supervisor)
    Abstract
    The development of smart meters enables gathering and analysis of a large amount of data about electrical energy consumption in electric power distribution systems. This data and the obtained behavioral patterns of customers have a wide variety of applications. To name a few, classification of customers based on their consumption patterns, damaged smart meter identification, non-technical loss identification and measuring participation rate of customers in demand response programs are among the applications. So far, many studies have been done for consumption pattern identification. However, abnormality detection in electric energy consumption has captured growing attention due to the... 

    Adversarial Networks for Sequence Generation

    , M.Sc. Thesis Sharif University of Technology Montahaei, Ehsan (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    Lots of essential structures can be modeled as sequences and sequences can be utilized to model the structures like molecules, graphs and music notes. On the other hand, generating meaningful and new sequences is an important and practical problem in different applications. Natural language translation and drug discovery are examples of sequence generation problem. However, there are substantial challenges in sequence generation problem. Discrete spaces of the sequence and challenge of the proper objective function can be pointed out.On the other, the baseline methods suffer from issues like exposure bias between training and test time, and the ill-defined objective function. So, the... 

    An FPCA-based color morphological filter for noise removal

    , Article Scientia Iranica ; Volume 16, Issue 1 D , 2009 , Pages 8-18 ; 10263098 (ISSN) Soleymani Baghshah, M ; Kasaei, S ; Sharif University of Technology
    2009
    Abstract
    Morphological filtering is a useful technique for the processing and analysis of binary and gray scale images. The extension of morphological techniques to color images is not a straightforward task because this extension stems from the multivariate ordering problem. Since multivariate ordering is ambiguous, existing approaches have used known vector ordering schemes for the color ordering purpose. In the. last decade, many different color morphological operators have been introduced in the literature. Some of them have focused on noise suppression purposes. However, none has shown good performance, especially on edgy regions. In this paper, new color morphological operators, based on a... 

    Low-rank kernel learning for semi-supervised clustering

    , Article Proceedings of the 9th IEEE International Conference on Cognitive Informatics, ICCI 2010, 7 July 2010 through 9 July 2010, Beijing ; 2010 , Pages 567-572 ; 9781424480401 (ISBN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2010
    Abstract
    In the last decade, there has been a growing interest in distance function learning for semi-supervised clustering settings. In addition to the earlier methods that learn Mahalanobis metrics (or equivalently, linear transformations), some nonlinear metric learning methods have also been recently introduced. However, these methods either allow limited choice of distance metrics yielding limited flexibility or learn nonparametric kernel matrices and scale very poorly (prohibiting applicability to medium and large data sets). In this paper, we propose a novel method that learns low-rank kernel matrices from pairwise constraints and unlabeled data. We formulate the proposed method as a trace... 

    Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN

    , Article 2016 IEEE International Conference on Communications, ICC 2016, 22 May 2016 through 27 May 2016 ; 2016 ; 9781479966646 (ISBN) Soleymani, M ; Maham, B ; Ashtiani, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    Frame aggregation (FA) mechanisms improve the throughput of WLANs. In this paper, the effect of the FA mechanism on the throughput of wireless local area networks (WLANs) has been investigated. To this end, we propose an analytical model in order to analyze an IEEE 802.11n network comprised of an access point (AP) and several conventional nodes (CNs), all in the coverage area of each other. With respect to the heavier download traffic compared to the upload one, in our scenario, only the AP uses an FA mechanism and the other nodes use the basic IEEE 802.11 standard. In our proposed analytical model, the maximum downlink (DL) throughput is derived. Regarding the asymmetry among nodes, our... 

    Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data

    , Article Pattern Recognition ; Volume 43, Issue 8 , August , 2010 , Pages 2982-2992 ; 00313203 (ISSN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2010
    Abstract
    The problem of clustering with side information has received much recent attention and metric learning has been considered as a powerful approach to this problem. Until now, various metric learning methods have been proposed for semi-supervised clustering. Although some of the existing methods can use both positive (must-link) and negative (cannot-link) constraints, they are usually limited to learning a linear transformation (i.e., finding a global Mahalanobis metric). In this paper, we propose a framework for learning linear and non-linear transformations efficiently. We use both positive and negative constraints and also the intrinsic topological structure of data. We formulate our metric... 

    Efficient kernel learning from constraints and unlabeled data

    , Article Proceedings - International Conference on Pattern Recognition, 23 August 2010 through 26 August 2010, Istanbul ; 2010 , Pages 3364-3367 ; 10514651 (ISSN) ; 9780769541099 (ISBN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2010
    Abstract
    Recently, distance metric learning has been received an increasing attention and found as a powerful approach for semi-supervised learning tasks. In the last few years, several methods have been proposed for metric learning when must-link and/or cannot-link constraints as supervisory information are available. Although many of these methods learn global Mahalanobis metrics, some recently introduced methods have tried to learn more flexible distance metrics using a kernel-based approach. In this paper, we consider the problem of kernel learning from both pairwise constraints and unlabeled data. We propose a method that adapts a flexible distance metric via learning a nonparametric kernel... 

    Kernel-based metric learning for semi-supervised clustering

    , Article Neurocomputing ; Volume 73, Issue 7-9 , 2010 , Pages 1352-1361 ; 09252312 (ISSN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2010
    Abstract
    Distance metric plays an important role in many machine learning algorithms. Recently, there has been growing interest in distance metric learning for semi-supervised setting. In the last few years, many methods have been proposed for metric learning when pairwise similarity (must-link) and/or dissimilarity (cannot-link) constraints are available along with unlabeled data. Most of these methods learn a global Mahalanobis metric (or equivalently, a linear transformation). Although some recently introduced methods have devised nonlinear extensions of linear metric learning methods, they usually allow only limited forms of distance metrics and also can use only similarity constraints. In this... 

    Semi-supervised metric learning using pairwise constraints

    , Article 21st International Joint Conference on Artificial Intelligence, IJCAI-09, Pasadena, CA, 11 July 2009 through 17 July 2009 ; 2009 , Pages 1217-1222 ; 10450823 (ISSN) ; 9781577354260 (ISBN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2009
    Abstract
    Distance metric has an important role in many machine learning algorithms. Recently, metric learning for semi-supervised algorithms has received much attention. For semi-supervised clustering, usually a set of pairwise similarity and dissimilarity constraints is provided as supervisory information. Until now, various metric learning methods utilizing pairwise constraints have been proposed. The existing methods that can consider both positive (must-link) and negative (cannot-link) constraints find linear transformations or equivalently global Mahalanobis metrics. Additionally, they find metrics only according to the data points appearing in constraints (without considering other data... 

    Metric learning for semi-supervised clustering using pairwise constraints and the geometrical structure of data

    , Article Intelligent Data Analysis ; Volume 13, Issue 6 , 2009 , Pages 887-899 ; 1088467X (ISSN) Baghshah Soleymani, B ; Bagheri Shouraki, S ; Sharif University of Technology
    2009
    Abstract
    Metric learning is a powerful approach for semi-supervised clustering. In this paper, a metric learning method considering both pairwise constraints and the geometrical structure of data is introduced for semi-supervised clustering. At first, a smooth metric is found (based on an optimization problem) using positive constraints as supervisory information. Then, an extension of this method employing both positive and negative constraints is introduced. As opposed to the existing methods, the extended method has the capability of considering both positive and negative constraints while considering the topological structure of data. The proposed metric learning method can improve performance of... 

    Finding arbitrary shaped clusters and color image segmentation

    , Article 1st International Congress on Image and Signal Processing, CISP 2008, Sanya, Hainan, 27 May 2008 through 30 May 2008 ; Volume 1 , 2008 , Pages 593-597 ; 9780769531199 (ISBN) Soleymani Baghshah, M ; Bagheri Shouraki, S ; Sharif University of Technology
    2008
    Abstract
    One of the most famous approaches for the segmentation of color images is finding clusters in the color space. Shapes of these clusters are often complex and the time complexity of the existing algorithms for finding clusters of different shapes is usually high. In this paper, a novel clustering algorithm is proposed and used for the image segmentation purpose. This algorithm distinguishes clusters of different shapes using a two-stage clustering approach in a reasonable time. In the first stage, the mean-shift clustering algorithm is used and the data points are grouped into some sub-clusters. In the second stage, connections between sub-clusters are established according to a dissimilarity...