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

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

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.

First Page

199

Last Page

210

DOI

10.1007/978-3-319-57240-6_16

Publication Date

1-1-2017

Comments

Open Access, Green

This document is currently not available here.

Share

COinS