An efficient algorithm for attribute openings and closings
暂无分享,去创建一个
[1] Mark Fisher,et al. An Efficient Implementation of Max Tree with Linked List and Hash Table , 2003, DICTA.
[2] Philippe Salembier,et al. Antiextensive connected operators for image and sequence processing , 1998, IEEE Trans. Image Process..
[3] Pierre Soille,et al. Morphological Image Analysis: Principles and Applications , 2003 .
[4] Michael H. F. Wilkinson,et al. A Comparison of Algorithms for Connected Set Openings and Closings , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[5] L. Vincent. Grayscale area openings and closings, their efficient implementation and applications , 1993 .
[6] Ronald Jones,et al. Attribute Openings, Thinnings, and Granulometries , 1996, Comput. Vis. Image Underst..
[7] Michel Couprie,et al. Quasilinear algorithm for the component tree , 2004, IS&T/SPIE Electronic Imaging.
[8] Wim H. Hesselink. Salembier's Min-tree algorithm turned into breadth first search , 2003, Inf. Process. Lett..
[9] Ronald Jones,et al. Connected Filtering and Segmentation Using Component Trees , 1999, Comput. Vis. Image Underst..
[10] Philippe Salembier,et al. Connected operators and pyramids , 1993, Optics & Photonics.
[11] Pascal Monasse,et al. Grain Filters , 2002, Journal of Mathematical Imaging and Vision.
[12] Scott T. Acton,et al. Scale space classification using area morphology , 2000, IEEE Trans. Image Process..
[13] José Crespo,et al. The flat zone approach: A general low-level region merging segmentation method , 1997, Signal Process..