Central Library

Computational Proximity (Record no. 80729)

000 -LEADER
fixed length control field 03985nam a22005175i 4500
001 - CONTROL NUMBER
control field 978-3-319-30262-1
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220801222412.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 160419s2016 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319302621
-- 978-3-319-30262-1
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Peters, James F.
245 10 - TITLE STATEMENT
Title Computational Proximity
Sub Title Excursions in the Topology of Digital Images /
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2016.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XXVIII, 433 p. 254 illus., 39 illus. in color.
490 1# - SERIES STATEMENT
Series statement Intelligent Systems Reference Library,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Computational Proximity -- Proximities Revisited -- Distance and Proximally Continuous.-Image Geometry and Nearness Expressions for Image and Scene Analysis -- Homotopic Maps, Shapes and Borsuk-Ulam Theorem -- Visibility, Hausdorffness, Algebra and Separation Spaces -- Strongly Near Sets and Overlapping Dirichlet Tessellation Regions -- Proximal Manifolds.-Watershed, Smirnov Measure, Fuzzy Proximity and Sorted Near Sets -- Strong Connectedness Revisited -- Helly’s Theorem and Strongly Proximal Helly Theorem -- Nerves and Strongly Near Nerves -- Connnectedness Patterns -- Nerve Patterns- Appendix A: Mathematica and Matlab Scripts -- Appendix B: Kuratowski Closure Axioms -- Appendix C: Sets. A Topological Perspective -- Appendix D: Basics of Proximities -- Appendix E: Set Theory Axioms, Operations and Symbols -- Appendix F: Topology of Digital Images.
520 ## - SUMMARY, ETC.
Summary, etc 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.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-319-30262-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2016.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1868-4408 ;
912 ## -
-- ZDB-2-ENG
912 ## -
-- ZDB-2-SXE

No items available.