Sciweavers

3630 search results - page 238 / 726
» Fast Marching Methods
Sort
View
ICIP
2007
IEEE
16 years 25 days ago
Fast Computation of Zernike Moments For Rice Sorting System
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Take...
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
15 years 10 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer
APBC
2007
110views Bioinformatics» more  APBC 2007»
15 years 8 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
TCSV
2008
131views more  TCSV 2008»
15 years 6 months ago
Fast Optimal Motion Estimation Based on Gradient-Based Adaptive Multilevel Successive Elimination
In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
Shao-Wei Liu, Shou-Der Wei, Shang-Hong Lai
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf