Sciweavers

1111 search results - page 60 / 223
» Fast Image Alignment Using Anytime Algorithms
Sort
View
73
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
IJCV
2002
256views more  IJCV 2002»
14 years 9 months ago
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
Changming Sun
116
Voted
ICANN
2005
Springer
15 years 3 months ago
Fast Color-Based Object Recognition Independent of Position and Orientation
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
Martijn van de Giessen, Jürgen Schmidhuber
IROS
2008
IEEE
114views Robotics» more  IROS 2008»
15 years 4 months ago
Fast color/texture segmentation for outdoor robots
— We present a fast integrated approach for online segmentation of images for outdoor robots. A compact color and texture descriptor has been developed to describe local color an...
Morten Rufus Blas, Motilal Agrawal, Aravind Sundar...
CVPR
2010
IEEE
15 years 1 months ago
Fast pattern matching using orthogonal Haar transform
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...
Wanli Ouyang, Renqi Zhang, Cham Wai-Kuen