Fast Implementation of the Ultimate Opening
暂无分享,去创建一个
[1] Michael H. F. Wilkinson,et al. A Comparison of Algorithms for Connected Set Openings and Closings , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[2] Serge Beucher,et al. Numerical residues , 2007, Image Vis. Comput..
[3] T. Retornaz. Détection de textes enfouis dans des bases d’images généralistes : un descripteur sémantique pour l’indexation , 2007 .
[4] Retornaz Thomas,et al. ULTIMATE OPENING IMPLEMENTATION BASED ON A FLOODING PROCESS , 2007 .
[5] Mark Fisher,et al. An Efficient Implementation of Max Tree with Linked List and Hash Table , 2003, DICTA.
[6] Philippe Salembier,et al. Antiextensive connected operators for image and sequence processing , 1998, IEEE Trans. Image Process..
[7] Ronald Jones,et al. Attribute Openings, Thinnings, and Granulometries , 1996, Comput. Vis. Image Underst..
[8] Philippe Salembier,et al. Connected operators based on region-tree pruning strategies , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.
[9] Luís Garrido Ostermann. Hierarchical region based processing of images and video sequences: application to filtering, segmentation and information retrieval , 2002 .
[10] Michel Couprie,et al. Building the Component Tree in Quasi-Linear Time , 2006, IEEE Transactions on Image Processing.
[11] Beatriz Marcotegui,et al. Scene text localization based on the ultimate opening , 2007, ISMM.