Summary
This chapter presents an efficient technique for linking edge points in order to generate a closed contour representation. The original intensity image, as well as its corresponding edge map, are assumed to be given as input to the algorithm (i.e., an edge map is previously computed by some of the classical edge detector algorithms). The proposed technique consists of two stages. The first stage computes an initial representation by connecting edge points according to a global measure. It relies on the use of graph theory. Spurious edge points are removed by a morphological filter. The second stage finally generates closed contours, linking unconnected edges, by using a local cost function. Experimental results with different intensity images are presented.3
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Ballard and C. Brown. Computer Vision. Prentice-Hall, Inc., 1982.
J. Canny. Computational approach to edge detection. IEEE Trans. Pattern Analysis and Machine Intelligence, 8(6):679–698, 1986.
A. Farag and E. Delp. Edge linking by sequential search. Pattern Recognition, 28(5):611–633, May 1995.
M.A. Garcia, B. Vintimilla, and A. Sappa. Approximation and processing of intensity images with discontinuity-preserving adaptive triangular meshes. In Proc. ECCV 2000, D. Vernon, Ed. New York: Springer, 2000, vol. 1842, LNCS, Dublin, Ireland, pages 844–855, June/July 2000.
O. Ghita and P. Whelan. Computational approach for edge linking. Journal of Electronic Imaging, 11(4):479–485, October 2002.
W.E. Grimson. From Images to Surfaces. Cambridge, MA: MIT Press, 1981.
A. Hajjar and T. Chen. A VLSI architecture for real-time edge linking. IEEE Trans. on Pattern Analysis and Machine Intelligence, 21(1):89–94, January 1999.
L. Hermes and J. Buhmann. A minimum entropy approach to adaptive image polygonization. IEEE Trans. on Image Processing, 12(10):1243–1258, October 2003.
C. Kim and J. Hwang. Fast and automatic video object segmentation and tracking for content-based applications. IEEE Trans. on Circuits and Systems for Video Technology, 12(2):122–1129, February 2002.
E. Saber and A. Tekalp. Integration of color, edge, shape, and texture features for automatic region-based image annotation and retrieval. Journal of Electronic Imaging, 7(3):684–700, July 1998.
A.D. Sappa. Unsupervised contour closure algorithm for range image edge-based segmentation. IEEE Trans. on Image Processing, 15(2):377–384, February 2006.
W. Snyder, R. Groshong, M. Hsiao, K. Boone, and T. Hudacko. Closing gaps in edges and surfaces. Image and Vision Computing, 10(8):523–531, October 1992.
Y. Yang, M. Wernick, and J. Brankov. A fast approach for accurate contentadaptive mesh generation. IEEE Trans. on Image Processing, 12(8):866–881, August 2003.
T. Zhang and C. Suen. A fast parallel algorithm for thinning digital patterns. Communications of the ACM, 27(3):236–239, March 1984.
S. Zhu and A. Yuille. Region competition: Unifying snakes, region growing, and bayes/mdl for multiband image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 18(9):884–900, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Sappa, A.D., Vintimilla, B.X. (2008). Edge Point Linking by Means of Global and Local Schemes. In: Damiani, E., Yétongnon, K., Schelkens, P., Dipanda, A., Legrand, L., Chbeir, R. (eds) Signal Processing for Image Enhancement and Multimedia Processing. Multimedia Systems and Applications Series, vol 31. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-72500-0_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-72500-0_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-72499-7
Online ISBN: 978-0-387-72500-0
eBook Packages: Computer ScienceComputer Science (R0)