Sciweavers

1539 search results - page 69 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
CVPR
2008
IEEE
15 years 9 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
ICCHP
2010
Springer
15 years 7 months ago
MarkerMouse: Mouse Cursor Control Using a Head-Mounted Marker
We propose MarkerMouse, an inexpensive method for controlling the mouse cursor using a web cam and a marker placed on the user’s forehead. Two modes of cursor control were compar...
Rados Javanovic, I. Scott MacKenzie
IJON
1998
44views more  IJON 1998»
15 years 2 months ago
Hierarchical RBF networks and local parameters estimate
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
N. Alberto Borghese, Stefano Ferrari
ICIP
2002
IEEE
16 years 4 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
ACIVS
2008
Springer
15 years 8 months ago
Blur and Contrast Invariant Fast Stereo Matching
We propose a novel approach for estimating a depth-map from a pair of rectified stereo images degraded by blur and contrast change. At each location in image space, information is...
Matteo Pedone, Janne Heikkilä