An efficient strategy for implementing iterative area openings using the max tree

Huang, Xiaoqiang, Fisher, Mark H., Zhu, Yanong, Aldridge, Richard V. and Smith, Dan J. (2003) An efficient strategy for implementing iterative area openings using the max tree. In: Proceedings of the 8th Australian and New Zealand Intelligent Information Systems Conference (ANZIIS'2003), 2003-12-10 - 2003-12-12.

Full text not available from this repository. (Request a copy)

Abstract

Area opening is an important morphological connected set operator that features in removing upper level sets from an image whose area properties are smaller than a threshold lambda. Existing algorithms found in the literature that implement the area opening operator are based on either priority queues, the max tree or the union-find approach. In this paper we explore the advantages of using the max tree based approach for iterative area opening. Iteratively applying an area opening is the central idea underpinning all scale based image decompositions. An efficient implementation strategy for iterative area opening is therefore very important if scale based image processing algorithms are to be successfully applied in real time computer vision applications. This paper builds on recently published work comparing approaches for implementing area openings, and improves on the method proposed for image reconstruction via a max tree. Experimental results are presented that show the new approach proposed in this paper obtains a performance gain of 25% with images of reasonable big size (320 × 256)

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 23 Jul 2011 15:32
Last Modified: 09 Sep 2020 00:09
URI: https://ueaeprints.uea.ac.uk/id/eprint/23495
DOI:

Actions (login required)

View Item View Item