Applied Graph Theory in Computer Vision and Pattern Recognition

This book deals with the analysis of the structure of complex networks by combining results from graph theory, physics, and pattern recognition. The book is divided into two parts. 11 chapters are ded

Introduction to Theory of Control in Organizations explains how methodologies from systems analysis and control theory, including game and graph theory, can be applied to improve organizational manage

In many computer vision applications, objects have to be learned and recognized in images or image sequences. This book presents new probabilistic hierarchical models that allow an efficient represent

The theory of optimal transportation has its origins in the eighteenth century when the problem of transporting resources at a minimal cost was first formalised. Through subsequent developments, particularly in recent decades, it has become a powerful modern theory. This book contains the proceedings of the summer school 'Optimal Transportation: Theory and Applications' held at the Fourier Institute in Grenoble. The event brought together mathematicians from pure and applied mathematics, astrophysics, economics and computer science. Part I of this book is devoted to introductory lecture notes accessible to graduate students, while Part II contains research papers. Together, they represent a valuable resource on both fundamental and advanced aspects of optimal transportation, its applications, and its interactions with analysis, geometry, PDE and probability, urban planning and economics. Topics covered include Ricci flow, the Euler equations, functional inequalities, curvature-dimensio

Written in a unique style, this book is a valuable resource for faculty, graduate students, and researchers in the communications and networking area whose work interfaces with optimization. It teaches you how various optimization methods can be applied to solve complex problems in wireless networks. Each chapter reviews a specific optimization method and then demonstrates how to apply the theory in practice through a detailed case study taken from state-of-the-art research. You will learn various tips and step-by-step instructions for developing optimization models, reformulations, and transformations, particularly in the context of cross-layer optimization problems in wireless networks involving flow routing (network layer), scheduling (link layer), and power control (physical layer). Throughout, a combination of techniques from both operations research and computer science disciplines provides a holistic treatment of optimization methods and their applications. Each chapter includes

Computer-Aided Control Systems Design: Practical Applications Using MATLABR and SimulinkR supplies a solid foundation in applied control to help you bridge the gap between control theory and its real-

Compressed sensing is an exciting, rapidly growing field, attracting considerable attention in electrical engineering, applied mathematics, statistics and computer science. This book provides the first detailed introduction to the subject, highlighting theoretical advances and a range of applications, as well as outlining numerous remaining research challenges. After a thorough review of the basic theory, many cutting-edge techniques are presented, including advanced signal modeling, sub-Nyquist sampling of analog signals, non-asymptotic analysis of random matrices, adaptive sensing, greedy algorithms and use of graphical models. All chapters are written by leading researchers in the field, and consistent style and notation are utilized throughout. Key background information and clear definitions make this an ideal resource for researchers, graduate students and practitioners wanting to join this exciting research area. It can also serve as a supplementary textbook for courses on compu

An understanding of the senses - vision, hearing, touch, chemical and other non-human senses - is important not only for many fields of biology but also in applied areas such as human-computer interaction, robotics and computer games. Using information theory as a unifying framework, this is a wide-ranging survey of sensory systems, covering all known senses. The book draws on three unifying principles to examine senses: the Nyquist sampling theorem, Shannon's information theory, and the creation of different streams of information to subserve different tasks. This framework is used to discuss the fascinating role of sensory adaptation in the context of environment and lifestyle. Providing a fundamental grounding in sensory perception, the book then demonstrates how this knowledge can be applied to the design of human-computer interfaces and virtual environments. It is an ideal resource for both graduate and undergraduate students of biology, engineering (robotics) and computer science

This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.

Support Vector Machines (SVMs) are among the most important recent developments in pattern recognition and statistical machine learning. They have found a great range of applications in various fields

This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.

The Stanford Geostatistical Modeling Software (SGeMS) is an open-source computer package for solving problems involving spatially related variables. It provides geostatistics practitioners with a user-friendly interface, an interactive 3-D visualization, and a wide selection of algorithms. This practical book provides a step-by-step guide to using SGeMS algorithms. It explains the underlying theory, demonstrates their implementation, discusses their potential limitations, and helps the user make an informed decision about the choice of one algorithm over another. Users can complete complex tasks using the embedded scripting language, and new algorithms can be developed and integrated through the SGeMS plug-in mechanism. SGeMS was the first software to provide algorithms for multiple-point statistics, and the book presents a discussion of the corresponding theory and applications. Incorporating the full SGeMS software (now available from www.cambridge.org/9781107403246), this book is a

Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.

This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operat

This textbook is intended to serve as a one-semester introductory course in number theory and in this second edition it has been revised throughout and many new exercises have been added. Historical perspective is included and emphasis is given to some of the subject's applied aspects; in particular the field of cryptography is highlighted. At the heart of the book are the major number theoretic accomplishments of Euclid, Fermat, Gauss, Legendre, and Euler, and to fully illustrate the properties of numbers and concepts developed in the text, a wealth of exercises have been included. It is assumed that the reader will have 'pencil in hand' and ready access to a calculator or computer. For students new to number theory, whatever their background, this is a stimulating and entertaining introduction to the subject.

This textbook is intended to serve as a one-semester introductory course in number theory and in this second edition it has been revised throughout and many new exercises have been added. Historical perspective is included and emphasis is given to some of the subject's applied aspects; in particular the field of cryptography is highlighted. At the heart of the book are the major number theoretic accomplishments of Euclid, Fermat, Gauss, Legendre, and Euler, and to fully illustrate the properties of numbers and concepts developed in the text, a wealth of exercises have been included. It is assumed that the reader will have 'pencil in hand' and ready access to a calculator or computer. For students new to number theory, whatever their background, this is a stimulating and entertaining introduction to the subject.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

