Sciweavers

334 search results - page 32 / 67
» Boosting with structural sparsity
Sort
View
FLAIRS
2004
13 years 9 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
CORR
2010
Springer
59views Education» more  CORR 2010»
13 years 6 months ago
Noise Invalidation Denoising
—A denoising technique based on noise invalidation is proposed. The adaptive approach derives a noise signature from the noise order statistics and utilizes the signature to deno...
Soosan Beheshti, Masoud Hashemi, Xiao-Ping Zhang, ...
ICML
2009
IEEE
13 years 5 months ago
Multiple indefinite kernel learning with mixed norm regularization
We address the problem of learning classifiers using several kernel functions. On the contrary to many contributions in the field of learning from different sources of information...
Matthieu Kowalski, Marie Szafranski, Liva Ralaivol...
PAMI
2010
145views more  PAMI 2010»
13 years 2 months ago
Texture Synthesis with Grouplets
This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet tran...
Gabriel Peyré
ICASSP
2011
IEEE
12 years 11 months ago
Bayesian Compressive Sensing for clustered sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
Lei Yu, Hong Sun, Jean-Pierre Barbot, Gang Zheng