Sciweavers

999 search results - page 2 / 200
» Finding shapes in a set of points
Sort
View
IJCAT
2010
133views more  IJCAT 2010»
13 years 5 months ago
A 3D shape classifier with neural network supervision
: The task of 3D shape classification is to assign a set of unordered shapes into pre-tagged classes with class labels, and find the most suitable class for a newly given shape. In...
Zhenbao Liu, Jun Mitani, Yukio Fukui, Seiichi Nish...
CCCG
1998
13 years 8 months ago
Quantile approximation for robust statistical estimation
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
CVPR
2008
IEEE
14 years 9 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
CVGIP
2002
181views more  CVGIP 2002»
13 years 7 months ago
A dynamic method for dominant point detection
Detecting dominant points is an important step for shape representation. Most of dominant point detection methods attend to preset or find the region of support of each point. In ...
Wen-Yen Wu
ICIP
2008
IEEE
14 years 9 months ago
Classification of unlabeled point sets using ANSIG
We address two-dimensional shape-based classification, considering shapes described by arbitrary sets of unlabeled points, or landmarks. This is relevant in practice because, in m...
José J. Rodrigues, João M. F. Xavier...