The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2011 vol.33)
pp: 1646-1658
Vanessa Robins , The Australian National University, Canberra
Peter John Wood , The Australian National University, Canberra
Adrian P. Sheppard , The Australian National University, Canberra
ABSTRACT
We present an algorithm for determining the Morse complex of a two or three-dimensional grayscale digital image. Each cell in the Morse complex corresponds to a topological change in the level sets (i.e., a critical point) of the grayscale image. Since more than one critical point may be associated with a single image voxel, we model digital images by cubical complexes. A new homotopic algorithm is used to construct a discrete Morse function on the cubical complex that agrees with the digital image and has exactly the number and type of critical cells necessary to characterize the topological changes in the level sets. We make use of discrete Morse theory and simple homotopy theory to prove correctness of this algorithm. The resulting Morse complex is considerably simpler than the cubical complex originally used to represent the image and may be used to compute persistent homology.
INDEX TERMS
Discrete Morse theory, computational topology, persistent homology, digital topology.
CITATION
Vanessa Robins, Peter John Wood, Adrian P. Sheppard, "Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 8, pp. 1646-1658, August 2011, doi:10.1109/TPAMI.2011.95
REFERENCES
[1] V.A. Kovalevsky, "Finite Topology as Applied to Image Analysis," Computer Vision, Graphics, and Image Processing, vol. 46, no. 2, pp. 141-161, 1989.
[2] M. Couprie, F.N. Bezerra, and G. Bertrand, "Topological Operators for Grayscale Image Processing," J. Electronic Imaging, vol. 10, no. 4, pp. 1003-1015, 2001.
[3] M. Couprie and G. Bertrand, "New Characterizations of Simple Points, Minimal Non-Simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces," Proc. 14th IAPR Int'l Conf. Discrete Geometry for Computer Imagery, pp. 105-116, 2008.
[4] M. Couprie and G. Bertrand, "New Characterizations of Simple Points in 2D, 3D and 4D Discrete Spaces," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 4, pp. 637-648, Apr. 2009.
[5] H. Edelsbrunner, D. Letscher, and A. Zomorodian, "Topological Persistence and Simplification," Discrete Computational Geometry, vol. 28, pp. 511-533, 2002.
[6] D. Laney, P.-T. Bremer, A. Mascarenhas, P. Miller, and V. Pascucci, "Understanding the Structure of the Turbulent Mixing Layer in Hydrodynamic Instabilities," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 1053-1060, Sept./Oct. 2006.
[7] L. Vincent and P. Soille, "Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583-598, June 1991.
[8] R. Jones, "Connected Filtering and Segmentation Using Component Trees," Computer Vision and Image Understanding, vol. 75, pp. 215-228, 1999.
[9] A. Cayley, "On Contour and Slope Line," The Philosophical Magazine, vol. 18, no. 120, pp. 264-268, 1859.
[10] J.C. Maxwell, "On Hills and Dales," The Philosophical Magazine, vol. 40, no. 269, pp. 421-427, 1870.
[11] J. Milnor, Morse Theory, (Annals of Mathematical Studies 51). Princeton Univ. Press, 1969.
[12] H. Edelsbrunner, J. Harer, and A. Zomorodian, "Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds," Proc. 17th Ann. Symp. Computational Geometry, pp. 70-79, 2001.
[13] S. Biasotti, L. De Floriani, B. Falcidieno, P. Frosini, D. Giorgi, C. Landi, L. Papaleo, and M. Spagnuolo, "Describing Shapes by Geometrical-Topological Properties of Real Functions," ACM Computing Surveys, vol. 40, no. 4, pp. 1-87, 2008.
[14] R. Forman, "Morse Theory for Cell Complexes," Advances in Math., vol. 134, pp. 90-145, 1998.
[15] R. Forman, "A User's Guide to Discrete Morse Theory," Séminaire Lotharingien de Combinatoire, vol. 48, 2002.
[16] T.F. Banchoff, "Critical Points and Curvature for Embedded Polyhedral Surfaces," The Am. Math. Monthly, vol. 77, no. 5, pp. 475-485, http://www.jstor.org/stable2317380, 1970.
[17] H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, "Morse-Smale Complexes for Piecewise Linear 3-Manifolds," Proc. 19th Ann. Symp. Computational Geometry, pp. 361-370, 2003.
[18] A. Gyulassy, V. Natarajan, V. Pascucci, and B. Hamann, "Efficient Computation of Morse-Smale Complexes for Three-Dimensional Scalar Functions," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 6, pp. 1440-1447, Nov./Dec. 2007.
[19] T. Lewiner, H. Lopes, and T. Geovan, "Optimal Discrete Morse Functions for 2-Manifolds," Computational Geometry: Theory and Applications, vol. 26, pp. 221-233, 2003.
[20] T. Lewiner, H. Lopes, and T. Geovan, "Towards Optimality in Discrete Morse Theory," Experimental Math., vol. 12, pp. 271-285, 2003.
[21] T. Lewiner, "Geometric Discrete Morse Complexes," PhD dissertation, Pontifícia Universidade Católica do Rio de Janeiro, 2005.
[22] H. King, K. Knudson, and N. Mramor, "Genering Discrete Morse Functions from Point Data," Experimental Math., vol. 14, pp. 435-444, 2005.
[23] A. Gyulassy, P.-T. Bremer, B. Hamann, and V. Pascucci, "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1619-1626, Nov./Dec. 2008.
[24] A. Gyulassy, "Combinatorial Construction of Morse-Smale Complexes for Data Analysis and Visualization," PhD dissertation, Univ. of California, Davis, Dec. 2008.
[25] A. Hatcher, Algebraic Topology. Cambridge Univ. Press, Nov. 2001.
[26] J.R. Munkres, Elements of Algebraic Topology. Perseus Books Publishing, 1984.
[27] V. Robins, "Towards Computing Homology from Finite Approximations," Proc. Topology , vol. 24, pp. 503-532, 1999.
[28] J.H.C. Whitehead, "Simplicial Spaces, Nuclei, and $m$ -Groups," Proc. London Math. Soc., vol. 45, no. 2, pp. 243-327, 1939.
[29] R. Bott, Morse Theory Indomitable, vol. 68, pp. 99-114. Publications Mathématiques de l'I.H.É.S., 1988.
[30] C.J.A. Delfinado and H. Edelsbrunner, "An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere," Computer Aided Geometric Design, vol. 12, pp. 771-784, 1995.
[31] A. Sakellariou, T.J. Senden, T.J. Sawkins, M.A. Knackstedt, A. Limaye, C.H. Arns, A.P. Sheppard, and R.M. Sok, "An X-Ray Tomography Facility for a Wide Range of Mesoscale Physics Applications," Proc. SPIE, vol. 5535, pp. 166-171, 2004.
[32] A. Zomorodian, "Computational Topology," Algorithms and Theory of Computation Handbook, second ed., M. Atallah and M. Blanton, eds., Chapman & Hall/CRC Press, 2009.
[33] Drishti—Volume Exploration and Presentation Tool, Ser. Visualization. Baltimore: IEEE, Poster Presentation, 2006.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool