Cargando…
Topographical Tools for Filtering and Segmentation 2 : Flooding and Marker-Based Segmentation on Node- or Edge-weighted Graphs.
Mathematical morphology has developed a powerful methodology for segmenting images, based on connected filters and watersheds. We have chosen the abstract framework of node- or edge-weighted graphs for an extensive mathematical and algorithmic description of these tools. Volume 2 proposes two physic...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Newark :
John Wiley & Sons, Incorporated,
2019.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_on1084435128 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 190202s2019 nju o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d COO |d OCLCQ |d LVT |d OCLCQ |d SFB |d OCLCF |d REDDC |d K6U |d LUN |d OCLCO |d OCLCQ |d OCLCO | ||
| 066 | |c (S | ||
| 019 | |a 1117835740 |a 1125800984 |a 1136378267 |a 1167819346 |a 1229707376 | ||
| 020 | |a 9781119575153 | ||
| 020 | |a 111957515X | ||
| 020 | |a 9781119575122 |q (online) | ||
| 020 | |a 1119575125 | ||
| 020 | |a 9781786304070 | ||
| 020 | |a 1786304074 | ||
| 020 | |a 1119575133 | ||
| 020 | |a 9781119575139 | ||
| 029 | 1 | |a AU@ |b 000065043646 | |
| 029 | 1 | |a AU@ |b 000067383260 | |
| 035 | |a (OCoLC)1084435128 |z (OCoLC)1117835740 |z (OCoLC)1125800984 |z (OCoLC)1136378267 |z (OCoLC)1167819346 |z (OCoLC)1229707376 | ||
| 050 | 4 | |a G9901.C18 1970 |b .M494 2019 | |
| 082 | 0 | 4 | |a 551.4 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Meyer, Fernand. | |
| 245 | 1 | 0 | |a Topographical Tools for Filtering and Segmentation 2 : |b Flooding and Marker-Based Segmentation on Node- or Edge-weighted Graphs. |
| 260 | |a Newark : |b John Wiley & Sons, Incorporated, |c 2019. | ||
| 300 | |a 1 online resource (289 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover; Half-Title Page; Title Page; Copyright Page; Table of Contents; Notations; Volume 1; Mathematical notions; Weighted graphs; Flowing graphs; The topography of digraphs; Measuring the steepness of flowing paths; Pruning a flow digraph; Constructing an ∞−steep digraph by flooding; Creating steep watershed partitions; An historical intermezzo; Encoding the digraph associated with an image; Volume 2; Modeling flooding; Lakes and regional minima; Among all flooding, choosing one; Flooding and flooding distances; Graph flooding via dendrograms | |
| 505 | 8 | |a Minimum spanning forests and watershed partitionsMarker-based segmentation; Introduction; General organization; Outline of volume 1; Part 1. Getting started; Part 2. The topography of weighted graphs; Part 3. Reducing the overlapping of catchment zones; Part 4. Segmenting with dead leaves partitions; Outline of volume 2; Part 1. Flooding; Part 2. Modeling a real hydrographic basin; Part 3. Watershed partitions; Conclusion; PART 1: Flooding; 1. Modelling Flooding in Edge or Node-weighted Graphs; 1.1. Summary of the chapter; 1.2. The importance of flooding; 1.2.1. Flooding creates lakes | |
| 505 | 8 | |a 1.2.2. Flooding for controlling watershed segmentation1.2.3. Flooding, razing, leveling and flattening; 1.3. Description of the flood covering a topographic surface; 1.3.1. Observing the same flooding on two levels of abstraction; 1.3.2. Modeling the two scales of flooding: at the pixel level or at the region level; 1.3.3. Modeling a flooded topographic surface as a node-weighted graph; 1.3.4. Modeling an edge-weighted graph as a tank network; 1.4. The relations between n-floodings and e-floodings; 1.4.1. Modeling the flooding on two scales: equivalence of both models | |
| 500 | |a 3.4. Computing dominated flooding by local adjustments | ||
| 520 | |a Mathematical morphology has developed a powerful methodology for segmenting images, based on connected filters and watersheds. We have chosen the abstract framework of node- or edge-weighted graphs for an extensive mathematical and algorithmic description of these tools. Volume 2 proposes two physical models for describing valid flooding on a node- or edge-weighted graph, and establishes how to pass from one to another. Many new flooding algorithms are derived, allowing parallel and local flooding of graphs. Watersheds and flooding are then combined for solving real problems. Their ability to model a real hydrographic basin represented by its digital elevation model constitutes a good validity check of the underlying physical models. The last part of Volume 2 explains why so many different watershed partitions exist for the same graph. Marker-based segmentation is the method of choice for curbing this proliferation. This book proposes new algorithms combining the advantages of the previous methods which treated node- and edge-weighted graphs differently. ' | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Relief models. | |
| 650 | 0 | |a Topographical drawing. | |
| 650 | 6 | |a Modèles en relief. | |
| 650 | 6 | |a Dessin topographique. | |
| 650 | 7 | |a Relief models |2 fast | |
| 650 | 7 | |a Topographical drawing |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Meyer, Fernand. |t Topographical Tools for Filtering and Segmentation 2 : Flooding and Marker-Based Segmentation on Node- or Edge-weighted Graphs. |d Newark : John Wiley & Sons, Incorporated, ©2019 |z 9781786304070 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5649339 |z Texto completo |
| 880 | 8 | |6 505-00/(S |a 1.5. Flooding a flowing graph1.5.1. Flowing graphs: reminder; 1.5.2. Starting from an edge-weighted graph G[nil, η]; 1.5.3. Starting from a node-weighted graph G[ν, nil]; 1.5.4. Summarizing; 2. Lakes and Regional Minima; 2.1. Summary of the chapter; 2.2. Lakes from e-floodings and n-floodings; 2.2.1. e-floodings of graphs G[nil, η]; 2.2.2. n-floodings of graphs G[ν, nil]; 2.3. Regional minimum lakes and full lakes; 2.3.1. e-floodings of graphs G[nil, η]; 2.3.2. n-floodings of graphs G[ν, nil]; 2.4. Coherence between the definitions of lakes in G[ν, nil] and in G[nil, δenν] | |
| 880 | 8 | |6 505-00/(S |a 3. Among all Possible Floodings, Choosing One3.1. Summary of the chapter; 3.2. Various mechanisms for selecting a particular flooding; 3.2.1. Dominated flooding in node- and edge-weighted graphs; 3.2.2. Dominated flooding in node- and edge-weighted graphs; 3.2.3. Dominated flooding as a function of the ceiling function; 3.3. The topography of dominated flooding; 3.3.1. The regional minima of dominated flooding in an edge-weighted graph G[nil, η]; 3.3.2. The regional minima of dominated n-floodings in node-weighted graphs G[ν, nil]; 3.3.3. Algorithmic consequences | |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5649339 | ||
| 994 | |a 92 |b IZTAP | ||