Sciweavers

417 search results - page 25 / 84
» Convex Shape Decomposition
Sort
View
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 25 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
COSIT
2007
Springer
103views GIS» more  COSIT 2007»
13 years 9 months ago
Scale-Dependent Simplification of 3D Building Models Based on Cell Decomposition and Primitive Instancing
Abstract. The paper proposes a novel approach for a scale-dependent geometric simplification of 3D building models that are an integral part of virtual cities. In contrast to real-...
Martin Kada
BMVC
2010
13 years 5 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog
CVPR
2000
IEEE
14 years 9 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 9 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu