1493 search results - page 111 / 299 » Local resilience of graphs |
103
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
123
click to vote
DAM
2000
15 years 17 days ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
142
Voted
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
16 years 7 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
109
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
106
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or a...