Sciweavers

174 search results - page 14 / 35
» Algorithms for center and Tverberg points
Sort
View
TMI
2010
134views more  TMI 2010»
13 years 2 months ago
Mitral Annulus Segmentation From 3D Ultrasound Using Graph Cuts
The shape of the mitral valve annulus is used in diagnostic and modeling applications, yet methods to accurately and reproducibly delineate the annulus are limited. This paper pres...
Robert Schneider, Douglas P. Perrin, Nikolay V. Va...
CVPR
2009
IEEE
1561views Computer Vision» more  CVPR 2009»
15 years 2 months ago
SURFTrac: Efficient Tracking and Continuous Object Recognition using Local Feature Descriptors
We present an efficient algorithm for continuous image recognition and feature descriptor tracking in video which operates by reducing the search space of possible interest poin...
Duy-Nguyen Ta (Georgia Institute of Technology), W...
GECCO
2000
Springer
13 years 11 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
ICIP
2005
IEEE
14 years 29 days ago
Fast and subpixel precise blob detection and attribution
This paper introduces an algorithm for fast and subpixel precise detection of small, compact image primitives (”blobs”). The algorithm is based on differential geometry and in...
Stefan Hinz