Sciweavers

2031 search results - page 88 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
TMI
2002
248views more  TMI 2002»
14 years 9 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 8 days ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
CVPR
2003
IEEE
15 years 12 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
2007
IEEE
15 years 11 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
GIS
2009
ACM
15 years 11 months ago
Map Matching and Uncertainty: an Algorithm and Real-World Experiments
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...