Open AccessThree‐dimensional object delineation by dynamic programming
Author(s) -
Starink J P Pascual,
Gerbrands Jan J
Publication year - 1994
Publication title -
bioimaging
Language(s) - English
Resource type - Journals
eISSN - 1361-6374
pISSN - 0966-9051
DOI - 10.1002/1361-6374(199412)2:4<204::aid-bio5>3.0.co;2-l
Subject(s) - path (computing) , domain (mathematical analysis) , boundary (topology) , object (grammar) , dynamic programming , image (mathematics) , window (computing) , extension (predicate logic) , computer science , field (mathematics) , computer vision , algorithm , artificial intelligence , mathematics , mathematical analysis , pure mathematics , programming language , operating system
State space search techniques like dynamic programming have been proposed for the delineation of object regions in extremely noisy two‐dimensional images. Usually, such methods are applied directly to the image or to a window within the image. The method described here starts with a region of interest enclosing the required boundary. A geometric transform is used to straighten the region of interest into a rectangular matrix. In the transform domain, merit coefficients are computed and a dynamic programming optimal path algorithm is applied to find the transformed object region boundary. Finally, the path is transformed back to the original image domain. The subject of the current paper is the extension of the two‐dimensional search method to three dimensions. Experimental results are given, as well as an example from the field of cell biology.