Sciweavers

6365 search results - page 305 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
2003
IEEE
15 years 12 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
TVLSI
1998
124views more  TVLSI 1998»
15 years 6 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
CVPR
2007
IEEE
16 years 8 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
ICASSP
2009
IEEE
16 years 1 months ago
Fast noise PSD estimation with low complexity
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
167
Voted
APGV
2005
ACM
130views Visualization» more  APGV 2005»
16 years 7 days ago
Exploitation of human shadow perception for fast shadow rendering
In this paper we describe an experiment to obtain information about the perceptual potential of the human visual system regarding shadow perception. Shadows play an important part...
Mirko Sattler, Ralf Sarlette, Thomas Mücken, ...