Computational Proximity Excursions in the 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 relat...
| Κύριος συγγραφέας: | |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
| Σειρά: | Intelligent Systems Reference Library,
102 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
