Sciweavers

2219 search results - page 241 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
125
Voted

Publication
433views
15 years 12 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
EMMCVPR
2011
Springer
14 years 3 months ago
Globally Optimal Image Partitioning by Multicuts
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Jörg H. Kappes, Markus Speth, Björn Andr...
CVPR
2000
IEEE
16 years 5 months ago
Fixed Topology Skeletons
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...
Polina Golland, W. Eric L. Grimson
97
Voted
ICPR
2008
IEEE
16 years 4 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 8 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...