Template matching (TM) plays an important role in several image-processing applications such as feature tracking, object recognition, stereo matching, and remote sensing. The TM approach seeks for the best-possible re...
详细信息
Template matching (TM) plays an important role in several image-processing applications such as feature tracking, object recognition, stereo matching, and remote sensing. The TM approach seeks for the best-possible resemblance between a subimage known as template and its coincident region within a source image. TM involves two critical aspects: similarity measurement and search strategy. The simplest available TM method aims for the best-possible coincidence between the images through an exhaustive computation of the normalized cross-correlation (NCC) values (similarity measurement) for all elements of the source image (search strategy). Recently, several TM algorithms that are based on evolutionary approaches have been proposed to reduce the number of NCC operations by calculating only a subset of search locations. In this paper, a new algorithm based on the electromagnetism-like algorithm (EMO) is proposed to reduce the number of search locations in the TM process. The algorithm uses an enhanced EMO version, which incorporates a modification of the local search procedure to accelerate the exploitation process. As a result, the new EMO algorithm can substantially reduce the number of fitness function evaluations while preserving the good search capabilities of the original EMO. In the proposed approach, particles represent search locations, which move throughout the positions of the source image. The NCC coefficient, considered as the fitness value (charge extent), evaluates the matching quality presented between the template image and the coincident region of the source image, for a determined search position (particle). The number of NCC evaluations is also reduced by considering a memory, which stores the NCC values previously visited to avoid the re-evaluation of the same search locations (particles). Guided by the fitness values (NCC coefficients), the set of candidate positions are evolved through EMO operators until the best-possible resemblance is determine
A shift from even-aged forest management to uneven-aged management practices leads to a problem rather different from the existing straightforward practice that follows a rotation cycle of artificial regeneration, thi...
详细信息
A shift from even-aged forest management to uneven-aged management practices leads to a problem rather different from the existing straightforward practice that follows a rotation cycle of artificial regeneration, thinning of inferior trees and a clearcut. A lack of realistic models and methods suggesting how to manage uneven-aged stands in a way that is economically viable and ecologically sustainable creates difficulties in adopting this new management practice. To tackle this problem, we make a two-fold contribution in this paper. The first contribution is the proposal of an algorithm that is able to handle a realistic uneven-aged stand management model that is otherwise computationally tedious and intractable. The model considered in this paper is an empirically estimated size-structured ecological model for uneven-aged spruce forests. The second contribution is on the sensitivity analysis of the forest model with respect to a number of important parameters. The analysis provides us an insight into the behavior of the uneven-aged forest model. (C) 2016 Elsevier B.V. All rights reserved.
In seeking constraints on global climate model projections under global warming, one commonly finds that different subsets of models perform well under different objective functions, and these trade-offs are difficult...
详细信息
In seeking constraints on global climate model projections under global warming, one commonly finds that different subsets of models perform well under different objective functions, and these trade-offs are difficult to weigh. Here a multiobjective approach is applied to a large set of subensembles generated from the Climate Model Intercomparison Project phase 5 ensemble. We use observations and reanalyses to constrain tropical Pacific sea surface temperatures, upper level zonal winds in the midlatitude Pacific, and California precipitation. An evolutionary algorithm identifies the set of Pareto-optimal subensembles across these three measures, and these subensembles are used to constrain end-of-century California wet season precipitation change. This methodology narrows the range of projections throughout California, increasing confidence in estimates of positive mean precipitation change. Finally, we show how this technique complements and generalizes emergent constraint approaches for restricting uncertainty in end-of-century projections within multimodel ensembles using multiple criteria for observational constraints.
This article proposes an alternative constraint handling technique for the four-bar linkage path generation problem. The constraint handling technique that is traditionally applied uses an exterior penalty function, a...
详细信息
This article proposes an alternative constraint handling technique for the four-bar linkage path generation problem. The constraint handling technique that is traditionally applied uses an exterior penalty function, and has been found to be inefficient, particularly when dealing with constraints on the input angles. The new technique deals with both input crank rotation and Grashof's criterion. Four classical path generation problems are used to test the performance of the proposed technique. A new adaptive teaching-learning-based optimization (TLBO) scheme is used to solve several optimization problems. This technique is referred to here as teaching-learning-based optimization with a diversity archive (ATLBO-DA), and was specifically developed for this design problem. The results show that this new design concept gives better results than those of previous work, and that ATLBO-DA is superior to the original version and other metaheuristic algorithms.
Cultural algorithms (CA) use social intelligence to solve problems in optimization. The CA is a class of evolutionary computational models inspired from observing the cultural evolutionary process in nature. Cultural ...
详细信息
Cultural algorithms (CA) use social intelligence to solve problems in optimization. The CA is a class of evolutionary computational models inspired from observing the cultural evolutionary process in nature. Cultural algorithms employ a basic set of knowledge sources, each related to knowledge observed in various animal species. Knowledge from these sources is then combined to influence the decisions of the individual agents in solving problems. Classification using "IF-THEN" rules comes under descriptive knowledge discovery in data mining and is the most sought out by users since they represent highly comprehensible form of knowledge. The rules have certain properties which make them useful forms of actionable knowledge to the users. The rules are evaluated using these properties represented as objective and subjective measures. The rule properties may be conflicting. Hence discovery of rules with specific properties is considered as a multi-objective optimization problem. In the current study an extended cultural algorithm which applies social intelligence in the data mining domain to present users with a set of rules optimized according to user specified metrics is proposed. Preliminary experimental results using benchmark data sets reveal that the algorithm is promising in producing rules with specific properties.
Lightweight bistable deployable structures can be designed to be transportable and reusable. They instantaneously achieve some structural stability when transformed from the compact to the deployed state through a con...
详细信息
Lightweight bistable deployable structures can be designed to be transportable and reusable. They instantaneously achieve some structural stability when transformed from the compact to the deployed state through a controlled snap-through, as a result of intended geometric incompatibilities between the beams. Due to their transformable bistable nature their design requires assessing both their non-linear transformation behaviour, as well as their service state in the deployed configuration. The requirement of a low peak force during transformation can be shown to oppose the high stiffness requirement in the deployed state;their design can therefore be formulated as a multi-objective non-linear optimisation problem. In this contribution, a size and shape optimisation method is elaborated by choosing the best material combinations, the optimal geometry of the structure and beam cross-sections. The originality of this contribution is the use of a multi-objective evolutionary algorithm to structurally optimise bistable scissor structures taking into account the deployed state as well as the transformation phase. First, the method is applied to optimise a single bistable scissor module. Next, a multi-module bistable scissor structure is optimised and the single module and full structure based approaches are critically compared.
Over the last decade, deep neural networks have shown great success in the fields of machine learning and computer vision. Currently, the CNN (convolutional neural network) is one of the most successful networks, havi...
详细信息
Over the last decade, deep neural networks have shown great success in the fields of machine learning and computer vision. Currently, the CNN (convolutional neural network) is one of the most successful networks, having been applied in a wide variety of application domains, including pattern recognition, medical diagnosis and signal processing. Despite CNNs' impressive performance, their architectural design remains a significant challenge for researchers and practitioners. The problem of selecting hyperparameters is extremely important for these networks. The reason for this is that the search space grows exponentially in size as the number of layers increases. In fact, all existing classical and evolutionary pruning methods take as input an already pre-trained or designed architecture. None of them take pruning into account during the design process. However, to evaluate the quality and possible compactness of any generated architecture, filter pruning should be applied before the communication with the data set to compute the classification error. For instance, a medium-quality architecture in terms of classification could become a very light and accurate architecture after pruning, and vice versa. Many cases are possible, and the number of possibilities is huge. This motivated us to frame the whole process as a bi-level optimization problem where: (1) architecture generation is done at the upper level (with minimum NB and NNB) while (2) its filter pruning optimization is done at the lower level. Motivated by evolutionary algorithms' (EAs) success in bi-level optimization, we use the newly suggested co-evolutionary migration-based algorithm (CEMBA) as a search engine in this research to address our bi-level architectural optimization problem. The performance of our suggested technique, called Bi-CNN-D-C (Bi-level convolution neural network design and compression), is evaluated using the widely used benchmark data sets for image classification, called CIFAR-10, CI
This paper presents a simple and efficient real-coded genetic algorithm (RCGA) for constrained real-parameter optimization. Different from some conventional RCGAs that operate evolutionary operators in a series framew...
详细信息
This paper presents a simple and efficient real-coded genetic algorithm (RCGA) for constrained real-parameter optimization. Different from some conventional RCGAs that operate evolutionary operators in a series framework, the proposed RCGA implements three specially designed evolutionary operators, named the ranking selection (RS), direction-based crossover (DBX), and the dynamic random mutation (DRM), to mimic a specific evolutionary process that has a parallel-structured inner loop. A variety of benchmark constrained optimization problems (COPs) are used to evaluate the effectiveness and the applicability of the proposed RCGA. Besides, some existing state-of-the-art optimization algorithms in the same category of the proposed algorithm are considered and utilized as a rigorous base of performance evaluation. Extensive comparison results reveal that the proposed RCGA is superior to most of the comparison algorithms in providing a much faster convergence speed as well as a better solution accuracy, especially for problems subject to stringent equality constraints. Finally, as a specific application, the proposed RCGA is applied to optimize the GaAs film growth of a horizontal metal-organic chemical vapor deposition reactor. Simulation studies have confirmed the superior performance of the proposed RCGA in solving COPs. (C) 2015 Elsevier B.V. All rights reserved.
To select an adequate coding is one of the main problems in applications based on evolutionary algorithms. Many codings have been proposed to represent the search space for obtaining decision rules. A suitable represe...
详细信息
For any optimization algorithm tuning the parameters is necessary for effective and efficient optimization. We use a meta-level evolutionary algorithm for optimizing the effectiveness and efficiency of a load-balancin...
详细信息
暂无评论