This paper compares the original implementation of the trilateral filter with two proposed speed improvements. One is using simple look-up-tables, and leads to exactly the same results as the original filter. The other technique is using a novel way of truncating the look-up-table (LUT) to a user specified required accuracy. Here, results differ from those of the original filter, but to a very minor extent. The paper shows that measured speed improvements of this second technique are in the order of several magnitudes, compared to the original or LUT trilateral filter. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Vaudrey, T., & Klette, R. (2009). Fast trilateral filtering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5702 LNCS, pp. 541–548). https://doi.org/10.1007/978-3-642-03767-2_66
Mendeley helps you to discover research relevant for your work.