A fast component-tree algorithm for high dynamic-range images and second generation connectivity

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2011, Pages 1021-1024

  Wilkinson, Michael H F ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

astronomical imaging; attribute filters; component trees; high dynamic range images; mask based connectivity; Mathematical morphology

Indexed keywords

ASTRONOMICAL IMAGING; ATTRIBUTE FILTERS; COMPONENT TREES; MASK-BASED CONNECTIVITY; RANGE IMAGES;

ALGORITHMS; DATA STRUCTURES; FORESTRY; IMAGE PROCESSING; MATHEMATICAL MORPHOLOGY;

TREES (MATHEMATICS);

ALGORITHMS; DATA; FORESTRY; IMAGE ANALYSIS; MATHEMATICS; TREES;

EID: 84856274654     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2011.6115597     Document Type: Conference Paper

References (18)

1. P. Salembier and M. H. F.Wilkinson, "Connected operators: A review of region-based morphological image processing techniques,"IEEE Signal Processing Magazine, vol. 26, no. 6, pp. 136-157, 2009.
2. M. H. F.Wilkinson and G. K. Ouzounis, "Advances in connectivity and connected attribute filters," in Advances in Imaging and Electron Physics, Peter W. Hawkes, Ed., vol. 161, pp. 211- 275. Elsevier, 2010.
3. R. Jones, "Connected filtering and segmentation using component trees," Comp. Vis. Image Understand., vol. 75, pp. 215-228, 1999. (Pubitemid 30508596)
4. V. Metzler, T. Aach, and C. Ties, "A novel object-oriented approach to image analysis and retrieval," in Proc. 5th IEEE Southwest Symp. Image Anal. Interpret., 2002, pp. 14-18.
5. J. Serra, "A lattice approach to image segmentation," J. Math. Imag. Vis., vol. 24, no. 1, pp. 83-130, 2006.
6. E. J. Breen and R. Jones, "Attribute openings, thinnings and granulometries," Comp. Vis. Image Understand., vol. 64, no. 3, pp. 377-389, 1996.
7. P. Salembier, A. Oliveras, and L. Garrido, "Anti-extensive connected operators for image and sequence processing," IEEE Trans. Image Proc., vol. 7, pp. 555-570, 1998. (Pubitemid 128745371)
8. L. Najman and M. Couprie, "Building the component tree in quasi-linear time," IEEE Trans. Image Proc., vol. 15, pp. 3531-3539, 2006. (Pubitemid 44615146)
9. G. K. Ouzounis and M. H. F. Wilkinson, "Mask-based second generation connectivity and attribute filters," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, pp. 990-1004, 2007.
10. G. K. Ouzounis and M. H. F. Wilkinson, "Hyperconnected attribute filters based on k-flat zones," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 2, pp. 224-239, 2011.
11. F. Cheng and A. N. Venetsanopoulos, "An adaptive morphological filter for image processing," IEEE Trans. Image Proc., vol. 1, pp. 533-539, 1992.
12. L. Vincent, "Grayscale area openings and closings, their efficient implementation and applications," in Proc. EURASIP Workshop on Mathematical Morphology and its Application to Signal Processing, Barcelona, Spain, 1993, pp. 22-27.
13. C. Berger, Th. Geraud, R. Levillain, N. Widynski, A Baillard, and E. Bertin, "Effective component tree computation with application to pattern recognition in astronomical imaging," in Proc. Int. Conf. Image Proc. 2007, San Antonio, Texas, USA, September 16-19 2007, In press.
14. M. H. F.Wilkinson, H. Gao,W. H. Hesselink, J. E. Jonker, and A. Meijster, "Concurrent computation of attribute filters using shared memory parallel machines," IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 10, pp. 1800-1813, 2008.
15. W. H. Hesselink, "Salembier's Min-tree algorithm turned into breadth first search," Information Processing Letters, vol. 88, no. 5, pp. 225 - 229, 2003.
16. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, 2nd edition, 2001.
17. G. K. Ouzounis and M. H. F.Wilkinson, "A parallel dual-input max-tree algorithm for shared memory machines," in Proc. Int. Symp. Math. Morphology (ISMM) 2007, 2007, pp. 449-460.
18. A. Meijster and M. H. F. Wilkinson, "A comparison of algorithms for connected set openings and closings," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 484-494, 2002. (Pubitemid 34448767)