Sciweavers

409 search results - page 12 / 82
» Fast Trilateral Filtering
Sort
View
ICIP
2010
IEEE
13 years 5 months ago
Fast bilateral filtering by adapting block size
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...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
ANCS
2005
ACM
14 years 1 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
ISCAS
1994
IEEE
119views Hardware» more  ISCAS 1994»
13 years 11 months ago
Fast Design Algorithms for FIR Notch Filters
Based on symmetry of the maximally flat frequency response of a FIR notch filter the new design procedure is developed. The closed form solution provides direct computation of the...
Miroslav Vlcek, Ladislav Jires
TROB
2008
118views more  TROB 2008»
13 years 7 months ago
A New Kalman-Filter-Based Framework for Fast and Accurate Visual Tracking of Rigid Objects
The best of Kalman-filter-based frameworks reported in the literature for rigid object tracking work well only if the object motions are smooth (which allows for tight uncertainty ...
Youngrock Yoon, Akio Kosaka, Avinash C. Kak
OSDI
2004
ACM
14 years 8 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...