The rough sets feature selection for trees recognition in color aerial images using genetic algorithms

Selecting a set of features which is optimal for a given task is the problem which plays an important role in a wide variety of contexts including pattern recognition, images understanding and machine learning. The concept of reduction of the decision table based on the rough set is very useful for feature selection. In this paper, a genetic algorithm based approach is presented to search the relative reduct decision table of the rough set. This approach has the ability to accommodate multiple criteria such as accuracy and cost of classification into the feature selection process and finds the effective feature subset for texture classification . On the basis of the effective feature subset selected, this paper presents a method to extract the objects which are higher than their surroundings, such as trees or forest, in the color aerial images. The experiments results show that the feature subset selected and the method of the object extraction presented in this paper are practical and effective.

Birds in agricultural mosaics : the influence of landscape pattern and countryside heterogeneity

Agricultural environments are critical to the conservation of biota throughout the world. Efforts to identify key influences on the conservation status of fauna in such environments have taken complementary approaches. Many studies have focused on the role of remnant or seminatural vegetation and emphasized the influence on biota of spatial patterns in the landscape. Others have recognized that many species use diverse ‘‘countryside’’ elements within farmland, and emphasize the benefits of landscape heterogeneity for conservation. Here, we investigated the effect of independent measures of both the spatial pattern (extent and configuration) and heterogeneity of elements (i.e., land uses/vegetation types) on bird occurrence in farm-scale agricultural mosaics in southeastern Australia. Birds were sampled in all types of elements in 27 mosaics (each 1 3 1 km) selected to incorporate variation in cover of native vegetation and the number of different element types in the mosaic. We used an information-theoretic approach to identify the mosaic properties that most strongly influenced bird species richness. Subgroups of birds based on habitat requirements responded most strongly to the extent of preferred elements in mosaics. Woodland birds were richer in mosaics with higher cover of native vegetation while open-tolerant species responded to the extent of scattered trees. In contrast, for total species richness, mosaic heterogeneity (richness of element types) and landscape context (cover of native vegetation in surrounding area) had the greatest influence. These results showed that up to 76% of landscape-level variation in richness of bird groups is attributable to mosaic properties directly amenable to management by landowners. Key implications include (1) conservation goals for farm landscapes must be carefully defined because the richness of different faunal components is influenced by different mosaic properties; (2) the extent of native vegetation is a critical influence in agricultural environments because it drives the farmscale richness of woodland birds and has a broader context effect on total bird richness in mosaics; (3) land-use practices that enhance the heterogeneity of farmland mosaics are beneficial for native birds; and (4) the cumulative effect of even small elements in farm mosaics contribute to the structural properties of entire landscapes.

Minimum spanning trees for valley and ridge characterization in digital elevation maps

Texture synthesis employs neighbourhood matching to generate appropriate new content. Terrain synthesis has the added constraint that new content must be geographically plausible. The profile recognition and polygon breaking algorithm (PPA) [Chang et al. 1998] provides a robust mechanism for characterizing terrain as systems of valley and ridge lines in digital elevation maps. We exploit this to create a terrain characterization metric that is robust, efficient to compute and is sensitive to terrain properties.

Terrain regions are characterized as a minimum spanning tree derived from a graph created from the sample points of the elevation map which are encoded as weights in the edges of the graph. This formulation allows us to provide a single consistent feature definition that is sensitive to the pattern of ridges and valleys in the terrain Alternative formulations of these weights provide richer characteristicmeasures and we provide examples of alternate definitions based on curvature and contour measures.

We show that the measure is robust, with a significant portion derived directly from information local to the terrain sample. Global terrain characteristics introduce the issue of over- and underconnected valley/ridge lines when working with sub-regions. This is addressed by providing two graph construction strategies, which respectively provide an upper bound on connectivity as a single spanning tree, and a lower bound as a forest of trees.

Efficient minimum spanning tree algorithms are adapted to the context of terrain data and are shown to provide substantially better performance than previous PPA implementations. In particular, these are able to characterize valley and ridge behaviour at every point even in large elevation maps, providing a measure sensitive to terrain features at all scales.

The resulting graph based formulation provides an efficient and elegant algorithm for characterizing terrain features. The measure can be calculated efficiently, is robust under changes of neighbourhood position, size and resolution and the hybrid measure is sensitive to terrain features both locally and globally.

Video indexing and similarity retrieval by largest common subgraph detection using decision trees

While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomorphism detection take advantage of prior knowledge of a database of models to improve the speed of on-line matching. This paper presents a new algorithm based on similar principles to solve the largest common subgraph problem. The new algorithm significantly reduces the computational complexity of detection of the LCSG between a known database of models, and a query given on-line.

A hybrid neural network classifier combining ordered fuzzy ARTMAP and the dynamic decay adjustment algorithm

