Shivering greedy snakes, gradient-guided in wavelet domain

The convergence speed of snakes is increased with the switching step size of local minima search and they are incorporated with the local gradient information in the wavelet domain to provide extra speed of convergence to their final contours. This is important in model based compression applications using wavelet decomposition. The directional gradient information is extracted from the subbands provided for the three directions at each stage of the decomposition. The advantages of this approach include, increased speed of convergence due to the switching step size of search and due to the decreased number of pixels to be searched and decreased burden of calculations for pre-processing due to the decreased size of subbands and due to the decreased dimension of the Gaussian filters in the pre-processing stage.

[1]  Hong Yan,et al.  Fast algorithm for locating head boundaries , 1994, J. Electronic Imaging.

[2]  Terry E. Weymouth,et al.  Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[3]  Charles K. Chui,et al.  An Introduction to Wavelets , 1992 .

[4]  J. B. Waite,et al.  Head boundary location using snakes , 1990 .

[5]  Roland T. Chin,et al.  Automated analysis of nerve-cell images using active contour models , 1996, IEEE Trans. Medical Imaging.

[6]  Mubarak Shah,et al.  A Fast algorithm for active contours and curvature estimation , 1992, CVGIP Image Underst..