Sciweavers

999 search results - page 123 / 200
» Finding shapes in a set of points
Sort
View
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
14 years 9 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
MICCAI
2008
Springer
15 years 11 months ago
3D Brain Segmentation Using Active Appearance Models and Local Regressors
We describe an efficient and accurate method for segmenting sets of subcortical structures in 3D MR images of the brain. We first find the approximate position of all the structure...
Kolawole O. Babalola, Timothy F. Cootes, Carole ...
DGCI
2006
Springer
15 years 1 months ago
Improving Difference Operators by Local Feature Detection
Differential operators are required to compute several characteristics for continuous surfaces, as e.g. tangents, curvature, flatness, shape descriptors. We propose to replace diff...
Kristof Teelen, Peter Veelaert
EVOW
2009
Springer
14 years 7 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
CGF
2010
82views more  CGF 2010»
14 years 10 months ago
Poisson-Based Weight Reduction of Animated Meshes
While animation using barycentric coordinates or other automatic weight assignment methods has become a popular method for shape deformation, the global nature of the weights limi...
Eric Landreneau, Scott Schaefer