11565 search results - page 145 / 2313 » Computing Minimal Mappings |
157
click to vote
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
108
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
121
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
122
click to vote
CVPR
2010
IEEE
16 years 12 days ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
148
click to vote
ECCV
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...