Object Detection Using Neural Networks and Genetic Programming

Accurate estimation of river flow can have a significant importance in water resources management. In this study, Genetic programming (GP) and Support Vector Machine (SVM) methods were used to forecast daily discharge of Barandoozchay River. The daily discharge data of Barandoozchay River measured at the Dizaj hydrometric station during 2007 to 2011 was used for modeling, which 80% of the data used for training and remaining 20% used for testing of models. The results showed that in the both of considered methods, the models including discharges of one, two and three days ago had higher accuracy in verification step and the accuracy of models decreased with increasing discharge values. Comparing the performance of GP and SVM methods indicated that, however the accuracy of the GP method with the R=0.978 and RMSE=1.66 (m3/s) was slightly more than SVM method with R=0.976 and RMSE=1.80 (m3/s), but the SVM is easier than GP method. Thus, the SVM method can be used as an alternative method in forecasting daily river discharge.

A context‐free genetic programming (GP) method is presented that simulated local scale daily extreme (maximum and minimum) temperatures based on large scale atmospheric variables. The method evolves simple and optimal models for downscaling daily temperature at a station. The advantage of the context‐free GP method is that both the variables and constants of the candidate models are optimized and consequently the selection of the optimal model. The method is applied to the Chute‐du‐Diable weather station in Northeastern Canada along with the National Center for Environmental Prediction (NCEP) reanalysis datasets. The performance of the GP based downscaling models is compared to benchmarks from a commonly used statistical downscaling model. The experiment results show that the models evolved by the GP are simpler and more efficient for downscaling daily extreme temperature than the common statistical method. The different model test results indicate that the GP approach significantly outperforms the statistical method for the downscaling of daily minimum temperature, while for the maximum temperature the two methods are almost equivalent. However, the GP method remains slightly more effective for maximum temperature downscaling than the statistical method.

The genetic programming (GP) method is proposed as a new approach to perform texture classification based directly on raw pixel data. Two alternative genetic programming representations are used to perform classification. These are dynamic range selection (DRS) and static range selection (SRS). This preliminary study uses four brodatz textures to investigate the applicability of the genetic programming method for binary texture classifications and multi-texture classifications.Results indicate that the genetic programming method, based directly on raw pixel data, is able to accurately classify different textures. The results show that the DRS method is well suited to the task of texture classification. The classifiers generated in our experiments by DRS have good performance over a variety of texture data and offer GP as a promising alternative approach for the difficult problem of texture classification.KeywordsGenetic ProgrammingClass LabelTexture ClassificationTraining AccuracyDivision PointThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Genetic Programming (GP) has been widely employed to create dispatching rules intelligently for production scheduling. The success of GP depends on a suitable terminal set of selected features. Specifically, techniques that consider feature selection in GP to enhance rule understandability for dynamic job shop scheduling (DJSS) have been successful. However, existing feature selection algorithms in GP focus more emphasis on obtaining more compact rules with fewer features than on improving effectiveness. This paper is an attempt at combining a novel GP method, GP via dynamic diversity management, with feature selection to design effective and interpretable dispatching rules for DJSS. The idea of the novel GP method is to achieve a progressive transition from exploration to exploitation by relating the level of population diversity to the stopping criteria and elapsed duration. We hypothesize that diverse and promising individuals obtained from the novel GP method can guide the feature selection to design competitive rules. The proposed approach is compared with three GP-based algorithms and 20 benchmark rules in the different job shop conditions and scheduling objectives. Experiments show that the proposed approach greatly outperforms the compared methods in generating more interpretable and effective rules for the three objective functions. Overall, the average improvement over the best-evolved rules by the other three GP-based algorithms is 13.28%, 12.57%, and 15.62% in the mean tardiness (MT), mean flow time (MFT), and mean weighted tardiness (MWT) objective, respectively.

This paper describes a domain independent approach to the use of genetic programming for object detection problems. Rather than using raw pixels or high level domain specific features, this approach uses domain independent statistical features as terminals in genetic programming. Besides position invariant statistics such as mean and standard deviation, this approach also uses position dependent pixel statistics such as moments and local region statistics as terminals. Based on an existing fitness function which uses linear combination of detection rate and alarm rate, we introduce a new measure called false alarm to the fitness function. In addition to the standard arithmetic operators, this approach also uses a conditional operator if in the function set. This approach is tested on two object detection problems. The experiments suggest that position dependent pixel statistics computed from local (central) regions and nonlinear condition functions are effective to object detection problems. Fitness functions with alarm area can reflect the smoothness of evolved genetic programs. This approach works well for the detecting small regular multiple class objects on a relatively uncluttered background.

