by Vaudrey, T and Klette, R
Abstract:
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.
Reference:
Fast trilateral filtering (Vaudrey, T and Klette, R), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 5702 LNCS, 2009.
Bibtex Entry:
@inproceedings{vaudrey2009fastfiltering,
author = "Vaudrey, T and Klette, R",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "541--548",
title = "Fast trilateral filtering",
volume = "5702 LNCS",
year = "2009",
abstract = "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.",
doi = "10.1007/978-3-642-03767-2_66",
isbn = "3642037666",
isbn = "9783642037665",
issn = "0302-9743",
eissn = "1611-3349",
language = "eng",
}