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, 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 continous enclosing contours.
Output:
Image with contour. Algorithm to identify the organ, for example left ventricle of heart, without manual intervention.
Coding:
In C/C++ with OpenCV (Image Processing) and Qt (GUI)
Remarks:
Problem is robustness.
By performing edge detection a model of the feature of interest is produced. The feature built as a solution is single(closed) active contour. |
