Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters

DOI10.1007/978-3-319-57240-6_16zbMath1479.94374OpenAlexW2606346353MaRDI QIDQ5270548

B. S. Daya Sagar, Aditya Challa, Sravan Danda, Laurent Najman

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57240-6_16

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ Some theoretical links between shortest path filters and minimum spanning tree filters

Uses Software

• Algorithm 97

Cites Work

• Edge-preserving smoothing using a similarity measure in adaptive geodesic neighbourhoods
• Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree

This page was built for publication: Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters