Combined Wavelet-neural Clasifier For Power Distribution Systems

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2002Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2002Bu çalışmada, dağıtım sistemlerinde hibrid “Dalgacık-Yapay Sinir ağı (YSA) tabanlı” bir yaklaşımla arıza sınıflama işlemi gerçeklenmiştir. 34.5 kV “Sağmalcılar-Maltepe” dağıtım sistemi PSCAD/EMTDC yazılımı kullanılarak arıza sınıflayıcı için gereken veri üretilmiştir. Tezin amacı, on farklı kısa-devre sistem arızalarını tanımlayabilecek bir sınıflayıcı tasarlamaktır. Sistemde kullanılan arıza işaretleri 5 kHZ lik örnekleme frekansı ile üretilmiştir. Farklı arıza noktaları ve farklı arıza oluşum açılarındaki hat-akımları ve hat-toprak gerilimlerini içeren sistem arızaları ile bir veritabanı oluşturulmuştur. “Çoklu-çözünürlük işaret ayrıştırma” tekniği kullanılarak altı-kanal akım ve gerilim örneklerinden karakteristik bigi çıkarılmıştır. PSCAD/EMTDC ile üretilen veri bu şekilde bir ön islemden geçirildikten sonra YSA-tabanlı bir yapı ile sınıflama islemi gerçekleştirilmiştir. Bu yapının görevi çeşitli sistem ve arıza koşullarını kapsayan karmaşık arıza sınıflama problemini çözebilmektir. Bu çalışmada, Kohonen’in öğrenme algoritmasını kullanan bir “Kendine-Organize harita” ile “eğitilebilen vektör kuantalama” teknikleri kullanılmıştır. Bu “dalgacık-sinir ağı” tabanlı arıza sınıflayıcı ile eğitim kümesi için % 99-100 arasında ve sınıflayıcıya daha önce hiç verilmemiş test kümesi ile de %85-92 arasında sınıflama oranları elde edilmiştir. Elde edilen başarım oranları literatürdeki sonuçlara yakındır. Geliştirilen birleşik “dalgacık-sinir ağı” tabanlı sınıflayıcı elektrik dağıtım sistemlerindeki arızaların belirlenmesinde iyi sonuçlar vermiş ve iyi bir performans sağlamıştır.In this study an integrated design of fault classifier in a distribution system by using a hybrid “Wavelet- Artificial neural network (ANN) based” approach is implemented. Data for the fault classifier is produced by using PSCAD/EMTDC simulation program on 34.5 kV “Sagmalcılar-Maltepe” distribution system in Istanbul. The objective is to design a classifier capable of recognizing ten classes of three-phase system faults. The signals are generated at an equivalent sampling rate of 5 KHz per channel. A database of line currents and line-to-ground voltages is built up including system faults at different fault inception angles and fault locations. The characteristic information over six-channel of current and voltage samples is extracted by the “wavelet multi-resolution analysis” technique, which is a preprocessing unit to obtain a small size of interpretable features from the raw data. After preprocessing the raw data, an ANN-based tool was employed for classification task. The main idea in this approach is solving the complex fault (three-phase short-circuit) classification problem under various system and fault conditions. In this project, a self-organizing map, with Kohonen’s learning algorithm and type-one learning vector quantization technique is implemented into the fault classification study. The performance of the wavelet-neural fault classification scheme is found to be around “99-100%” for the training data and around “85-92%” for the test data, which the classifier has not been trained on. This result is comparable to the studied fault classifiers in the literature. Combined wavelet-neural classifier showed a promising future to identify the faults in electric distribution systemsYüksek LisansM.Sc

Development of Some Efficient Lossless and Lossy Hybrid Image Compression Schemes

Digital imaging generates a large amount of data which needs to be compressed, without loss of relevant information, to economize storage space and allow speedy data transfer. Though both storage and transmission medium capacities have been continuously increasing over the last two decades, they dont match the present requirement. Many lossless and lossy image compression schemes exist for compression of images in space domain and transform domain. Employing more than one traditional image compression algorithms results in hybrid image compression techniques. Based on the existing schemes, novel hybrid image compression schemes are developed in this doctoral research work, to compress the images effectually maintaining the quality

An unsupervised learning algorithm: application to the discrimination of seismic events and quarry blasts in the vicinity of Istanbul

