1039 search results - page 27 / 208 » Kernels and Regularization on Graphs |
132
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a novel method for incorporating prior knowledge about invariances in object recognition for discriminant analysis. In contrast to conventional isotropic regularization...
120
click to vote
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
128
click to vote
NIPS
2003
15 years 5 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
129
click to vote
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
141
click to vote
CPC
2007
15 years 3 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...