Ebook: Evolutionary Computation in Dynamic and Uncertain Environments
- Genre: Mathematics // Graph Theory
- Tags: Appl.Mathematics/Computational Methods of Engineering, Computational Intelligence, Artificial Intelligence (incl. Robotics), Statistics for Engineering Physics Computer Science Chemistry and Earth Sciences
- Series: Studies in Computational Intelligence 51
- Year: 2007
- Publisher: Springer-Verlag Berlin Heidelberg
- City: Berlin; New York
- Edition: 1
- Language: English
- pdf
This book provides a compilation on the state-of-the-art and recent advances of evolutionary algorithms in dynamic and uncertain environments within a unified framework. The motivation for this book arises from the fact that some degree of uncertainty in characterizing any realistic engineering systems is inevitable. Representative methods for addressing major sources of uncertainties in evolutionary computation, including handle of noisy fitness functions, use of approximate fitness functions, search for robust solutions, and tracking moving optimums, are presented. "Evolutionary Computation in Dynamic and Uncertain Environments" is a valuable reference for scientists, researchers, professionals and students in the field of engineering and science, particularly in the areas of computational intelligence, natural computing and evolutionary computation.
This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.