Growing Cell Structures Neural Networks for Designing Spectral Indexes

Remote sensing can be defined as the technique that facilitates the acquisition of land surface data without contact with the material object of observation. The development of tools for analyzing and processing multispectral images captured by sensors aboard satellites has provided the automation of tasks that could not be possible otherwise. The main problem related with this discipline is the large volume of data of multidimensional nature that must be handled. The concept of spectral index emerged as an idea to reduce the number of dimensions to one, and thus facilitate the study of different features associated to the types of land cover categories that exhibits a multispectral image. Formally, a spectral index is defined as a combination of spectral bands whose function is to enhance the contribution of one type of land cover mitigating the rest of covers. In this work a no-supervised methodology to analyze and discover spectral indexes based on growing self-organizing neural network (GCS-Growing Cell Structures) is presented

Use of Self Organized Maps for Feature Extraction of Hyperspectral Data

In this paper, the problem of analyzing hyperspectral data is presented. The complexity of multi-dimensional data leads to the need for computer assisted data compression and labeling of important features. A brief overview of Self-Organizing Maps and their variants is given and then two possible methods of data analysis are examined. These methods are incorporated into a program derived from som_toolbox2. In this program, ASD data (data collected by an Analytical Spectral Device sensor) is read into a variable, relevant bands for discrimination between classes are extracted, and several different methods of analyzing the results are employed. A GUI was developed for easy implementation of these three stages

Histopathological image analysis : a review

Over the past decade, dramatic increases in computational power and improvement in image analysis algorithms have allowed the development of powerful computer-assisted analytical approaches to radiological data. With the recent advent of whole slide digital scanners, tissue histopathology slides can now be digitized and stored in digital image form. Consequently, digitized tissue histopathology has now become amenable to the application of computerized image analysis and machine learning techniques. Analogous to the role of computer-assisted diagnosis (CAD) algorithms in medical imaging to complement the opinion of a radiologist, CAD algorithms have begun to be developed for disease detection, diagnosis, and prognosis prediction to complement the opinion of the pathologist. In this paper, we review the recent state of the art CAD technology for digitized histopathology. This paper also briefly describes the development and application of novel image analysis technology for a few specific histopathology related problems being pursued in the United States and Europe

An Approach to Pattern Recognition by Evolutionary Computation

Evolutionary Computation has been inspired by the natural phenomena of evolution. It provides a quite general heuristic, exploiting few basic concepts: reproduction of individuals, variation phenomena that affect the likelihood of survival of individuals, inheritance of parents features by offspring. EC has been widely used in the last years to effectively solve hard, non linear and very complex problems. Among the others, EC–based algorithms have also been used to tackle classification problems. Classification is a process according to which an object is attributed to one of a finite set of classes or, in other words, it is recognized as belonging to a set of equal or similar entities, identified by a label. Most likely, the main aspect of classification concerns the generation of prototypes to be used to recognize unknown patterns. The role of prototypes is that of representing patterns belonging to the different classes defined within a given problem. For most of the problems of practical interest, the generation of such prototypes is a very hard problem, since a prototype must be able to represent patterns belonging to the same class, which may be significantly dissimilar each other. They must also be able to discriminate patterns belonging to classes different from the one that they represent. Moreover, a prototype should contain the minimum amount of information required to satisfy the requirements just mentioned. The research presented in this thesis, has led to the definition of an EC–based framework to be used for prototype generation. The defined framework does not provide for the use of any particular kind of prototypes. In fact, it can generate any kind of prototype once an encoding scheme for the used prototypes has been defined. The generality of the framework can be exploited to develop many applications. The framework has been employed to implement two specific applications for prototype generation. The developed applications have been tested on several data sets and the results compared with those obtained by other approaches previously presented in the literature