Sciweavers

1539 search results - page 46 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ICRA
2002
IEEE
161views Robotics» more  ICRA 2002»
15 years 7 months ago
A Method for Co-Evolving Morphology and Walking Pattern of Biped Humanoid Robot
— In this paper, we present a method for co-evolving structures and controller of biped walking robots. Currently, biped walking humanoid robots are designed manually on trial-an...
Ken Endo, Fuminori Yamasaki, Takashi Maeno, Hiroak...
SGP
2007
15 years 4 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...
MICCAI
2007
Springer
16 years 3 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
ICASSP
2009
IEEE
15 years 9 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
93
Voted
IJON
2006
85views more  IJON 2006»
15 years 2 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...