國立虎尾科技大學 |

Computational Proximity = Excursions in the Topology of Digital Images /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computational Proximity/ by James F. Peters.
其他題名:	Excursions in the Topology of Digital Images /
作者:	Peters, James F.
面頁冊數:	XXVIII, 433 p. 254 illus., 39 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational intelligence. -
電子資源:	https://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. - 1st ed. 2016. - XXVIII, 433 p. 254 illus., 39 illus. in color.online resource. - Intelligent Systems Reference Library,1021868-4394 ;. - Intelligent Systems Reference Library,67.

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:

568984
Computational intelligence.

LC Class. No.: Q342

Dewey Class. No.: 006.3

Computational Proximity = Excursions in the Topology of Digital Images /
LDR:03516nam a22004095i 4500 001 980816
003 DE-He213
005 20200705010842.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319302621 $9 978-3-319-30262-1
024 7 $a 10.1007/978-3-319-30262-1 $2 doi
035 $a 978-3-319-30262-1
050 4 $a Q342
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Peters, James F. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 674988
245 1 0 $a Computational Proximity $h [electronic resource] : $b Excursions in the Topology of Digital Images / $c by James F. Peters.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XXVIII, 433 p. 254 illus., 39 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Intelligent Systems Reference Library, $x 1868-4394 ; $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 Computational intelligence. $3 568984
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Computational Intelligence. $3 768837
650 2 4 $a Artificial Intelligence. $3 646849
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319302607
776 0 8 $i Printed edition: $z 9783319302614
776 0 8 $i Printed edition: $z 9783319807645
830 0 $a Intelligent Systems Reference Library, $x 1868-4394 ; $v 67 $3 1253823
856 4 0 $u https://doi.org/10.1007/978-3-319-30262-1
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)