Sciweavers

455 search results - page 88 / 91
» Adaptive Sampling for Noisy Problems
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
BRISK: Binary Robust Invariant Scalable Keypoints
Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Establishe...
Stefan Leutenegger, Margarita Chli, Roland Y. Sieg...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
MVA
2000
172views Computer Vision» more  MVA 2000»
13 years 8 months ago
Partial Face Extraction and Recognition Using Radial Basis Function Networks
work, applies a nonlinear transformation from the input space to the hidden space. The output layer Partial face images, e.g.1 eyes, nose, and ear supplies the response of the netw...
Nan He, Kiminori Sato, Yukitoshi Takahashi
CVIU
2007
154views more  CVIU 2007»
13 years 7 months ago
Smart particle filtering for high-dimensional tracking
Tracking articulated structures like a hand or body within a reasonable time is challenging because of the high dimensionality of the state space. Recently, a new optimization met...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 24 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...