The results of the application of an unsupervised learning (neural network) approach comprising a Self Organizing Map (SOM), to distinguish micro-earthquakes from quarry blasts in the vicinity of Istanbul, Turkey, are presented and discussed. The SOM is constructed as a neural classifier and complementary reliability estimator to distinguish seismic events, and was employed for varying map sizes. Input parameters consisting of frequency and time domain data (complexity, spectral ratio, S/P wave amplitude peak ratio and origin time of events) extracted from the vertical components of digital seismograms were estimated as discriminants for 179 (1.8 < <i>M</i><sub>d</sub> < 3.0) local events. The results show that complexity and amplitude peak ratio parameters of the observed velocity seismogram may suffice for a reliable discrimination, while origin time and spectral ratio were found to be fuzzy and misleading classifiers for this problem. The SOM discussed here achieved a discrimination reliability that could be employed routinely in observatory practice; however, about 6% of all events were classified as ambiguous cases. This approach was developed independently for this particular classification, but it could be applied to different earthquake regions

A survey of kernel and spectral methods for clustering

Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved

Proceedings of the Third International Workshop on Neural Networks and Fuzzy Logic, volume 2

Papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by the National Aeronautics and Space Administration and cosponsored by the University of Houston, Clear Lake, held 1-3 Jun. 1992 at the Lyndon B. Johnson Space Center in Houston, Texas are included. During the three days approximately 50 papers were presented. Technical topics addressed included adaptive systems; learning algorithms; network architectures; vision; robotics; neurobiological connections; speech recognition and synthesis; fuzzy set theory and application, control and dynamics processing; space applications; fuzzy logic and neural network computers; approximate reasoning; and multiobject decision making

Two and three dimensional segmentation of multimodal imagery

The role of segmentation in the realms of image understanding/analysis, computer vision, pattern recognition, remote sensing and medical imaging in recent years has been significantly augmented due to accelerated scientific advances made in the acquisition of image data. This low-level analysis protocol is critical to numerous applications, with the primary goal of expediting and improving the effectiveness of subsequent high-level operations by providing a condensed and pertinent representation of image information. In this research, we propose a novel unsupervised segmentation framework for facilitating meaningful segregation of 2-D/3-D image data across multiple modalities (color, remote-sensing and biomedical imaging) into non-overlapping partitions using several spatial-spectral attributes. Initially, our framework exploits the information obtained from detecting edges inherent in the data. To this effect, by using a vector gradient detection technique, pixels without edges are grouped and individually labeled to partition some initial portion of the input image content. Pixels that contain higher gradient densities are included by the dynamic generation of segments as the algorithm progresses to generate an initial region map. Subsequently, texture modeling is performed and the obtained gradient, texture and intensity information along with the aforementioned initial partition map are used to perform a multivariate refinement procedure, to fuse groups with similar characteristics yielding the final output segmentation. Experimental results obtained in comparison to published/state-of the-art segmentation techniques for color as well as multi/hyperspectral imagery, demonstrate the advantages of the proposed method. Furthermore, for the purpose of achieving improved computational efficiency we propose an extension of the aforestated methodology in a multi-resolution framework, demonstrated on color images. Finally, this research also encompasses a 3-D extension of the aforementioned algorithm demonstrated on medical (Magnetic Resonance Imaging / Computed Tomography) volumes

Advances in Nonnegative Matrix Decomposition with Application to Cluster Analysis

Nonnegative Matrix Factorization (NMF) has found a wide variety of applications in machine learning and data mining. NMF seeks to approximate a nonnegative data matrix by a product of several low-rank factorizing matrices, some of which are constrained to be nonnegative. Such additive nature often results in parts-based representation of the data, which is a desired property especially for cluster analysis.  This thesis presents advances in NMF with application in cluster analysis. It reviews a class of higher-order NMF methods called Quadratic Nonnegative Matrix Factorization (QNMF). QNMF differs from most existing NMF methods in that some of its factorizing matrices occur twice in the approximation. The thesis also reviews a structural matrix decomposition method based on Data-Cluster-Data (DCD) random walk. DCD goes beyond matrix factorization and has a solid probabilistic interpretation by forming the approximation with cluster assigning probabilities only. Besides, the Kullback-Leibler divergence adopted by DCD is advantageous in handling sparse similarities for cluster analysis.  Multiplicative update algorithms have been commonly used for optimizing NMF objectives, since they naturally maintain the nonnegativity constraint of the factorizing matrix and require no user-specified parameters. In this work, an adaptive multiplicative update algorithm is proposed to increase the convergence speed of QNMF objectives.  Initialization conditions play a key role in cluster analysis. In this thesis, a comprehensive initialization strategy is proposed to improve the clustering performance by combining a set of base clustering methods. The proposed method can better accommodate clustering methods that need a careful initialization such as the DCD.  The proposed methods have been tested on various real-world datasets, such as text documents, face images, protein, etc. In particular, the proposed approach has been applied to the cluster analysis of emotional data

Machine Learning

Machine Learning can be defined in various ways related to a scientific domain concerned with the design and development of theoretical and implementation tools that allow building systems with some Human Like intelligent behavior. Machine learning addresses more specifically the ability to improve automatically through experience