Sciweavers

3630 search results - page 338 / 726
» Fast Marching Methods
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 5 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
NECO
2000
113views more  NECO 2000»
15 years 4 months ago
Geometric Analysis of Population Rhythms in Synaptically Coupled Neuronal Networks
We develop geometric dynamical systems methods to determine how various components contribute to a neuronal network's emergent population behavior. The results clarify the mu...
Jonathan E. Rubin, David Terman
PR
2007
142views more  PR 2007»
15 years 4 months ago
Visual guided navigation for image retrieval
In this work, we are interested in technologies that will allow users to actively browse and navigate large image databases and to retrieve images through interactive fast browsin...
Guoping Qiu, Jeremy Morris, Xunli Fan
ICIP
2000
IEEE
16 years 6 months ago
Maximum Entropy Image Restoration Revisited
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
Matthew Willis, Brian D. Jeffs, David G. Long
ICPR
2008
IEEE
16 years 6 months ago
3D rotation invariant local binary patterns
We present a novel method for the fast computation of rotation invariant "local binary patterns" (LBP) on 3D volume data. Unlike a previous publication on 3D LBP, this n...
Hans Burkhardt, Janis Fehr