On efficient sparse integer matrix Smith normal form computations
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Geometry of Digital Spaces
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the cohomology of 3D digital images
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Computation of homology groups and generators
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Algebraic topological analysis of time-sequence of digital images
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Integral Operators for Computing Homology Generators at Any Dimension
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
A tool for integer homology computation: λ-AT-model
Image and Vision Computing
Using Membrane Computing for Obtaining Homology Groups of Binary 2D Digital Images
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Extending the notion of AT-model for integer homology computation
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
| Hi-index | 0.00 |
In this paper, algorithms for computing integer (co)homology of a simplicial complex of any dimension are designed, extending the work done in [1,2,3] For doing this, the homology of the object is encoded in an algebraic-topological format (that we call AM-model) Moreover, in the case of 3D binary digital images, having as input AM-models for the images I and J, we design fast algorithms for computing the integer homology of I ∪J, I ∩J and I ∖J.