One of the most straightforward techniques for detecting changes in an image involves forming the difference between a test image and a reference image. Unfortunately, such a technique can give rise to a large number of false alarms due to the statistical variability of the underlying pixel values, as has been well established within the radar community over the years. One method for dealing with this large number of false alarms involves forming the ratio, rather than the difference, of two synthetic aperture radar (SAR) images. We introduce a modified version of the standard differencing technique to overcome problems associated with pixel value variability. The new (modified) differencing approach utilizes assumptions about the statistics of the image background and the object being sought (target) to reduce the number of false alarms due to highly variable background (clutter) regions, and it includes the standard ratio test as a special case. In fact, we find that the modified difference approach can also be viewed as a modified version of the ratio test with a threshold that varies as a function of the background clutter radar cross section (RCS). We also present an abridged, albeit suboptimal, version of this approach that eliminates assumptions regarding the target's probability distribution, and we analyze both of the approaches. We then compare these results with those obtained with a standard ratio test, and illustrate how the modified difference test reduces to the ratio test under certain operating conditions. The abridged version of the modified approach is applied to high resolution synthetic aperture radar imagery and compared with results obtained with the classical differencing technique, and following this, the modified difference technique is compared with the standard ratio test. Results suggest that under appropriate conditions the abridged, modified technique can successfully detect changes without the need for any image segmentation.

Nonlinear model identification of an experimental ball-and-tube system using a genetic programming approach

One of the major challenges in proteomics is peptide identification from mass spectra containing high noise ratio and small number of signal (b-/y-ions) peaks. However, the accuracy and reliability of peptide identification in such highly imbalanced MS/MS data can be improved by applying a preprocessing step prior to peptide identification aiming at discriminating b-/y-ions from noise peaks in the spectra. In this study, we report a genetic programming (GP)-based preprocessing method for de-noising highly imbalanced and noisy CID MS/MS spectra. GP now becomes a popular machine learning method via automatic programming. GP preprocesses the highly noisy MS/MS spectra by classifying peaks as noise peaks or signal peaks in a binary classification manner. Meanwhile, a set of spectral fragment features based on the MS/MS fragmentation rules is extracted from the dataset to investigate their discriminating abilities by GP. A MS/MS spectral dataset containing thousands of spectra are used to train the GP model. As the GP tree-based representation has the capability for implicit feature selection during the evolutionary process, the evolved GP model with the selected features is compared with the best threshold-based method. The results show that the GP method improved the reliability of peptide identification and increased the identification rate of a de novo sequencing tool, PEAKS, to 99.4% from 80.1% achieved by the best threshold-based method. Moreover, the result of peptide identification by a database search tool, SEQUEST, using the data preprocessed by the GP method was statistically significant compared to the other methods.

Semantic genetic programming is a recent, rapidly growing trend in Genetic Programming (GP) that aims at opening the 'black box' of the evaluation function and make explicit use of more information on program behavior in the search. In the most common scenario of evaluating a GP program on a set of input-output examples (fitness cases), the semantic approach characterizes program with a vector of outputs rather than a single scalar value (fitness). The past research on semantic GP has demonstrated that the additional information obtained in this way facilitates designing more effective search operators. In particular, exploiting the geometric properties of the resulting semantic space leads to search operators with attractive properties, which have provably better theoretical characteristics than conventional GP operators. This in turn leads to dramatic improvements in experimental comparisons. The aim of the tutorial is to give a comprehensive overview of semantic methods in genetic programming, illustrate in an accessible way a formal geometric framework for program semantics to design provably good mutation and crossover operators for traditional GP problem domains, and to analyze rigorously their performance (runtime analysis). A number of real-world applications of this framework will be also presented. Other promising emerging approaches to semantics in GP will be reviewed. In particular, the recent developments in the behavioral programming, which aims at characterizing the entire program behavior (and not only program outputs) will be covered as well. Current challenges and future trends in semantic GP will be identified and discussed. Selected methods and concepts will be accompanied with live software demonstrations. Also, efficient implementation of semantic search operators may be challenging. We will illustrate very efficient, concise and elegant implementations of these operators, which are available for download from the web.

