Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Using dynamic programming for solving variational problems in vision
1.003
Zitationen
3
Autoren
1990
Jahr
Abstract
Dynamic programming is discussed as an approach to solving variational problems in vision. Dynamic programming ensures global optimality of the solution, is numerically stable, and allows for hard constraints to be enforced on the behavior of the solution within a natural and straightforward structure. As a specific example of the approach's efficacy, applying dynamic programming to the energy-minimizing active contours is described. The optimization problem is set up as a discrete multistage decision process and is solved by a time-delayed discrete dynamic programming algorithm. A parallel procedure for decreasing computational costs is discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Ähnliche Arbeiten
Very Deep Convolutional Networks for Large-Scale Image Recognition
2014 · 75.502 Zit.
Unpaired Image-to-Image Translation Using Cycle-Consistent Adversarial Networks
2017 · 21.635 Zit.
Multiple View Geometry in Computer Vision
2004 · 20.693 Zit.
Snakes: Active contour models
1988 · 17.009 Zit.
Nonlinear Dimensionality Reduction by Locally Linear Embedding
2000 · 14.989 Zit.