Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Some Theoretical Links Between Shortest Path Filters And Minimum Spanning Tree Filters, Sravan Danda, Aditya Challa, B. S.Daya Sagar, Laurent Najman
Some Theoretical Links Between Shortest Path Filters And Minimum Spanning Tree Filters, Sravan Danda, Aditya Challa, B. S.Daya Sagar, Laurent Najman
Journal Articles
Edge-aware filtering is an important pre-processing step in many computer vision applications. In the literature, there exist several versions of collaborative edge-aware filters based on spanning trees and shortest path heuristics which work well in practice. For instance, tree filter (TF) which is recently proposed based on a minimum spanning tree (MST) heuristic yields promising results in many filtering applications. However, links between the tree-based filters and shortest path-based filters are faintly explored. In this article, we introduce an edge-aware generalization of the TF termed as UMST filter based on a subgraph generated by edges of all MSTs. The major …