Combining fractal theory with computer art, this book introduces a creative use of computers. It describes graphic methods for detecting patterns in complicated data and illustrates simple techniques

With applications in pattern recognition, data compression and numerical analysis, the wavelet transform is a key area of modern mathematics that brings new approaches to the analysis and synthesis of

Interest in computer applications has led to a new attitude to applied logic in which researchers tailor a logic in the same way they define a computer language. In response to this attitude, this tex

In a simple and accessible way it extends embedding field theory into areas of machine intelligence that have not been clearly dealt with before. Neural Networks for Pattern Recognition takes the pion

This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

This self-contained book introduces readers to discrete harmonic analysis with an emphasis on the Discrete Fourier Transform and the Fast Fourier Transform on finite groups and finite fields, as well as their noncommutative versions. It also features applications to number theory, graph theory, and representation theory of finite groups. Beginning with elementary material on algebra and number theory, the book then delves into advanced topics from the frontiers of current research, including spectral analysis of the DFT, spectral graph theory and expanders, representation theory of finite groups and multiplicity-free triples, Tao's uncertainty principle for cyclic groups, harmonic analysis on GL(2,Fq), and applications of the Heisenberg group to DFT and FFT. With numerous examples, figures, and over 160 exercises to aid understanding, this book will be a valuable reference for graduate students and researchers in mathematics, engineering, and computer science.

"This book discusses some of the limitations inherent in computer systems when applied to problems of probabilistic analysis, and presents a novel solution to these limitations, combining higher-order

Motivated by a variational model concerning the depth of the objects in a picture and the problem of hidden and illusory contours, this book investigates one of the central problems of computer vision

Originally published in 2005, Information Theory, Evolution and the Origin of Life presents an introduction to the use of information theory and coding theory in molecular biology. The genetical information system, because it is linear and digital, resembles the algorithmic language of computers. George Gamow pointed out that the application of Shannon's information theory breaks genetics and molecular biology out of the descriptive mode into the quantitative mode and Dr Yockey develops this theme, discussing how information theory and coding theory can be applied to molecular biology. He discusses how these tools for measuring the information in the sequences of the genome and the proteome are essential for our complete understanding of the nature and origin of life. The author writes for the computer competent reader who is interested in evolution and the origins of life.

Graphs are as commonplace now in the biological and social sciences as in computer science and engineering. For students who have taken introductory courses in graph theory and algebra, Imrich (Montan

Image processing is concerned with the analysis and manipulation of images by computer. Providing a thorough treatment of image processing with an emphasis on those aspects most used in computer graph

Recent years have seen dramatic progress in shape recognition algorithms applied to ever-growing image databases. They have been applied to image stitching, stereo vision, image mosaics, solid object

Markov chains are an important idea, related to random walks, which crops up widely in applied stochastic analysis. They are used, for example, in performance modelling and evaluation of computer networks, queuing networks, and telecommunication systems. The main point of the present book is to provide methods, based on the construction of Lyapunov functions, of determining when a Markov chain is ergodic, null recurrent, or transient. These methods can also be extended to the study of questions of stability. Of particular concern are reflected random walks and reflected Brownian motion. The authors provide not only a self-contained introduction to the theory but also details of how the required Lyapunov functions are constructed in various situations.

Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, avai

This richly illustrated book introduces the reader to a newly developed theory in Computer Vision yielding elementary techniques to analyze digital images. These techniques are inspired by, and are a

This classic work continues to offer a comprehensive treatment of the theory of univariate and tensor-product splines. It will be of interest to researchers and students working in applied analysis, numerical analysis, computer science, and engineering. The material covered provides the reader with the necessary tools for understanding the many applications of splines in such diverse areas as approximation theory, computer-aided geometric design, curve and surface design and fitting, image processing, numerical solution of differential equations, and increasingly in business and the biosciences. This new edition includes a supplement outlining some of the major advances in the theory since 1981, and some 250 new references. It can be used as the main or supplementary text for courses in splines, approximation theory or numerical analysis.

The last several decades have demonstrated dramatic technological changes that influence work conditions in all applied domains, including manufacturing, transportation, and human-computer interaction

Error-correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems. This 2006 book introduces the reader to the theoretical foundations of error-correcting codes, with an emphasis on Reed-Solomon codes and their derivative codes. After reviewing linear codes and finite fields, the author describes Reed-Solomon codes and various decoding algorithms. Cyclic codes are presented, as are MDS codes, graph codes, and codes in the Lee metric. Concatenated, trellis, and convolutional codes are also discussed in detail. Homework exercises introduce additional concepts such as Reed-Muller codes, and burst error correction. The end-of-chapter notes often deal with algorithmic issues, such as the time complexity of computational problems. While mathematical rigor is maintained, the text is designed to be accessible to a broad readership, including students of computer science, electrical engineering, and

Robot motion planning has become a major focus of robotics. Research findings can be applied not only to robotics but to planning routes on circuit boards, directing digital actors in computer graphi

Originally published in 2005, Information Theory, Evolution and the Origin of Life presents an introduction to the use of information theory and coding theory in molecular biology. The genetical information system, because it is linear and digital, resembles the algorithmic language of computers. George Gamow pointed out that the application of Shannon's information theory breaks genetics and molecular biology out of the descriptive mode into the quantitative mode and Dr Yockey develops this theme, discussing how information theory and coding theory can be applied to molecular biology. He discusses how these tools for measuring the information in the sequences of the genome and the proteome are essential for our complete understanding of the nature and origin of life. The author writes for the computer competent reader who is interested in evolution and the origins of life.