98 search results - page 4 / 20 » A graph spectral approach to shape-from-shading |
ICPR
2008
IEEE
14 years 9 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...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
LION
2009
Springer
14 years 3 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
ACL
2006
13 years 10 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...