Sciweavers

2219 search results - page 89 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Constrained clustering by a novel graph-based distance transformation
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...
Kai Rothaus, Xiaoyi Jiang
CVPR
2006
IEEE
15 years 10 months ago
Shape from Dynamic Texture for Planes
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 ...
Yaser Sheikh, Niels C. Haering, Mubarak Shah
CVPR
1999
IEEE
16 years 6 months ago
Stochastic Image Segmentation by Typical Cuts
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...
Yoram Gdalyahu, Daphna Weinshall, Michael Werman
BMVC
2010
14 years 11 months ago
Saliency Segmentation based on Learning and Graph Cut Refinement
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...
Paria Mehrani, Olga Veksler
AB
2008
Springer
15 years 10 months ago
Algorithms for Inference, Analysis and Control of Boolean Networks
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...
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamur...