Parameter estimation of K-distributed sea clutter based on fuzzy inference and Gustafson-Kessel clustering

The detection performance of maritime radars is restricted by the unwanted sea echo or clutter. Although the number of these target-like data is small, they may cause false alarm and perturb the target detection. K-distribution is known as the best fit probability density function for the radar sea clutter. This paper proposes a novel approach to estimate the parameters of K-distribution, based on fuzzy Gustafson–Kessel clustering and fuzzy Takagi–Sugeno Kang modelling. The main contribution of the proposed method is the ability to estimate the parameters, given a small number of data which will usually be the case in practical applications. This is achieved by a pre-estimation using fuzzy clustering that provides a prior knowledge and forms a rough model to be fine tuned using the least square method. The algorithm also improves the calculations of shape and width of membership functions by means of clustering in order to improve the accuracy. The resultant estimator then acts to overcome the bottleneck of the existing methods in which it achieves a higher performance and accuracy in spite of small number of data

Parameter Estimation of K-Distributed Clutter Based on Fuzzy Inference and Gustafson-Kessel Clustering

The detection performance of maritime radars is restricted by the unwanted sea echo or clutter which is the vector sum of scattering from the sea surface. The echo is noise-like and is expected from a set of randomly moving scatters. Although the number of these target-like data is small, they may cause false alarm in maritime radar and perturb the target detection. K-distribution is known as the best fitted probability density function for the radar sea clutter. The accurate and fast parameter estimation of K-distribution for small number of sea clutter radar data is crucial task to avoid irreparable disasters. A novel approach to estimate the parameters of K-distribution based on fuzzy inference has been proposed in the thesis. Takagi-Sugeno Kang (TSK) model has been chosen since human knowledge is unavailable to be captured, whereas the sea clutter for specific parameter can be easily generated. GK- clustering has been used in order to identify the membership function of the antecedent parts. Least Square Method has been utilized to estimate the parameter of the K-distribution, which is represented in the consequent part of the fuzzy inference system. For a real-time implementation of the proposed method, vectorized programming technique has been implemented. In comparison with the conventional methods, this technique has less computational complexity, needs lesser time to train and estimates faster than any existing methods. Since the method is clustering based, some kind of pre-knowledge (rough estimation) is naturally stored in the structure of the TSK-fuzzy system and Least Square provides a mechanism to fine tune the consequent parameters. The novelty of the proposed method is the incorporation of the clustering (as a pre-estimator) with the estimation process. The resultant estimator then overcomes the bottleneck of the existing methods and is capable of handling even a small number of data

Advances in Computational Intelligence Applications in the Mining Industry

This book captures advancements in the applications of computational intelligence (artificial intelligence, machine learning, etc.) to problems in the mineral and mining industries. The papers present the state of the art in four broad categories: mine operations, mine planning, mine safety, and advances in the sciences, primarily in image processing applications. Authors in the book include both researchers and industry practitioners

On-line learning and anomaly detection methods : applications to fault assessment

