Sciweavers

167 search results - page 12 / 34
» Constraints for closest point finding
Sort
View
ECCV
2006
Springer
15 years 11 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
74
Voted
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ECCV
2004
Springer
15 years 11 months ago
Classifying Materials from Their Reflectance Properties
We explore the possibility of recognizing the surface material from a single image with unknown illumination, given the shape of the surface. Model-based PCA is used to create a lo...
Peter Nillius, Jan-Olof Eklundh
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
14 years 11 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
ICPR
2010
IEEE
15 years 1 months ago
Large Margin Classifier Based on Affine Hulls
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
Hakan Cevikalp, Hasan Serhan Yavuz