Abstract: 3D model-based vehicle matching provides a new way
for vehicle recognition, localization and tracking. Its key is to
construct an evaluation function, also called fitness function, to
measure the degree of vehicle matching. The existing fitness functions
often poorly perform when the clutter and occlusion exist in traffic
scenarios. In this paper, we present a practical and efficient fitness
function. Unlike the existing evaluation functions, the proposed
fitness function is to study the vehicle matching problem from
both local and global perspectives, which exploits the pixel gradient
information as well as the silhouette information. In view of the
discrepancy between 3D vehicle model and real vehicle, a weighting
strategy is introduced to differently treat the fitting of the model’s
wireframes. Additionally, a normalization operation for the model’s
projection is performed to improve the accuracy of the matching.
Experimental results on real traffic videos reveal that the proposed
fitness function is efficient and robust to the cluttered background
and partial occlusion.
Abstract: In this paper a genetic algorithm (GA) with dual-fitness function is proposed and applied to solve the deterministic identical machine scheduling problem. The mating fitness function value was used to determine the mating for chromosomes, while the selection fitness function value was used to determine their survivals. The performance of this algorithm was tested on deterministic identical machine scheduling using simulated data. The results obtained from the proposed GA were compared with classical GA and integer programming (IP). Results showed that dual-fitness function GA outperformed the classical single-fitness function GA with statistical significance for large problems and was competitive to IP, particularly when large size problems were used.
Abstract: Edge detection is usually the first step in medical
image processing. However, the difficulty increases when a
conventional kernel-based edge detector is applied to ultrasonic
images with a textural pattern and speckle noise. We designed an
adaptive diffusion filter to remove speckle noise while preserving the
initial edges detected by using a Sobel edge detector. We also propose
a genetic algorithm for edge selection to form complete boundaries of
the detected entities. We designed two fitness functions to evaluate
whether a criterion with a complex edge configuration can render a
better result than a simple criterion such as the strength of gradient.
The edges obtained by using a complex fitness function are thicker and
more fragmented than those obtained by using a simple fitness
function, suggesting that a complex edge selecting scheme is not
necessary for good edge detection in medical ultrasonic images;
instead, a proper noise-smoothing filter is the key.
Abstract: The efficient use of available licensed spectrum is
becoming more and more critical with increasing demand and usage
of the radio spectrum. This paper shows how the use of spectrum as
well as dynamic spectrum management can be effectively managed
and spectrum allocation schemes in the wireless communication
systems be implemented and used, in future. This paper would be an
attempt towards better utilization of the spectrum. This research will
focus on the decision-making process mainly, with an
assumption that the radio environment has already been sensed and
the QoS requirements for the application have been specified either
by the sensed radio environment or by the secondary user itself. We
identify and study the characteristic parameters of Cognitive Radio
and use Genetic Algorithm for spectrum allocation. Performance
evaluation is done using MATLAB toolboxes.
Abstract: In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge faster towards the optimal solution of a problem. This new genetic operator is called ''intuition'' operator. Generally speaking, one can claim that this operator is a way to include any heuristic or any other local knowledge, concerning the problem, that cannot be embedded in the fitness function. Simulation results show that the use of this operator increases significantly the performance of the classic Genetic Algorithm by increasing the convergence speed of its population.
Abstract: This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution.
Abstract: Evolutionary Algorithms are population-based,
stochastic search techniques, widely used as efficient global
optimizers. However, many real life optimization problems often
require finding optimal solution to complex high dimensional,
multimodal problems involving computationally very expensive
fitness function evaluations. Use of evolutionary algorithms in such
problem domains is thus practically prohibitive. An attractive
alternative is to build meta models or use an approximation of the
actual fitness functions to be evaluated. These meta models are order
of magnitude cheaper to evaluate compared to the actual function
evaluation. Many regression and interpolation tools are available to
build such meta models. This paper briefly discusses the
architectures and use of such meta-modeling tools in an evolutionary
optimization context. We further present two evolutionary algorithm
frameworks which involve use of meta models for fitness function
evaluation. The first framework, namely the Dynamic Approximate
Fitness based Hybrid EA (DAFHEA) model [14] reduces
computation time by controlled use of meta-models (in this case
approximate model generated by Support Vector Machine
regression) to partially replace the actual function evaluation by
approximate function evaluation. However, the underlying
assumption in DAFHEA is that the training samples for the metamodel
are generated from a single uniform model. This does not take
into account uncertain scenarios involving noisy fitness functions.
The second model, DAFHEA-II, an enhanced version of the original
DAFHEA framework, incorporates a multiple-model based learning
approach for the support vector machine approximator to handle
noisy functions [15]. Empirical results obtained by evaluating the
frameworks using several benchmark functions demonstrate their
efficiency