Sciweavers

824 search results - page 44 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 5 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
CAD
2004
Springer
13 years 8 months ago
Linear one-sided stability of MAT for weakly injective 3D domain
Despite its usefulness in many applications, the medial axis transform (MAT) is very sensitive to the change of the boundary in the sense that, even if a shape is perturbed only s...
Sung Woo Choi, Hans-Peter Seidel
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
14 years 22 days ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CVPR
2003
IEEE
14 years 10 months ago
Shape Context and Chamfer Matching in Cluttered Scenes
This paper compares two methods for object localization from contours: shape context and chamfer matching of templates. In the light of our experiments, we suggest improvements to...
Arasanathan Thayananthan, Bjoern Stenger, Philip H...
ICCV
2011
IEEE
12 years 8 months ago
Exemplar Extraction using Spatio-Temporal Hierarchical Agglomerative Clustering for Face Recognition in Video
Many recent works have attempted to improve object recognition by exploiting temporal dynamics, an intrinsic property of video sequences. In this paper, a new spatiotemporal hiera...
John See, Chikkannan Eswaran