Algorithm to Compute a Minimal Length Basis of Representative Cocycles of Cohomology Generators
An algorithm to compute a minimal length basis of representative cocycles of cohomology generators for 2D images is proposed. We based the computations on combinatorial pyramids foreseeing its future extension to 3D objects. In our research we are looking for a more refined topological description o...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/26215 |
| Acesso em linha: | http://hdl.handle.net/11441/26215 |
| Access Level: | acceso abierto |
| Palavra-chave: | Cohomology Combinatorial pyramids Representative cocycles of cohomology generators |
| Resumo: | An algorithm to compute a minimal length basis of representative cocycles of cohomology generators for 2D images is proposed. We based the computations on combinatorial pyramids foreseeing its future extension to 3D objects. In our research we are looking for a more refined topological description of deformable 2D and 3D shapes, than they are the often used Betti numbers. We define contractions on the object edges toward the inner of the object until the boundaries touch each other, building an irregular pyramid with this purpose. We show the possible use of the algorithm seeking the minimal cocycles that connect the convex deficiencies on a human silhouette. We used minimality in the number of cocycle edges in the basis, which is a robust description to rotations and noise. |
|---|