Power tree filter: A theoretical framework linking shortest path filters and minimum spanning tree filters

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Edge-preserving image filtering is an important preprocessing step in many filtering applications. In this article, we analyse the basis of edge-preserving filters and also provide theoretical links between the MST filter, which is a recent state-of-art edge-preserving filter, and filters based on geodesics. We define shortest path filters, which are closely related to adaptive kernel based filters, and show that MST filter is an approximation to the Γ −limit of the shortest path filters. We also propose a different approximation for the Γ −limit that is based on union of all MSTs and show that it yields better results than that of MST approximation by reducing the leaks across object boundaries. We demonstrate the effectiveness of the proposed filter in edge-preserving smoothing by comparing it with the tree filter.

Cite

CITATION STYLE

APA

Danda, S., Challa, A., Daya Sagar, B. S., & Najman, L. (2017). Power tree filter: A theoretical framework linking shortest path filters and minimum spanning tree filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10225 LNCS, pp. 199–210). Springer Verlag. https://doi.org/10.1007/978-3-319-57240-6_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free