Sciweavers

620 search results - page 37 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICIP
2007
IEEE
16 years 4 months ago
Fast and High Resolution 3D Face Scanning
In this work, we present a framework to capture 3D models of faces in high resolutions with low computational load. The system captures only two pictures of the face, one illumina...
Philipp Fechteler, Peter Eisert, Jürgen Rurai...
ICPR
2006
IEEE
16 years 3 months ago
Fast Dynamic Mosaicing and Person Following
A system for video surveillance purposes in wide areas based on active cameras, also capable to follow a person in the scene by keeping him framed, is presented. The proposed appr...
Andrea Prati, Fabrizio Seghedoni, Rita Cucchiara
NIPS
1993
15 years 3 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 2 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
IROS
2007
IEEE
169views Robotics» more  IROS 2007»
15 years 8 months ago
A lightweight SLAM algorithm using Orthogonal planes for indoor mobile robotics
— Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks....
Viet Nguyen, Ahad Harati, Roland Siegwart