Topographical Tools for Filtering and Segmentation 2

Flooding and Marker-based Segmentation on Node- or Edge-weighted Graphs

Nonfiction, Science & Nature, Technology, Engineering
Cover of the book Topographical Tools for Filtering and Segmentation 2 by Fernand Meyer, Wiley
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Fernand Meyer ISBN: 9781119575122
Publisher: Wiley Publication: January 23, 2019
Imprint: Wiley-ISTE Language: English
Author: Fernand Meyer
ISBN: 9781119575122
Publisher: Wiley
Publication: January 23, 2019
Imprint: Wiley-ISTE
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Wiley

Cover of the book ESD by Fernand Meyer
Cover of the book 50 Great Myths of Human Sexuality by Fernand Meyer
Cover of the book A Guide to Forensic DNA Profiling by Fernand Meyer
Cover of the book Handbook of Digital Games by Fernand Meyer
Cover of the book Materials in Energy Conversion, Harvesting, and Storage by Fernand Meyer
Cover of the book California Wine For Dummies by Fernand Meyer
Cover of the book Principles of Oral and Maxillofacial Surgery by Fernand Meyer
Cover of the book Introduction to Molecular Magnetism by Fernand Meyer
Cover of the book Introduction to Stochastic Analysis by Fernand Meyer
Cover of the book LTE, LTE-Advanced and WiMAX by Fernand Meyer
Cover of the book Education and Learning by Fernand Meyer
Cover of the book Modern Sensors Handbook by Fernand Meyer
Cover of the book Fault-Tolerance Techniques for Spacecraft Control Computers by Fernand Meyer
Cover of the book The A to Z of Corporate Social Responsibility by Fernand Meyer
Cover of the book Interactions on Digital Tablets in the Context of 3D Geometry Learning by Fernand Meyer
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy