Picture Languages

Author: Azriel Rosenfeld
Publisher: Academic Press
ISBN: 1483268551
Format: PDF, Kindle
Download Now
Computer Science and Applied Mathematics: Picture Languages: Formal Models for Picture Recognition treats pictorial pattern recognition from the formal standpoint of automata theory. This book emphasizes the capabilities and relative efficiencies of two types of automata—array automata and cellular array automata, with respect to various array recognition tasks. The array automata are simple processors that perform sequences of operations on arrays, while the cellular array automata are arrays of processors that operate on pictures in a highly parallel fashion, one processor per picture element. This compilation also reviews a collection of results on two-dimensional sequential and parallel array acceptors. Some of the analogous one-dimensional results and array grammars and their relation to acceptors are likewise covered in this text. This publication is suitable for researchers, professionals, and specialists interested in pattern recognition and automata theory.

Probability Statistics and Queueing Theory

Author: Arnold O. Allen
Publisher: Academic Press
ISBN: 1483266591
Format: PDF, ePub
Download Now
Probability, Statistics, and Queueing Theory: With Computer Science Applications focuses on the use of statistics and queueing theory for the design and analysis of data communication systems, emphasizing how the theorems and theory can be used to solve practical computer science problems. This book is divided into three parts. The first part discusses the basic concept of probability, probability distributions commonly used in applied probability, and important concept of a stochastic process. Part II covers the discipline of queueing theory, while Part III deals with statistical inference. This publication is designed as a junior-senior level textbook on applied probability and statistics with computer science applications, but is also a self-study book for practicing computer science (data processing) professionals.

Algorithm Structured Computer Arrays and Networks

Author: Leonard Uhr
Publisher: Academic Press
ISBN: 1483267059
Format: PDF, ePub, Mobi
Download Now
Computer Science and Applied Mathematics: Algorithm-Structured Computer Arrays and Networks: Architectures and Processes for Images, Percepts, Models, Information examines the parallel-array, pipeline, and other network multi-computers. This book describes and explores arrays and networks, those built, being designed, or proposed. The problems of developing higher-level languages for systems and designing algorithm, program, data flow, and computer structure are also discussed. This text likewise describes several sequences of successively more general attempts to combine the power of arrays with the flexibility of networks into structures that reflect and embody the flow of information through their processors. This publication is useful as a textbook or auxiliary textbook for students taking courses on computer architecture, parallel computers, arrays and networks, and image processing and pattern recognition.

Computability Complexity and Languages

Author: Martin D. Davis
Publisher: Academic Press
ISBN: 1483264580
Format: PDF, ePub
Download Now
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students.

Discrete Representation of Spatial Objects in Computer Vision

Author: L.J. Latecki
Publisher: Springer Science & Business Media
ISBN: 9401590028
Format: PDF, ePub, Docs
Download Now
One of the most natural representations for modelling spatial objects in computers is discrete representations in the form of a 2D square raster and a 3D cubic grid, since these are naturally obtained by segmenting sensor images. However, the main difficulty is that discrete representations are only approximations of the original objects, and can only be as accurate as the cell size allows. If digitisation is done by real sensor devices, then there is the additional difficulty of sensor distortion. To overcome this, digital shape features must be used that abstract from the inaccuracies of digital representation. In order to ensure the correspondence of continuous and digital features, it is necessary to relate shape features of the underlying continuous objects and to determine the necessary resolution of the digital representation. This volume gives an overview and a classification of the actual approaches to describe the relation between continuous and discrete shape features that are based on digital geometric concepts of discrete structures. Audience: This book will be of interest to researchers and graduate students whose work involves computer vision, image processing, knowledge representation or representation of spatial objects.