A Fast Dynamic Border Linking Algorithm for Region Merging | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Fast Dynamic Border Linking Algorithm for Region Merging

  • Conference paper
Advanced Concepts for Intelligent Vision Systems (ACIVS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Canny, J.: A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 8, 679–698 (1986)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  3. Pavlidis, T.: Structural Pattern Recognition. Springer, Heidelberg (1977)

    MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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. Tremeau, A., Colantoni, P.: Regions adjacency graph applied to color image segmentation. IEEE Transactions on Image Processing 9, 735–744 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. TELIN/TW07, Ghent University, Sint-Pietersnieuwstraat 41, B-9000, Ghent, Belgium

    Johan De Bock, Rui Pires, Patrick De Smet & Wilfried Philips

Authors
  1. Johan De Bock
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Pires
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick De Smet
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wilfried Philips
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DGA/D4S/MRIS, 94114, Arcueil, France

    Jacques Blanc-Talon

  2. Ghent University, 9000, Gent, Belgium

    Wilfried Philips

  3. CSIRO ICT Centre, 1710, Sydney, NSW, Australia

    Dan Popescu

  4. University of Antwerp, 2610, Wilrijk, Belgium

    Paul Scheunders

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Bock, J., Pires, R., De Smet, P., Philips, W. (2006). A Fast Dynamic Border Linking Algorithm for Region Merging. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2006. Lecture Notes in Computer Science, vol 4179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864349_21

Download citation

  • DOI: https://doi.org/10.1007/11864349_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44630-9

  • Online ISBN: 978-3-540-44632-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation