70 search results - page 4 / 14 » Bypassing the embedding: algorithms for low dimensional metr... |
110
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
115
click to vote
ALGOSENSORS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
ICML
2009
IEEE
16 years 12 days ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
92
Voted
AAAI
2007
15 years 1 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...