دانلود کتاب Topographical Tools for Filtering and Segmentation: Watersheds on Node- or Edge-Weighted Graphs

فهرست مطالب :

Content: Cover
Half-Title Page
Title Page
Copyright Page
Table of Contents
Notations
Introduction
General organization
Outline of volume 1
Outline of volume 2
Conclusion
PART 1: Getting Started
1. A Primer to Flooding, Razing and Watersheds
1.1. Topographic reliefs and topographic features
1.1.1. Images seen as topographic reliefs and inversely
1.1.2. Topographic features
1.1.3. Modeling a topographic relief as a weighted graph
1.2. Flooding, razing and morphological filters
1.2.1. The principle of duality
1.2.2. Dominated flooding and razing 1.2.3. Flooding, razing and catchment zones of a topographic relief1.3. Catchment zones of flooded surfaces
1.3.1. Filtering and segmenting
1.3.2. Reducing the oversegmentation with markers
1.4. The waterfall hierarchy
1.4.1. Overflows between catchment basins
1.5. Size-driven hierarchies
1.6. Separating overlapping particles in n dimensions
1.7. Catchment zones and lakes of region neighborhood graphs
1.8. Conclusion
2. Watersheds and Flooding: a Segmentation Golden Braid
2.1. Watersheds, offsprings and parallel branches
2.2. Flooding and connected operators 2.3. Connected operators and hierarchies2.4. Hierarchical segmentation: extinction values
3. Mathematical Notions
3.1. Summary of the chapter
3.2. Complete lattices
3.2.1. Partial order and partially ordered sets
3.2.2. Upper and lower bounds
3.2.3. Complete lattices
3.2.4. Dyadic relations on a complete lattice
3.3. Operators between complete lattices
3.3.1. Definition of an operator
3.3.2. Properties of the operators
3.3.3. Erosion and dilation
3.3.4. Opening and closing
3.4. The adjunction: a cornerstone of mathematical morphology
3.4.1. Adjoint erosions and dilations 3.4.2. Increasingness3.4.3. Unicity
3.4.4. Composition
3.4.5. Dual operators
3.5. Openings and closings
3.5.1. Definitions
3.5.2. Elements with the same erosion or the same dilation
3.5.3. The invariants of an opening or a closing
3.6. Complete lattices of functions
3.6.1. Definitions
3.6.2. Infimum and supremum
PART 2: The Topography of Weighted Graphs
4. Weighted Graphs
4.1. Summary of the chapter
4.2. Reminders on graphs
4.2.1. Directed and undirected graphs
4.3. Weight distributions on the nodes or edges of a graph
4.3.1. Duality 4.3.2. Erosions and dilations, openings, closings4.3.3. Labels
4.4. Exploring the topography of graphs by following a drop of water
4.5. Node-weighted graphs
4.5.1. Flat zones and regional minima
4.5.2. Flowing paths and catchment zones
4.6. Edge-weighted graphs
4.6.1. Flat zones and regional minima
4.6.2. Flowing paths and catchment zones
4.6.3. Even zones and regional minima
4.7. Comparing the topography of node-weighted graphs and edge-weighted graphs
5. Flowing Graphs
5.1. Summary of the chapter
5.2. Towards a convergence between node-and edge-weighted graphs