Multiresolution techniques are often used to shorten the ex- ecution times of dynamic programming based deformable contour op- timization methods by decreasing the image resolution. However, the speedup comes at the expense of contour optimality due to the loss of details and insufficient usage of the external energy in decreased res- olutions. In this paper, we present a new scale-space based technique for deformable contour optimization, which achieves faster optimization times and performs better than the current multiresolution methods. The technique employs a multiscale representation of the underlying images to analyze the behavior of the external energy of the deformable contour with respect to the change in the scale dimension. The result of this anal- ysis, which involves information theoretic comparisons between scales, is used in segmentation of the original images. Later, an exhaustive search on these segments is carried out by dynamic programming to optimize the contour energy. A novel gradient descent algorithm is employed to find optimal internal energy for large image segments, where the external energy remains constant due to segmentation.