Advertisement

A Fast Dynamic Border Linking Algorithm for Region Merging

  • Johan De Bock
  • Rui Pires
  • Patrick De Smet
  • Wilfried Philips
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4179)

Abstract

In this paper we present our region merging algorithm that is built with special attention on speed but still includes all the necessary functionality to use a wide range of both region based and border based dissimilarity criteria. The algorithm includes a novel method to dynamically link the common borders between two segments during the region merging. The main part of the paper will concentrate on the efficient data structures and functions that are needed to obtain a fast region merging algorithm. Also, all the special situations that can occur in the segment topology are completely covered. We give a detailed report on the execution times of the algorithm and show some of the segmentation results we obtained.

Keywords

Segmentation Result Outer Contour Start Node Neighboring Segment Common Border 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Canny, J.: A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 8, 679–698 (1986)CrossRefGoogle Scholar
  2. 2.
    De Bock, J., De Smet, P., Philips, W.: A fast sequential rainfalling watershed segmentation algorithm. In: Blanc-Talon, J., Philips, W., Popescu, D.C., Scheunders, P. (eds.) ACIVS 2005. LNCS, vol. 3708, pp. 476–482. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Pavlidis, T.: Structural Pattern Recognition. Springer, Heidelberg (1977)MATHGoogle Scholar
  4. 4.
    Haris, K., Efstratiadis, S., Maglaveras, N., Katsaggelos, A.: Hybrid image segmentation using watersheds and fast region merging. IEEE Transactions on Image Processing 7, 1684–1699 (1998)CrossRefGoogle Scholar
  5. 5.
    Pires, R., De Smet, P., Philips, W.: Watershed segmentation and region merging. In: IS&T/SPIE Electronic Imaging, Visual Communications and Image Processing, vol. 5308, pp. 1127–1135 (2004)Google Scholar
  6. 6.
    Tremeau, A., Colantoni, P.: Regions adjacency graph applied to color image segmentation. IEEE Transactions on Image Processing 9, 735–744 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Johan De Bock
    • 1
  • Rui Pires
    • 1
  • Patrick De Smet
    • 1
  • Wilfried Philips
    • 1
  1. 1.Dep. TELIN/TW07Ghent UniversityGhentBelgium

Personalised recommendations