Sciweavers

774 search results - page 6 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 5 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
ICASSP
2011
IEEE
12 years 11 months ago
Learning sparse dictionaries with a popularity-based model
Sparse signal representation based on overcomplete dictionaries has recently been extensively investigated, rendering the state-of-the-art results in signal, image and video proce...
Jianzhou Feng, Li Song, Xiaoming Huo, Xiaokang Yan...
CVPR
2011
IEEE
13 years 3 months ago
Learning A Discriminative Dictionary for Sparse Coding via Label Consistent K-SVD
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
Zhuolin Jiang, Zhe Lin, Larry Davis
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...