817 search results - page 88 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
ECCV
1994
Springer
14 years 9 months ago
1994
Springer
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
CVPR
1998
IEEE
14 years 9 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...