Abstract
Dynamic programming (DP) is a popular technique for contour detection, particularly in biomedical image analysis. Although gradient information is typically used in such methods, it is not always a reliable measure to work with and there is a strong need of non-gradient based methods. In this paper we present a general framework for region based contour detection by dynamic programming. It is based on a global energy function which is approximated by a radial ray-wise summation to enable dynamic programming. Its simple algorithmic structure allows to use arbitrarily complex region models and model testing functions, in particular by means of techniques from robust statistics. The proposed framework was tested on synthetic data and real microscopic images. A performance comparison with the standard gradient-based DP and a recent non-gradient DP-based contour detection algorithm clearly demonstrates the superiority of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Trans. on Image Processing 10(2), 266–277 (2001)
Cheng, D.C., Jiang, X.: Detections of arterial wall in sonographic artery images using dual dynamic programming. IEEE Trans. on Information Technology in Biomedicine 12(6), 792–799 (2008)
Li, K., Wu, X., Chen, D., Sonka, M.: Optimal surface segmentation in volumetric images - a graph-theoretic approach. IEEE Trans. on PAMI 28(1), 119–134 (2006)
Malon, C., Cosatto, E.: Dynamic radial contour extraction by splitting homogeneous areas. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part I. LNCS, vol. 6854, pp. 269–277. Springer, Heidelberg (2011)
Ray, N., Acton, S.T., Zhang, H.: Seeing through clutter: Snake computation with dynamic programming for particle segmentation. In: Proc. of ICPR, pp. 801–804 (2012)
Stewart, C.: Robust parameter estimation in computer vision. SIAM Reviews 41(3), 513–537 (1999)
Sun, C., Appleton, B.: Multiple paths extraction in images using a constrained expanded trellis. IEEE Trans. on PAMI 27(12), 1923–1933 (2005)
Sun, C., Pallottino, S.: Circular shortest path in images. Pattern Recognition 36(3), 709–719 (2003)
Yu, M., Huang, Q., Jin, R., Song, E., Liu, H., Hung, C.C.: A novel segmentation method for convex lesions based on dynamic programming with local intra-class variance. In: Proc. of ACM Symposium on Applied Computing, pp. 39–44 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, X., Tenbrinck, D. (2013). Region Based Contour Detection by Dynamic Programming. In: Wilson, R., Hancock, E., Bors, A., Smith, W. (eds) Computer Analysis of Images and Patterns. CAIP 2013. Lecture Notes in Computer Science, vol 8048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40246-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-40246-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40245-6
Online ISBN: 978-3-642-40246-3
eBook Packages: Computer ScienceComputer Science (R0)