Name
Title | ||
|---|---|---|
Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters And Minimum Spanning Tree Filters |
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 Gamma-limit of the shortest path filters. We also propose a different approximation for the Gamma-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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-57240-6_16 | MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO SIGNAL AND IMAGE PROCESSING (ISMM 2017) |
Field | DocType | Volume |
Mathematical optimization,Electronic filter topology,Shortest path problem,Computer science,Parallel computing,Filter (signal processing),Algorithm,Kernel adaptive filter,Adaptive filter,Bilateral filter,Filter design,Minimum spanning tree | Conference | 10225 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sravan Danda | 1 | 3 | 4.10 |
| Aditya Challa | 2 | 3 | 4.10 |
| B. S. Daya Sagar | 3 | 26 | 9.32 |
| Laurent Najman | 4 | 2365 | 172.20 |