Sciweavers

2127 search results - page 87 / 426
» Computing large matchings fast
Sort
View
138
Voted
ICASSP
2009
IEEE
15 years 10 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
Boris Mailhé, Rémi Gribonval, Fr&eac...
131
Voted
CVPR
2010
IEEE
16 years 3 days ago
Fast Global Optimization of Curvature
Two challenges in computer vision are to accommodate noisy data and missing data. Many problems in computer vision, such as segmentation, filtering, stereo, reconstruction, inpain...
Noha El-Zehiry, Leo Grady
152
Voted
ACCV
2006
Springer
15 years 9 months ago
Fast Global Motion Estimation Via Iterative Least-Square Method
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...
Jia Wang, Haifeng Wang, Qingshan Liu, Hanqing Lu
125
Voted
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
16 years 4 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...
130
Voted
ICPR
2008
IEEE
15 years 10 months ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...