Rogier Wolff schrieb:
On Wed, Oct 28, 2009 at 10:56:08PM +0100, Pablo d'Angelo wrote:
Implementations of Minimum cut algorithms are widely available, for
example from the boost graph library or
http://www.cs.ucl.ac.uk/staff/V.Kolmogorov/software.html (maxflow v2.2
is GPL licensed).
I
Hi Andrew,
Andrew Mihal schrieb:
Hi Pablo,
Can you elaborate a little on your criticism of snakes?
Is the problem:
- That the polyline formulation cannot describe a good solution at all?
A polyline can describe all possible solutions, if it is fine enough.
- That the size of the
On Wed, Oct 28, 2009 at 10:56:08PM +0100, Pablo d'Angelo wrote:
Implementations of Minimum cut algorithms are widely available, for
example from the boost graph library or
http://www.cs.ucl.ac.uk/staff/V.Kolmogorov/software.html (maxflow v2.2
is GPL licensed).
I think an implementation
Hi Pablo,
Can you elaborate a little on your criticism of snakes?
Is the problem:
- That the polyline formulation cannot describe a good solution at all?
- That the size of the state space in the current implementation is
too restrictive?
- That the current implementation's cost functions do
Hi Andrew,
Andrew Mihal schrieb:
Hi,
I suspect a problem in the vectorization of the seam lines.
Actually, the approach of using vectorized seam lines is a relatively
complicated process. Additionally, snakes are not particularly well
known to find good global solutions. I think a
