Portada

Computational Proximity

SPRINGER
04 / 2016
9783319302607
Inglés
Intelligent Systems Reference Library
Ingles

Sinopsis

This book introduces computational proximity (CP) as an algorithmic approachnbsp;to finding nonempty sets of points thatnbsp;are either close to each other or far apart.nbsp;Typically in computational proximity, the booknbsp;starts with some form of proximity space (topological space equipped with anbsp;proximity relation) that has an inherent geometry. In CP,nbsp;two types of near setsnbsp;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.nbsp;The book has been derived from the lectures of the author in a graduate course on thenbsp;topology of digital images taught over the past several years. Many of thenbsp;students have provided important insights and valuable suggestions.nbsp;The topics in this monograph introduce many forms of proximities with anbsp;computational flavour (especially, what has become known as the strong contactnbsp;relation), many nuances of topological spaces, and point-free geometry.

PVP
103,99€