[Abstract] This work lays at the intersection of two disciplines, Machine Learning (ML) research and predictive maintenance of machinery. On the one hand, Machine Learning aims at detecting patterns in data gathered from phenomena which can be very different in nature. On the other hand, predictive maintenance of industrial machinery is the discipline which, based on the measurement of physical conditions of its internal components, assesses its present and near future condition in order to prevent fatal failures. In this work it is highlighted that these two disciplines can benefit from their synergy. Predictive maintenance is a challenge for Machine Learning algorithms due to the nature of data generated by rotating machinery: (a) each machine constitutes an new individual case so fault data is not available for model construction and (b) working conditions of the machine are changeable in many situations and affects captured data. Machine Learning can help predictive maintenance to: (a) cut plant costs though the automation of tedious periodic tasks which are carried out by experts and (b) reduce the probability of fatal damages in machinery due to the possibility of monitoring it more frequently at a modest cost increase. General purpose ML techniques able to deal with the aforementioned conditions are proposed. Also, its application to the specific field of predictive maintenance of rotating machinery based on vibration signature analysis is thoroughly treated. Since only normal state data is available to model the vibration captures of a machine, we are restricted to the use of anomaly detection algorithms, which will be one of the main blocks of this work. In addition, predictive maintenance also aims at assessing its state in the near future. The second main block of this work, on-line learning algorithms, will help us in this task. A novel on-line learning algorithm for a single layer neural network with a non-linear output function is proposed. In addition to the application to predictive maintenance, the proposed algorithm is able to continuously train a network in a one pattern at a time manner. If some conditions are hold, it analytically ensures to reach a global optimal model. As well as predictive maintenance, the proposed on-line learning algorithm can be applied to scenarios of stream data learning such as big data sets, changing contexts and distributed data. Some of the principles described in this work were introduced in a commercial software prototype, GIDASR ? . This software was developed and installed in real plants as part of the work of this thesis. The experiences in applying ML to fault detection with this software are also described and prove that the proposed methodology can be very effective. Fault detection experiments with simulated and real vibration data are also carried out and demonstrate the performance of the proposed techniques when applied to the problem of predictive maintenance of rotating machinery.[Resumen] La presente tesis doctoral se sitúa en el ámbito de dos disciplinas, la investigación en Aprendizaje Computacional (AC) y el Mantenimiento Predictivo (MP) de maquinaria rotativa. Por una parte, el AC estudia la problemática de detectar y clasificar patrones en conjuntos de datos extraídos de fenómenos de interés de la más variada naturaleza. Por su parte, el MP es la disciplina que, basándose en la monitorización de variables físicas de los componentes internos de maquinaria industrial, se encarga de valorar las condiciones de éstos tanto en el momento presente como en un futuro próximo con el fin último de prevenir roturas que pueden resultar de fatales consecuencias. En este trabajo se pone de relevancia que ambas disciplinas pueden beneficiarse de su sinergia. El MP supone un reto para el AC debido a la naturaleza de los datos generados por la maquinaria: (a) las propiedades de las medidas físicas recogidas varían para cada máquina y, debido a que la monitorización debe comenzar en condiciones correctas, no contamos con datos de fallos para construir un modelo de comportamiento y (b) las condiciones de funcionamiento de las máquinas pueden ser variables y afectar a los datos generados por éstas. El AC puede ayudar al MP a: (a) reducir costes a través de la automatización de tareas periódicas tediosas que tienen que ser realizadas por expertos en el área y (b) reducir la probabilidad de grandes da˜nos a la maquinaria gracias a la posibilidad de monitorizarla con una mayor frecuencia sin elevar los costes sustancialmente. En este trabajo, se proponen algoritmos de AC de propósito general capaces de trabajar en las condiciones anteriores. Además, su aplicación específica al campo del mantenimiento predictivo de maquinaria rotativa basada en el análisis de vibraciones se estudia en detalle, aportando resultados para casos reales. El hecho de disponer sólamente de datos en condiciones de normalidad de la maquinaria nos restringe al uso de técnicas de detección de anomalías. éste será uno de los bloques principales del presente trabajo. Por otra parte, el MP también intenta valorar si la maquinaria se encontrará en un estado inaceptable en un futuro próximo. En el segundo bloque se presenta un nuevo algoritmo de aprendizaje en tiempo real (on-line) que será de gran ayuda en esta tarea. Se propone un nuevo algoritmo de aprendizaje on-line para una red neuronas monocapa con función de transferencia no lineal. Además de su aplicación al mantenimiento predictivo, el algoritmo propuesto puede ser empleado en otros escenarios de aprendizaje on-line como grandes conjuntos de datos, cambios de contexto o datos distribuidos. Algunas de las ideas descritas en este trabajo fueron implantadas en un prototipo de software comercial, GIDASR ? . Este software fue desarrollado e implantado en plantas reales por el autor de este trabajo y las experiencias extraídas de su aplicación también se describen en el presente volumen[Resumo] O presente traballo sitúase no ámbito de dúas disciplinas, a investigación en Aprendizaxe Computacional (AC) e o Mantemento Predictivo (MP) de maquinaria rotativa. Por unha banda, o AC estuda a problemática de detectar e clasificar patróns en conxuntos de datos extraídos de fenómenos de interese da máis variada natureza. Pola súa banda, o MP é a disciplina que, baseándose na monitorización de variables físicas dos seus compo˜nentes internos, encárgase de valorar as condicións destes tanto no momento presente como nun futuro próximo co fin último de previr roturas que poden resultar de fatais consecuencias. Neste traballo ponse de relevancia que ambas disciplinas poden beneficiarse da súa sinergia. O MP supón un reto para o AC debido á natureza dos datos xerados pola maquinaria: (a) as propiedades das medidas físicas recolleitas varían para cada máquina e, debido a que a monitorización debe comezar en condicións correctas, non contamos con datos de fallos para construír un modelo de comportamento e (b) as condicións de funcionamento das máquinas poden ser variables e afectar aos datos xerados por estas. O AC pode axudar ao MP a: (a) reducir custos a través da automatización de tarefas periódicas tediosas que te˜nen que ser realizadas por expertos no área e (b) reducir a probabilidade de grandes danos na maquinaria grazas á posibilidade de monitorizala cunha maior frecuencia sen elevar os custos sustancialmente. Neste traballo, propó˜nense algoritmos de AC de propósito xeral capaces de traballar nas condicións anteriores. Ademais, a súa aplicación específica ao campo do mantemento predictivo de maquinaria rotativa baseada na análise de vibracións estúdase en detalle aportando resultados para casos reais. Debido a contar só con datos en condicións de normalidade da maquinaria, estamos restrinxidos ao uso de técnicas de detección de anomalías. éste será un dos bloques principais do presente traballo. Por outra banda, o MP tamén intenta valorar si a maquinaria atoparase nun estado inaceptable nun futuro próximo. No segundo bloque do presente traballo preséntase un novo algoritmo de aprendizaxe en tempo real (on-line) que será de gran axuda nesta tarefa. Proponse un novo algoritmo de aprendizaxe on-line para unha rede neuronas monocapa con función de transferencia non lineal. Ademais da súa aplicación ao mantemento predictivo, o algoritmo proposto pode ser empregado en escenarios de aprendizaxe on-line como grandes conxuntos de datos, cambios de contexto ou datos distribuídos. Algunhas das ideas descritas neste traballo foron implantadas nun prototipo de software comercial, GIDASR ? . Este software foi desenvolvido e implantado en plantas reais polo autor deste traballo e as experiencias extraídas da súa aplicación tamén se describen no presente volume

