Sciweavers

999 search results - page 17 / 200
» Finding shapes in a set of points
Sort
View
PAMI
2012
11 years 9 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
ECRTS
2010
IEEE
13 years 8 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...
ECCV
2006
Springer
14 years 9 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
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 7 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
PAMI
2006
145views more  PAMI 2006»
13 years 7 months ago
Reflectance Sharing: Predicting Appearance from a Sparse Set of Images of a Known Shape
Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of vi...
Todd Zickler, Ravi Ramamoorthi, Sebastian Enrique,...