Genetic Programming (GP) for symbolic regression is often prone to overfitting the training data, causing poor performance on unseen data. A number of recent works in the field have been devoted to regulating this problem by investigating both the structural and functional complexity of GP individuals during the evolutionary process. This work uses the Rademacher complexity and incorporates it into the fitness function of GP, utilising it as a means of controlling the functional complexity of GP individuals. The experiment results confirm that the new GP method has a notable generalization gain compared to the standard GP and Support Vector Regression (SVR) in most of the considered problems. Further investigations also show that the new GP method generates symbolic regression models that could not only release the overfitting trend in standard GP but also are significantly smaller in size compared to their counterparts in standard GP.

Generalization ability, which reflects the prediction ability of a learned model, is an important property in genetic programming (GP) for symbolic regression. Structural risk minimization (SRM) is a framework providing a reliable estimation of the generalization performance of prediction models. Introducing the framework into GP has the potential to drive the evolutionary process toward models with good generalization performance. However, this is tough due to the difficulty in obtaining the Vapnik–Chervonenkis (VC) dimension of nonlinear models. To address this difficulty, this paper proposes an SRM-driven GP approach, which uses an experimental method (instead of theoretical estimation) to measure the VC dimension of a mixture of linear and nonlinear regression models for the first time. The experimental method has been conducted using uniform and nonuniform settings. The results show that our method has impressive generalization gains over standard GP and GP with the 0.632 bootstrap, and that the proposed method using the nonuniform setting has further improvement than its counterpart using the uniform setting. Further analyzes reveal that the proposed method can evolve more compact models, and that the behavioral difference between these compact models and the target models is much smaller than their counterparts evolved by the other GP methods.

A genetic programming-based method for image classification with small training data

Modeling and optimization of lead and cobalt biosorption from water with Rafsanjan pistachio shell, using experiment based models of ANN and GP, and the grey wolf optimizer

Drip irrigation is considered as one of the most efficient irrigation systems. Knowledge of the soil wetted perimeter arising from infiltration of water from drippers is important in the design and management of efficient irrigation systems. To this aim, numerical models can represent a powerful tool to analyze the evolution of the wetting pattern during irrigation, in order to explore drip irrigation management strategies, to set up the duration of irrigation, and finally to optimize water use efficiency. This paper examines the potential of genetic programming (GP) in simulating wetting patterns of drip irrigation. First by considering 12 different soil textures of USDA–SCS soil texture triangle, different emitter discharge and duration of irrigation, soil wetting patterns have been simulated by using HYDRUS 2D software. Then using the calculated values of depth and radius of wetting pattern as target outputs, two different GP models have been considered. Finally, the capability of GP for simulating wetting patterns was analyzed using some values of data set that were not used in training. Results showed that the GP method had good agreement with results of HYDRUS 2D software in the case of considering full set of operators with R2 of 0.99 and 0.99 and root mean squared error of 2.88 and 4.94 in estimation of radius and depth of wetting patterns, respectively. Also, field experimental results in a sandy loam soil with emitter discharge of 4 L h-1 showed reasonable agreement with GP results. As a conclusion, the results of the study demonstrate the usefulness of the GP method for estimating wetting patterns of drip irrigation.

Intrusion detection systems (IDSs) attempt to identify attacks by comparing collected data to predefined signatures known to be malicious (misuse-based IDSs) or to a model of legal behavior (anomaly-based IDSs). Anomaly-based approaches have the advantage of being able to detect previously unknown attacks, but they suffer from the difficulty of building robust models of acceptable behavior, which may result in a large number of false alarms. Almost all current anomaly-based intrusion detection systems classify an input event as normal or anomalous by analyzing its features, utilizing a number of different models. A decision for an input event is made by aggregating the results of all employed models. We have identified two reasons for the large number of false alarms, caused by incorrect classification of events in current systems. One is the simplistic aggregation of model outputs in the decision phase. Often, only the sum of the model results is calculated and compared to a threshold. The other reason is the lack of integration of additional information into the decision process. This additional information can be related to the models, such as the confidence in a model's output, or can be extracted from external sources. To mitigate these shortcomings, we propose an event classification scheme that is based on Bayesian networks. Bayesian networks improve the aggregation of different model outputs and allow one to seamlessly incorporate additional information. Experimental results show that the accuracy of the event classification process is significantly improved using our proposed approach.