Computer-based tools for supporting forest management. The experience and the expertise world-wide

Report of Cost Action FP 0804 Forest Management Decision Support Systems (FORSYS)Computer-based tools for supporting forest management. The experience and the expertise world-wide answers a call from both the research and the professional communities for a synthesis of current knowledge about the use of computerized tools in forest management planning. According to the aims of the Forest Management Decision Support Systems (FORSYS) (http://fp0804.emu.ee/) this synthesis is a critical success factor to develop a comprehensive quality reference for forest management decision support systems. The emphasis of the book is on identifying and assessing the support provided by computerized tools to enhance forest management planning in real-world contexts. The book thus identifies the management planning problems that prevail world-wide to discuss the architecture and the components of the tools used to address them. Of importance is the report of architecture approaches, models and methods, knowledge management and participatory planning techniques used to address specific management planning problems. We think that this synthesis may provide effective support to research and outreach activities that focus on the development of forest management decision support systems. It may contribute further to support forest managers when defining the requirements for a tool that best meets their needs. The first chapter of the book provides an introduction to the use of decision support systems in the forest sector and lays out the FORSYS framework for reporting the experience and expertise acquired in each country. Emphasis is on the FORSYS ontology to facilitate the sharing of experiences needed to characterize and evaluate the use of computerized tools when addressing forest management planning problems. The twenty six country reports share a structure designed to underline a problem-centric focus. Specifically, they all start with the identification of the management planning problems that are prevalent in the country and they move on to the characterization and assessment of the computerized tools used to address them. The reports were led by researchers with background and expertise in areas that range from ecological modeling to forest modeling, management planning and information and communication technology development. They benefited from the input provided by forest practitioners and by organizations that are responsible for developing and implementing forest management plans. A conclusions chapter highlights the success of bringing together such a wide range of disciplines and perspectives. This book benefited from voluntary contributions by 94 authors and from the involvement of several forest stakeholders from twenty six countries in Europe, North and South America, Africa and Asia over a three-year period. We, the chair of FORSYS and the editorial committee of the publication, acknowledge and thank for the valuable contributions from all authors, editors, stakeholders and FORSYS actors involved in this project

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp