|
2-D edge detection using cost
minimization/ snakes. Input: Medical
and/or other images Operation:
Compute gradient image. Define a transform, for example polar, a cost
function, for example circumference and gradient. Minimize path in transformed
data by cost minimization. Alternative, use a snake for example using Greedy
algorithm. The object is to find an algorithm to link the points identified
on a gradient map to give continuous enclosing contours. Output: Image
with contour. |