F. Sergeraert, Effective homology, a survey, Papers/Survey.pdf, issue.11, 1992.

R. Forman, Available: http://www.emis.ams.org/journals/SLC/wpapers/s48forman.pdf Fig. 11 Up: a DGVF over the Dunce hat with three critical cells in blue. Down: the perfect DVF given by the correction step. The only one critical cell is 1. The two cycles in the graph are displayed in purple. [3] H. Molina-Abril and P. Real, " Homological spanning forest framework for 2d image analysis, Seminaire Lotharingin de Combinatoire Annals of Mathematics and Artificial Intelligence, vol.48, issue.64 4, pp.48-385, 2002.

J. R. Munkres, Elements of algebraic topology, 1984.

A. Hatcher, Algebraic topology, 2002.

J. Mari and P. , Simplicialization of digital volumes in 26-adjacency: Application to topological analysis, Pattern Recognition and Image Analysis, vol.19, issue.2, pp.231-238, 2009.
DOI : 10.1134/S1054661809020035
URL : https://hal.archives-ouvertes.fr/hal-01341031

P. Real and H. Molina, Cell AT-Models for Digital Volumes, Lecture Notes in Computer Science, vol.41, issue.3, pp.314-323, 2009.
DOI : 10.1016/j.comgeo.2008.02.003
URL : http://hdl.handle.net/11441/31749

M. Giesbrecht, Probabilistic computation of the Smith normal form of a sparse integer matrix, Lecture Notes in Computer Science, vol.1122, pp.173-186, 1996.
DOI : 10.1007/3-540-61581-4_53

J. Dumas, F. Heckenbach, D. Saunders, and V. Welker, Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms, Algebra, Geometry and Software Systems, pp.177-206, 2003.
DOI : 10.1007/978-3-662-05148-1_10

T. Kaczyski, M. Mrozek, and M. Lusarek, Homology computation by reduction of chain complexes, Computers & Mathematics with Applications, vol.35, issue.4, pp.59-70, 1998.
DOI : 10.1016/S0898-1221(97)00289-7

S. Peltier, A. Ion, W. Kropatsch, G. Damiand, and Y. Haxhimusa, Directly computing the generators of image homology using graph pyramids, Image and Vision Computing, vol.27, issue.7, pp.846-853, 2009.
DOI : 10.1016/j.imavis.2008.06.009
URL : https://hal.archives-ouvertes.fr/hal-00366086

C. J. Delfinado and H. Edelsbrunner, An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere, Computer Aided Geometric Design, vol.12, issue.7, pp.771-784, 1995.
DOI : 10.1016/0167-8396(95)00016-Y

A. Zomorodian and G. Carlsson, Computing Persistent Homology, Discrete & Computational Geometry, vol.33, issue.2, pp.249-274, 2005.
DOI : 10.1007/s00454-004-1146-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5064

D. Boltcheva, D. Canino, S. Merino-aceituno, J. C. Léon, L. De-floriani et al., An iterative algorithm for homology computation on simplicial shapes, Computer-Aided Design, vol.43, issue.11, pp.1457-1467, 2011.
DOI : 10.1016/j.cad.2011.08.015
URL : https://hal.archives-ouvertes.fr/hal-00644410

T. Lewiner, H. Lopes, and G. Tavares, Toward Optimality in Discrete Morse Theory, Experimental Mathematics, vol.12, issue.3, pp.271-28552321, 2003.
DOI : 10.2307/1969769

A. Engstrom, Discrete Morse Functions from Fourier Transforms, Experimental Mathematics, vol.18, issue.1, pp.45-54, 2009.
DOI : 10.1080/10586458.2009.10128886

H. Molina-abril and P. , Homological optimality in Discrete Morse Theory through chain homotopies, Topology in Image Context, pp.1501-1506, 2012.
DOI : 10.1016/j.patrec.2012.01.014

P. Dotko and H. Wagner, Computing homology and persistent homology using iterated morse decomposition, pp.1-311429, 1210.

R. Ayala, D. Fernández-ternero, J. A. Vilches, and M. Hachimori, Perfect discrete Morse functions on 2-complexes, Pattern Recognition Letters, vol.33, issue.11, pp.1495-1500, 2012.
DOI : 10.1016/j.patrec.2011.08.011
URL : http://hdl.handle.net/11441/26183