Sciweavers

1054 search results - page 9 / 211
» Fast Approximated SIFT
Sort
View
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 3 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
ICPR
2010
IEEE
15 years 4 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
ICML
2010
IEEE
14 years 10 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
15 years 10 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