2219 search results - page 89 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
108
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
115
click to vote
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
We propose a method for recovering the affine geometry of a dynamically textured plane from a video sequence taken by an uncalibrated, fixed, perspective camera. Some instances ...
82
Voted
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
141
click to vote
BMVC
2010
14 years 9 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
140
click to vote
AB
2008
Springer
15 years 8 months ago
2008
Springer
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...