1299 search results - page 18 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
ISVC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
DCG
1998
14 years 9 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
AAAI
2008
14 years 12 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
CAIP
2003
Springer
15 years 2 months ago
2003
Springer
Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an...