Fast compressive bilateral filter
A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the Gaussian function to reduce the number of Gaussian filters required by the CBF by a factor of 2. Producing the same resul...
Gespeichert in:
Veröffentlicht in: | Electronics letters 2017-02, Vol.53 (3), p.150-152 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the Gaussian function to reduce the number of Gaussian filters required by the CBF by a factor of 2. Producing the same results as that of the CBF, the fast algorithm runs about two times faster than the CBF. |
---|---|
ISSN: | 0013-5194 1350-911X 1350-911X |
DOI: | 10.1049/el.2016.3416 |