2219 search results - page 150 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
131
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
130
Voted
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
122
Voted
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
125
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
119
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...