Sciweavers

167 search results - page 3 / 34
» Constraints for closest point finding
Sort
View
ICTAI
2008
IEEE
14 years 1 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 5 months ago
Unsupervised discovery of repetitive objects
We present a novel approach for unsupervised discovery of repetitive objects from 3D point clouds. Our method assumes that objects are geometrically consistent, and uses multiple o...
Jiwon Shin, Rudolph Triebel, Roland Siegwart
ICPR
2010
IEEE
13 years 10 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
CEC
2007
IEEE
14 years 1 months ago
Finding trade-off solutions close to KKT points using evolutionary multi-objective optimization
— Despite having a wide-spread applicability of evolutionary optimization procedures over the past few decades, EA researchers still face criticism about the theoretical optimali...
Kalyanmoy Deb, Rahul Tewari, Mayur Dixit, Joydeep ...
IJCV
2007
165views more  IJCV 2007»
13 years 7 months ago
Registration of 3D Points Using Geometric Algebra and Tensor Voting
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
Leo Reyes, Gérard G. Medioni, Eduardo Bayro...