Sciweavers

162 search results - page 6 / 33
» Structural Matching Via Optimal Basis Graphs
Sort
View
CVPR
2011
IEEE
14 years 7 months ago
Sparsity-based Image Denoising via Dictionary Learning and Structural Clustering
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
Weisheng Dong, Xin Li
ICASSP
2011
IEEE
14 years 1 months ago
Extension of the Global Matched Filter to structured groups of atoms: Application to harmonic signals
When seeking a sparse representation of a signal on a redundant basis, one might want to convey available a priori information on the observations to the optimization criterion. I...
Jean-Jacques Fuchs
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 9 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 2 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
118
Voted
DKE
2007
199views more  DKE 2007»
14 years 9 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool