This book carries forward recent work on visual patterns and structures in digital images and introduces a near set-based a topology of digital images. Visual patterns arise naturally in digital images viewed as sets of non-abstract points endowed with some form of proximity (nearness) relation. Proximity relations make it possible to construct uniform topologies on the sets of points that constitute a digital image. In keeping with an interest in gaining an understanding of digital images themselves as a rich source of patterns, this book introduces the basics of digital images from a computer vision perspective. In parallel with a computer vision perspective on digital images, this book also introduces the basics of proximity spaces. Not only the traditional view of spatial proximity relations but also the more recent descriptive proximity relations are considered. The beauty of the descriptive proximity approach is that it is possible to discover visual set patterns among sets that are non-overlapping and non-adjacent spatially. By combining the spatial proximity and descriptive proximity approaches, the search for salient visual patterns in digital images is enriched, deepened and broadened. A generous provision of Matlab and Mathematica scripts are used in this book to lay bare the fabric and essential features of digital images for those who are interested in finding visual patterns in images. The combination of computer vision techniques and topological methods lead to a deep understanding of images.

Basic topological algorithms are the subject of this new book. It presents their underlying theory and discusses their applications.Due to the wide variety of topics treated in the seven chapters, no attempt has been made to standardize the notation and terminology used by the authors. Each chapter, however, is self-contained and can be read independently of the others. Some of the basic terminology and fundamental concepts of digital topology are reviewed in the appendix which also describes important areas of the field. A bibliography of over 360 references is also provided.The notations and terminologies used in this book will serve to introduce readers to the even wider variety that exists in the voluminous literature dealing with topological algorithms.

This book discusses the computational geometry, topology and physics of digital images and video frame sequences. This trio of computational approaches encompasses the study of shape complexes, optical vortex nerves and proximities embedded in triangulated video frames and single images, while computational geometry focuses on the geometric structures that infuse triangulated visual scenes. The book first addresses the topology of cellular complexes to provide a basis for an introductory study of the computational topology of visual scenes, exploring the fabric, shapes and structures typically found in visual scenes. The book then examines the inherent geometry and topology of visual scenes, and the fine structure of light and light caustics of visual scenes, which bring into play catastrophe theory and the appearance of light caustic folds and cusps. Following on from this, the book introduces optical vortex nerves in triangulated digital images. In this context, computational physics is synonymous with the study of the fine structure of light choreographed in video frames. This choreography appears as a sequence of snapshots of light reflected and refracted from surface shapes, providing a solid foundation for detecting, analyzing and classifying visual scene shapes.

The first book on digital geometry by the leaders in the field.

Compression, restoration and recognition are three of the key components of digital imaging. The mathematics needed to understand and carry out all these components are explained here in a style that is at once rigorous and practical with many worked examples, exercises with solutions, pseudocode, and sample calculations on images. The introduction lists fast tracks to special topics such as Principal Component Analysis, and ways into and through the book, which abounds with illustrations. The first part describes plane geometry and pattern-generating symmetries, along with some on 3D rotation and reflection matrices. Subsequent chapters cover vectors, matrices and probability. These are applied to simulation, Bayesian methods, Shannon's information theory, compression, filtering and tomography. The book will be suited for advanced courses or for self-study. It will appeal to all those working in biomedical imaging and diagnosis, computer graphics, machine vision, remote sensing, image processing and information theory and its applications.

Binary Digital Image Processing is aimed at faculty, postgraduate students and industry specialists. It is both a text reference and a textbook that reviews and analyses the research output in this field of binary image processing. It is aimed at both advanced researchers as well as educating the novice to this area. The theoretical part of this book includes the basic principles required for binary digital image analysis. The practical part which will take an algorithmic approach addresses problems which find applications beyond binary digital line image processing.The book first outlines the theoretical framework underpinning the study of digital image processing with particular reference to those needed for line image processing. The theoretical tools in the first part of the book set the stage for the second and third parts, where low-level binary image processing is addressed and then intermediate level processing of binary line images is studied. The book concludes with some practical applications of this work by reviewing some industrial and software applications (engineering drawing storage and primitive extraction, fingerprint compression). - Outlines the theoretical framework underpinning the study of digital image processing with particular reference to binary line image processing - Addresses low-level binary image processing, reviewing a number of essential characteristics of binary digital images and providing solution procedures and algorithms - Includes detailed reviews of topics in binary digital image processing with up-to-date research references in relation to each of the problems under study - Includes some practical applications of this work by reviewing some common applications - Covers a range of topics, organised by theoretical field rather than being driven by problem definitions

This book introduces computational proximity (CP) as an algorithmic approach to finding nonempty sets of points that are either close to each other or far apart. Typically in computational proximity, the book starts with some form of proximity space (topological space equipped with a proximity relation) that has an inherent geometry. In CP, two types of near sets are considered, namely, spatially near sets and descriptivelynear sets. It is shown that connectedness, boundedness, mesh nerves, convexity, shapes and shape theory are principal topics in the study of nearness and separation of physical aswell as abstract sets. CP has a hefty visual content. Applications of CP in computer vision, multimedia, brain activity, biology, social networks, and cosmology are included. The book has been derived from the lectures of the author in a graduate course on the topology of digital images taught over the past several years. Many of the students have provided important insights and valuable suggestions. The topics in this monograph introduce many forms of proximities with a computational flavour (especially, what has become known as the strong contact relation), many nuances of topological spaces, and point-free geometry.