A hands-on guide to image registration theory and methods—with examples of a wide range of real-world applications Theory and Applications of Image Registration offers comprehensive coverage of feature-based image registration methods. It provides in-depth exploration of an array of fundamental issues, including image orientation detection, similarity measures, feature extraction methods, and elastic transformation functions. Also covered are robust parameter estimation, validation methods, multi-temporal and multi-modality image registration, methods for determining the orientation of an image, methods for identifying locally unique neighborhoods in an image, methods for detecting lines in an image, methods for finding corresponding points and corresponding lines in images, registration of video images to create panoramas, and much more. Theory and Applications of Image Registration provides readers with a practical guide to the theory and underpinning principles. Throughout the book numerous real-world examples are given, illustrating how image registration can be applied to problems in various fields, including biomedicine, remote sensing, and computer vision. Also provided are software routines to help readers develop their image registration skills. Many of the algorithms described in the book have been implemented, and the software packages are made available to the readers of the book on a companion website. In addition, the book: Explores the fundamentals of image registration and provides a comprehensive look at its multi-disciplinary applications Reviews real-world applications of image registration in the fields of biomedical imaging, remote sensing, computer vision, and more Discusses methods in the registration of long videos in target tracking and 3-D reconstruction Addresses key research topics and explores potential solutions to a number of open problems in image registration Includes a companion website featuring fully implemented algorithms and image registration software for hands-on learning Theory and Applications of Image Registration is a valuable resource for researchers and professionals working in industry and government agencies where image registration techniques are routinely employed. It is also an excellent supplementary text for graduate students in computer science, electrical engineering, software engineering, and medical physics.

A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set families, and integer partitions. The book presents algorithmic proofs of theorems whenever possible. These proofs are written in the calculational style advocated by Dijkstra, with arguments explicitly spelled out step by step. The author’s intent is for readers to learn not only the proofs, but the heuristics that guide said proofs. Introduction to Lattice Theory with Computer Science Applications: Examines; posets, Dilworth’s theorem, merging algorithms, lattices, lattice completion, morphisms, modular and distributive lattices, slicing, interval orders, tractable posets, lattice enumeration algorithms, and dimension theory Provides end of chapter exercises to help readers retain newfound knowledge on each subject Includes supplementary material at www.ece.utexas.edu/~garg Introduction to Lattice Theory with Computer Science Applications is written for students of computer science, as well as practicing mathematicians.

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.

A presentation of real examples of industrial uses for formal methods such as SCADE, the B-Method, ControlBuild, Matelo, etc. in various fields, such as railways, aeronautics, and the automotive industry, the purpose of this book is to present a summary of experience on the use of these “formal methods” (such as proof and model-checking) in industrial examples of complex systems. It is based on the experience of people who are currently involved in the creation and evaluation of safety critical system software. The involvement of people from within the industry allows us to avoid the usual problems of confidentiality which could arise and thus enables us to supply new useful information (photos, architecture plans, real examples, etc.).

The design, implementation and validation of avionics and aeronautical systems have become extremely complex tasks due to the increase of functionalities that are deployed in current avionics systems and the need to be able certify them before putting them into production. This book proposes a methodology to enable the rapid prototyping of such a system by considering from the start the certification aspects of the solution produced. This method takes advantage of the model-based design approaches as well as the use of formal methods for the validation of these systems. Furthermore, the use of automatic software code generation tools using models makes it possible to reduce the development phase as well as the final solution testing. This book presents, firstly, an overview of the model-based design approaches such as those used in the field of aeronautical software engineering. Secondly, an original methodology that is perfectly adapted to the field of aeronautical embedded systems is introduced. Finally, the authors illustrate the use of this method using a case study for the design, implementation and testing of a new generation aeronautical router.

