東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Computational proximity = excursions...

Peters, James F.

Linked to FindBook

Google Book

Amazon

博客來

Computational proximity = excursions in the topology of digital images /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computational proximity/ by James F. Peters.
Reminder of title:	excursions in the topology of digital images /
Author:	Peters, James F.
Published:	Cham :Springer International Publishing : : 2016.,
Description:	xxviii, 433 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Image processing - Mathematics. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-30262-1
ISBN:	9783319302621

Computational proximity = excursions in the topology of digital images /
Peters, James F.

Computational proximityexcursions in the topology of digital images /[electronic resource] :by James F. Peters. - Cham :Springer International Publishing :2016. - xxviii, 433 p. :ill. (some col.), digital ;24 cm. - Intelligent systems reference library,v.1021868-4394 ;. - Intelligent systems reference library ;v.24..

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.

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.

ISBN: 9783319302621

Standard No.: 10.1007/978-3-319-30262-1doiSubjects--Topical Terms:

579707
Image processing
--Mathematics.

LC Class. No.: TA1637.5

Dewey Class. No.: 621.367

Computational proximity = excursions in the topology of digital images /
LDR:03128nmm a2200325 a 4500 001 2035857
003 DE-He213
005 20161012144455.0
006 m d
007 cr nn 008maaau
008 161117s2016 gw s 0 eng d
020 $a 9783319302621 $q (electronic bk.)
020 $a 9783319302607 $q (paper)
024 7 $a 10.1007/978-3-319-30262-1 $2 doi
035 $a 978-3-319-30262-1
040 $a GP $c GP
041 0 $a eng
050 4 $a TA1637.5
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 621.367 $2 23
090 $a TA1637.5 $b .P481 2016
100 1 $a Peters, James F. $3 653341
245 1 0 $a Computational proximity $h [electronic resource] : $b excursions in the topology of digital images / $c by James F. Peters.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xxviii, 433 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Intelligent systems reference library, $x 1868-4394 ; $v v.102
505 0 $a 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 $a 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.
650 0 $a Image processing $x Mathematics. $3 579707
650 0 $a Image analysis. $3 561018
650 1 4 $a Engineering. $3 586835
650 2 4 $a Computational Intelligence. $3 1001631
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Intelligent systems reference library ; $v v.24. $3 1566491
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-30262-1
950 $a Engineering (Springer-11647)