5 search results - page 1 / 1 » Constant time O(1) bilateral filtering |
66
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
124
Voted
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
111
Voted
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...