
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael H.F. Wilkinson, Hui Gao, Wim H. Hesselink, JanEppo Jonker, Arnold Meijster, "Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 10, pp. 18001813, October, 2008.  
BibTex  x  
@article{ 10.1109/TPAMI.2007.70836, author = {Michael H.F. Wilkinson and Hui Gao and Wim H. Hesselink and JanEppo Jonker and Arnold Meijster}, title = {Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {30}, number = {10}, issn = {01628828}, year = {2008}, pages = {18001813}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2007.70836}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines IS  10 SN  01628828 SP1800 EP1813 EPD  18001813 A1  Michael H.F. Wilkinson, A1  Hui Gao, A1  Wim H. Hesselink, A1  JanEppo Jonker, A1  Arnold Meijster, PY  2008 KW  Filtering KW  Enhancement Parallel algorithms KW  mathematical morphology KW  connected filters VL  30 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] F.J. Seinstra, D. Koelma, and J.M. Geusebroek, “A Software Architecture for User Transparent Parallel Image Processings,” Parallel Computing, vol. 28, pp. 967993, 2002.
[2] T. Hirata, “A Unified LinearTime Algorithm for Computing Distance Maps,” Information Processing Letters, vol. 58, pp. 129133, 1996.
[3] A. Meijster, J.B.T.M. Roerdink, and W.H. Hesselink, “A General Algorithm for Computing Distance Transforms in Linear Time,” Proc. Int'l Symp. Math. Morphology (ISMM '00), pp. 331340, June 2000.
[4] P. Salembier and J. Serra, “Flat Zones Filtering, Connected Operators, and Filters by Reconstruction,” IEEE Trans. Image Processing, vol. 4, pp. 11531160, 1995.
[5] E.J. Breen and R. Jones, “Attribute Openings, Thinnings and Granulometries,” Computer Visualization and Image Understanding, vol. 64, no. 3, pp. 377389, 1996.
[6] H.J.A.M. Heijmans, “Connected Morphological Operators for Binary Images,” Computer Visualization and Image Understanding, vol. 73, pp. 99120, 1999.
[7] J.C. Klein, “Conception et Réalisation d'une Unité Logique Pour l'analyse Quantitative d'images,” PhD dissertation, Nancy Univ., 1976.
[8] L. Vincent, “Morphological Grayscale Reconstruction in Image Analysis: Application and Efficient Algorithm,” IEEE Trans. Image Processing, vol. 2, pp. 176201, 1993.
[9] F. Cheng and A.N. Venetsanopoulos, “An Adaptive Morphological Filter for Image Processing,” IEEE Trans. Image Processing, vol. 1, pp. 533539, 1992.
[10] L. Vincent, “Morphological Area Openings and Closings for GreyScale Images,” Proc. NATO Shape in Picture Workshop: Math. Description of Shape in GreyLevel Images, Y.L. O, A. Toet, D. Foster, H.J.A.M. Heijmans, and P. Meer, eds., pp. 197208, 1993.
[11] P. Salembier, A. Oliveras, and L. Garrido, “AntiExtensive Connected Operators for Image and Sequence Processing,” IEEE Trans. Image Processing, vol. 7, pp. 555570, 1998.
[12] E.R. Urbach and M.H.F. Wilkinson, “ShapeOnly Granulometries and GreyScale Shape Filters,” Proc. Int'l Symp. Math. Morphology (ISMM '02), pp. 305314, 2002.
[13] E.R. Urbach, J.B.T.M. Roerdink, and M.H.F. Wilkinson, “Connected ShapeSize Pattern Spectra for Rotation and ScaleInvariant Classification of GrayScale Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, pp. 272285, 2007.
[14] M.H.F. Wilkinson and M.A. Westenberg, “Shape Preserving Filament Enhancement Filtering,” Proc. Medical Image Computing and ComputerAssisted Intervention (MICCAI '01), W.J. Niessen and M.A. Viergever, eds., pp. 770777, 2001.
[15] A. Meijster and M.H.F. Wilkinson, “A Comparison of Algorithms for Connected Set Openings and Closings,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 484494, Apr. 2002.
[16] R.E. Tarjan, “Efficiency of a Good But Not Linear Set Union Algorithm,” J. ACM, vol. 22, pp. 215225, 1975.
[17] R. Jones, “Connected Filtering and Segmentation Using Component Trees,” Computer Visualization and Image Understanding, vol. 75, pp. 215228, 1999.
[18] L. Najman and M. Couprie, “Building the Component Tree in QuasiLinear Time,” IEEE Trans. Image Processing, vol. 15, pp.35313539, 2006.
[19] S. Morse, “Concepts of Use in Computer Map Processing,” Comm. ACM, vol. 12, pp. 147152, 1969.
[20] J. Roubal and T.K. Peucker, “Automated Contour Labeling and the Contour Tree,” Proc. Int'l Symp. ComputerAssisted Cartography (AUTOCARTO '85), pp. 472481, 1985.
[21] M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore, “Contour Trees and Small Seed Sets for IsoSurface Traversal,” Proc. 13th Ann. Symp. Computational Geometry, pp. 212220, 1997.
[22] H. Carr, J. Snoeyink, and U. Axen, “Computing Contour Trees in All Dimensions,” Computational Geometry, vol. 24, pp. 7594, 2003.
[23] V. Pascucci and K. ColeMcLaughlin, “Efficient Computation of the Topology of Level Sets,” Proc. IEEE Visualization, pp. 187194, 2002.
[24] P. Monasse and F. Guichard, “Fast Computation of a Contrast Invariant Image Representation,” IEEE Trans. Image Processing, vol. 9, pp. 860872, 2000.
[25] G. Bertrand, “On Topological Watersheds,” J. Math. Imaging and Vision, vol. 22, pp. 217230, 2005.
[26] M. Couprie, L. Najman, and G. Bertrand, “QuasiLinear Algorithms for the Topological Watershed,” J. Math. Imaging and Vision, vol. 22, pp. 231249, 2005.
[27] U. BragaNeto and J. Goutsias, “A Theoretical Tour of Connectivity in Image Processing and Analysis,” J. Math. Imaging and Vision, vol. 19, pp. 531, 2003.
[28] J. Serra, “Connectivity on Complete Lattices,” J. Math. Imaging and Vision, vol. 9, pp. 231251, 1998.
[29] P. Maragos and R.D. Ziff, “Threshold Decomposition in Morphological Image Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 5, pp. 498504, May 1990.
[30] W.H. Hesselink, A. Meijster, and C. Bron, “Concurrent Determination of Connected Components,” Science of Computer Programming, vol. 41, pp. 173194, 2001.
[31] C. Berger, T. Geraud, R. Levillain, N. Widynski, A. Baillard, and E. Bertin, “Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging,” Proc. Int'l Conf. Image Processing, Sept. 2007.
[32] C. Fiorio and J. Gustedt, “Two Linear Time UnionFind Strategies for Image Processing,” Theoretical Computer Science (A), vol. 154, pp. 165181, 1996.
[33] B.A. Galler and M.J. Fischer, “An Improved Equivalence Algorithm,” Comm. ACM, vol. 7, pp. 301303, 1964.
[34] S. Owicki and D. Gries, “An Axiomatic Proof Technique for Parallel Programs,” Acta Informatica, vol. 6, pp. 319340, 1976.
[35] W.H. Hesselink, “Salembier's MinTree Algorithm Turned into Breadth First Search,” Information Processing Letters, vol. 88, no. 5, pp. 225229, 2003.
[36] M.K. Hu, “Visual Pattern Recognition by Moment Invariants,” IRE Trans. Information Theory, vol. 8, pp. 179187, 1962.
[37] A. Kanitsar, T. Theussl, L. Mroz, M. Sramek, A.V. Bartoli, B. Csebfalvi, J. Hladuvka, D. Fleischmann, M. Knapp, R. Wegenkittl, P. Felkel, S. Roettger, W.P. Stefan Guthe, and M.E. Groeller, “Christmas Tree Case Study: Computed Tomography as a Tool for Mastering Complex Real World Objects with Applications in Computer Graphics,” Proc. Visualization, pp. 489492, 2002.
[38] G.K. Ouzounis and M.H.F. Wilkinson, “MaskBased Second Generation Connectivity and Attribute Filters,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, pp. 9901004, 2007.
[39] G.K. Ouzounis and M.H.F. Wilkinson, “A Parallel DualInput MaxTree Algorithm for Shared Memory Machines,” Proc. Int'l Symp. Math. Morphology (ISMM '07), pp. 449460, 2007.