75 search results - page 11 / 15 » Threshold Functions for Random Graphs on a Line Segment |
PAMI
2007
13 years 7 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...