Issue No. 09 - September (1990 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.57681
<p>Early image understanding seeks to derive analytic representations from image intensities. The authors present steps towards this goal by considering the inference of surfaces from three-dimensional images. Only smooth surfaces are considered and the focus is on the coupled problems of inferring the trace points (the points through which the surface passes) and estimating the associated differential structure given by the principal curvature and direction fields over the estimated smooth surfaces. Computation of these fields is based on determining an atlas of local charts or parameterizations at estimated surface points. Algorithm robustness and the stability of results are essential for analyzing real images; to this end, the authors present a functional minimization algorithm utilizing overlapping local charts to refine surface points and curvature estimates, and develop an implementation as an iterative constraint satisfaction procedure based on local surface smoothness properties. Examples of the recovery of local structure are presented for synthetic images degraded by noise and for clinical magnetic resonance images.</p>
machine vision; dynamic programming; variational problems; energy-minimizing active contours; optimization; discrete multistage decision process; computational costs; computer vision; dynamic programming; picture processing; variational techniques
T. Weymouth, R. Jain and A. Amini, "Using Dynamic Programming for Solving Variational Problems in Vision," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 855-867, 1990.