A comprehensive exploration of the mathematics behind the modeling and rendering of computer graphics scenes Mathematical Structures for Computer Graphics presents an accessible and intuitive approach to the mathematical ideas and techniques necessary for two- and three-dimensional computer graphics. Focusing on the significant mathematical results, the book establishes key algorithms used to build complex graphics scenes. Written for readers with various levels of mathematical background, the book develops a solid foundation for graphics techniques and fills in relevant graphics details often overlooked in the literature. Rather than use a rigid theorem/proof approach, the book provides a flexible discussion that moves from vector geometry through transformations, curve modeling, visibility, and lighting models. Mathematical Structures for Computer Graphics also includes: Numerous examples of two- and three-dimensional techniques along with numerical calculations Plenty of mathematical and programming exercises in each chapter, which are designed particularly for graphics tasks Additional details at the end of each chapter covering historical notes, further calculations, and connected concepts for readers who wish to delve deeper Unique coverage of topics such as calculations with homogeneous coordinates, computational geometry for polygons, use of barycentric coordinates, various descriptions for curves, and L-system techniques for recursive images Mathematical Structures for Computer Graphics is an excellent textbook for undergraduate courses in computer science, mathematics, and engineering, as well as an ideal reference for practicing engineers, researchers, and professionals in computer graphics fields. The book is also useful for those readers who wish to understand algorithms for producing their own interesting computer images.

The second edition of this accepted reference work has been updated to reflect the rapid developments in the field and now covers both 2D and 3D imaging. Written by expert practitioners from leading companies operating in machine vision, this one-stop handbook guides readers through all aspects of image acquisition and image processing, including optics, electronics and software. The authors approach the subject in terms of industrial applications, elucidating such topics as illumination and camera calibration. Initial chapters concentrate on the latest hardware aspects, ranging from lenses and camera systems to camera-computer interfaces, with the software necessary discussed to an equal depth in later sections. These include digital image basics as well as image analysis and image processing. The book concludes with extended coverage of industrial applications in optics and electronics, backed by case studies and design strategies for the conception of complete machine vision systems. As a result, readers are not only able to understand the latest systems, but also to plan and evaluate this technology. With more than 500 images and tables to illustrate relevant principles and steps.

A comprehensive new edition on mobile computing—covering both mobile and sensor data The new paradigm of pervasive computing was born from the needs of highly mobile workers to access and transfer data while on the go. Significant advances in the technology have lent and will continue to lend prevalence to its use—especially in m-commerce. Covering both mobile data and sensor data, this comprehensive text offers updated research on sensor technology, data stream processing, mobile database security, and contextual processing. Packed with cases studies, exercises, and examples, Fundamentals of Pervasive Information Management Systems covers essential aspects of wireless communication and provides a thorough discussion about managing information on mobile database systems (MDS). It addresses the integration of web and workflow with mobile computing and looks at the current state of research. Fundamentals of Pervasive Information Management Systems presents chapters on: Mobile Database System Mobile and Wireless Communication Location and Handoff Management Fundamentals of Database Processing Introduction to Concurrency Control Mechanisms Effect of Mobility on Data Processing Transaction Management in Mobile Database Systems Mobile Database Recovery Wireless Information Dissemination Introduction to Sensor Technology Sensor Technology and Data Streams Management Sensor Network Deployment: Case Studies Fundamentals of Pervasive Information Management Systems is an ideal book for researchers, teachers, and graduate students of mobile computing. The book may also be used as a reference text for researchers or managers.

System virtualization has become increasingly common in distributed systems because of its functionality and convenience for the owners and users of these infrastructures. In Scheduling of Large-scale Virtualized Infrastructures, author Flavien Quesnel examines the management of large-scale virtual infrastructures with an emphasis on scheduling up to 80,000 virtual machines on 8,000 nodes. The text fills a need for updated software managing to meet the increasing size of virtual infrastructures. Virtual machine managers and virtual operators will appreciate this guide to improvement in cooperative software management.

DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to “Min-domain Retroactive Ordering for Asynchronous Backtracking” 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Morocco in 2012 and his research focused on Distributed Constraint Reasoning.