This paper presents a novel conflict-resolving neural network classifier that combines the ordering algorithm, fuzzy ARTMAP (FAM), and the dynamic decay adjustment (DDA) algorithm, into a unified framework. The hybrid classifier, known as Ordered FAMDDA, applies the DDA algorithm to overcome the limitations of FAM and ordered FAM in achieving a good generalization/performance. Prior to network learning, the ordering algorithm is first used to identify a fixed order of training patterns. The main aim is to reduce and/or avoid the formation of overlapping prototypes of different classes in FAM during learning. However, the effectiveness of the ordering algorithm in resolving overlapping prototypes of different classes is compromised when dealing with complex datasets. Ordered FAMDDA not only is able to determine a fixed order of training patterns for yielding good generalization, but also is able to reduce/resolve overlapping regions of different classes in the feature space for minimizing misclassification during the network learning phase. To illustrate the effectiveness of Ordered FAMDDA, a total of ten benchmark datasets are experimented. The results are analyzed and compared with those from FAM and Ordered FAM. The outcomes demonstrate that Ordered FAMDDA, in general, outperforms FAM and Ordered FAM in tackling pattern classification problems.

On Operating Strategies of the Fuzzy Artmap Neural Network: A Comparative Study

In this paper, the effectiveness of three different operating strategies applied to the Fuzzy ARTMAP (FAM) neural network in pattern classification tasks is analyzed and compared. Three types of FAM, namely average FAM, voting FAM, and ordered FAM, are formed for experimentation. In average FAM, a pool of the FAM networks is trained using random sequences of input patterns, and the performance metrics from multiple networks are averaged. In voting FAM, predictions from a number of FAM networks are combined using the majority-voting scheme to reach a final output. In ordered FAM, a pre-processing procedure known as the ordering algorithm is employed to identify a fixed sequence of input patterns for training the FAM network. Three medical data sets are employed to evaluate the performances of these three types of FAM. The results are analyzed and compared with those from other learning systems. Bootstrapping has also been used to analyze and quantify the results statistically. [ABSTRACT FROM AUTHOR].

Evaluation of the fuzzy ARTMAP neural network using off-line and on-line learning strategies

This paper describes an experimental study of the Fuzzy ARTMAP (FAM) neural network as an autonomous learning system for pattern classification tasks. A benchmark database of radar signals from ionosphere has been employed for the system to classify arbitrary sequences of pattern into distinct categories. A number of simulations have been conducted systematically to evaluate the applicability and usefulness of FAM in this context. First, we identify the 'optimum' parameter settings of FAM for the problem at hand, and investigate the effects of different training schemes and learning rules on classification results, using an off-line learning methodology. We then examine a voting strategy to improve classification accuracy by combining results from multiple FAM classifiers. In addition to off-line learning, we evaluate the prospect of using FAM as an autonomously learning pattern classification system for on-line, non-stationary environments. The performance of FAM is comparable with other reported results, but with the added advantage of on-line and incremental learning.

Improved GART neural network model for pattern classification and rule extraction with application to power systems

Generalized adaptive resonance theory (GART) is a neural network model that is capable of online learning and is effective in tackling pattern classification tasks. In this paper, we propose an improved GART model (IGART), and demonstrate its applicability to power systems. IGART enhances the dynamics of GART in several aspects, which include the use of the Laplacian likelihood function, a new vigilance function, a new match-tracking mechanism, an ordering algorithm for determining the sequence of training data, and a rule extraction capability to elicit if-then rules from the network. To assess the effectiveness of IGART and to compare its performances with those from other methods, three datasets that are related to power systems are employed. The experimental results demonstrate the usefulness of IGART with the rule extraction capability in undertaking classification problems in power systems engineering.

An adaptive fuzzy min-max conflict-resolving classifier

This paper describes a novel adaptive network, which agglomerates a procedure based on the fuzzy min-max clustering method, a supervised ART (Adaptive Resonance Theory) neural network, and a constructive conflict-resolving algorithm, for pattern classification. The proposed classifier is a fusion of the ordering algorithm, Fuzzy ARTMAP (FAM) and the Dynamic Decay Adjustment (DDA) algorithm. The network, called Ordered FAMDDA, inherits the benefits of the trio, viz . an ability to identify a fixed order of training pattern presentation for good generalisation; stable and incrementally learning architecture; and dynamic width adjustment of the weights of hidden nodes of conflicting classes. Classification performance of the Ordered FAMDDA is assessed using two benchmark datasets. The performances are analysed and compared with those from FAM and Ordered FAM. The results indicate that the Ordered FAMDDA classifier performs at least as good as the mentioned networks. The proposed Ordered FAMDDA network is then applied to a condition monitoring problem in a power generation station. The process under scrutiny is the Circulating Water (CW) system, with prime attention to condition monitoring of the heat transfer efficiency of the condensers. The results and their implications are analysed and discussed.