Name: Topographical Tools for Filtering and Segmentation 2: Flooding and Marker-Based Segmentation on Node- or Edge-Weighted Graphs (en Inglés)
Price: 685130.00 COP
Availability: InStock
Author: Fernand Meyer
ISBN: 9781786304070

portada Topographical Tools for Filtering and Segmentation 2: Flooding and Marker-Based Segmentation on Node- or Edge-Weighted Graphs (en Inglés)

Formato

Libro Físico

Editorial

Iste Ltd

Autor

Fernand Meyer

Año

2019

Idioma

Inglés

N° páginas

284

Encuadernación

Tapa Dura

ISBN13

9781786304070

N° edición

Topographical Tools for Filtering and Segmentation 2: Flooding and Marker-Based Segmentation on Node- or Edge-Weighted Graphs (en Inglés)

Fernand Meyer (Autor) · Iste Ltd · Tapa Dura

Libro Físico

$ 685.130

$ 1.141.883

Ahorras: $ 456.753

40% descuento

Envío normal

Origen: Reino Unido (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Miércoles 17 de Julio y el Miércoles 24 de Julio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Topographical Tools for Filtering and Segmentation 2: Flooding and Marker-Based Segmentation on Node- or Edge-Weighted Graphs (en Inglés)"

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.