634 research outputs found
Cubical Cohomology Ring of 3D Photographs
Cohomology and cohomology ring of three-dimensional (3D) objects are
topological invariants that characterize holes and their relations. Cohomology
ring has been traditionally computed on simplicial complexes. Nevertheless,
cubical complexes deal directly with the voxels in 3D images, no additional
triangulation is necessary, facilitating efficient algorithms for the
computation of topological invariants in the image context. In this paper, we
present formulas to directly compute the cohomology ring of 3D cubical
complexes without making use of any additional triangulation. Starting from a
cubical complex that represents a 3D binary-valued digital picture whose
foreground has one connected component, we compute first the cohomological
information on the boundary of the object, by an incremental
technique; then, using a face reduction algorithm, we compute it on the whole
object; finally, applying the mentioned formulas, the cohomology ring is
computed from such information
Obtaining cell complexes associated to four dimensional digital objects
In this paper, we determine a cell complex representation of a 80–adjacent doxelbased 4-dimensional object. The homological information of this polyhedral cell complex can be employed to specify topological features and characteristics of a digital object. This homological information (for example, Euler characteristic, homological classification of cycles, homology generators, relations among them...) of a discrete object can be extracted from some specific boundary operators for each cell of an object (see [3]). The different (up to isometry) polyhedral cells are 400 configurations and their local boundary information can be suitably glued for determining the global boundary of an object and consequently, its corresponding homological information. This fact allows us to implement this technique using a look-up table for the different basic configurations and its corresponding boundary operators
A technique for 3-D robot vision for space applications
An extension of the MIAG algorithm for recognition and motion parameter determination of general 3-D polyhedral objects based on model matching techniques and using Moment Invariants as features of object representation is discussed. Results of tests conducted on the algorithm under conditions simulating space conditions are presented
Efficiently Storing Well-Composed Polyhedral Complexes Computed Over 3D Binary Images
A 3D binary image I can be naturally represented
by a combinatorial-algebraic structure called cubical complex
and denoted by Q(I ), whose basic building blocks are
vertices, edges, square faces and cubes. In Gonzalez-Diaz
et al. (Discret Appl Math 183:59–77, 2015), we presented a
method to “locally repair” Q(I ) to obtain a polyhedral complex
P(I ) (whose basic building blocks are vertices, edges,
specific polygons and polyhedra), homotopy equivalent to
Q(I ), satisfying that its boundary surface is a 2D manifold.
P(I ) is called a well-composed polyhedral complex over the
picture I . Besides, we developed a new codification system
for P(I ), encoding geometric information of the cells
of P(I ) under the form of a 3D grayscale image, and the
boundary face relations of the cells of P(I ) under the form
of a set of structuring elements. In this paper, we build upon
(Gonzalez-Diaz et al. 2015) and prove that, to retrieve topological
and geometric information of P(I ), it is enough to
store just one 3D point per polyhedron and hence neither
grayscale image nor set of structuring elements are needed.
From this “minimal” codification of P(I ), we finally present
a method to compute the 2-cells in the boundary surface of
P(I ).Ministerio de Economía y Competitividad MTM2015-67072-
Combinatorial Boundary Tracking of a 3D Lattice Point Set
Boundary tracking and surface generation are ones of main topological topics for three-dimensional digital image analysis. However, there is no adequate theory to make relations between these different topological properties in a completely discrete way. In this paper, we present a new boundary tracking algorithm which gives not only a set of border points but also the surface structures by using the concepts of combinatorial/algebraic topologies. We also show that our boundary becomes a triangulation of border points (in the sense of general topology), that is, we clarify relations between border points and their surface structures
Connectivity forests for homological analysis of digital volumes
In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the cellular version of the AT-model [5] is precisely described here as three forests (connectivity forests), from which, for instance, we can straightforwardly determine representative curves of “tunnels” and “holes”, classify cycles in the complex, computing higher (co)homology operations,... Depending of the order in which we gradually construct these trees, tools so important in Computer Vision and Digital Image Processing as Reeb graphs and topological skeletons appear as results of pruning these graphs
Digital pseudomanifolds, digital weakmanifolds and Jordan–Brouwer separation theorem
AbstractIn this paper we introduce the new notion of n-pseudomanifold and n-weakmanifold in an (n+1)-digital image using (2(n+1),3(n+1)−1)-adjacency. For these classes, we prove the digital version of the Jordan–Brouwer separation theorem. To accomplish this objective, we construct a polyhedral representation of the (n+1)-digital image based on a cubical complex decomposition which enables us to translate some results from polyhedral topology into the digital space. Our main result extends the class of “thin” objects that are defined locally and verifying the Jordan–Brouwer separation theorem
Advanced homology computation of digital volumes via cell complexes
Given a 3D binary voxel-based digital object V, an algorithm for computing homological information for V via a polyhedral cell complex is designed. By homological information we understand not only Betti numbers, representative cycles of homology classes and homological classification of cycles but also the computation of homology numbers related additional algebraic structures defined on homology (coproduct in homology, product in cohomology, (co)homology operations,...). The algorithm is mainly based on the following facts: a) a local 3D-polyhedrization of any 2×2×2 configuration of mutually 26-adjacent black voxels providing a coherent cell complex at global level; b) a description of the homology of a digital volume as an algebraic-gradient vector field on the cell complex (see Discrete Morse Theory [5], AT-model method [7,5]). Saving this vector field, we go further obtaining homological information at no extra time processing cost
Repairing 3D binary images using the BCC grid with a 4-valued combinatorial coordinate system
A 3D binary image I is called well-composed if the set of points in the topological boundary of the cubes in I is a 2-manifold. Repairing a 3D binary image is a process which produces a well composed image (or a polyhedral complex) from the non-well-composed image I.We propose here to repair 3D images by associating the Body-Centered Cubic grid (BCC grid) to the cubical grid. The obtained polyhedral complex is well composed, since two voxels in the BCC grid either share an entire face or are disjoint. We show that the obtained complex is homotopy equivalent to the cubical complex naturally associated with the image I.To efficiently encode and manipulate the BCC grid, we present an integer 4-valued combinatorial coordinate system that addresses cells of all dimensions (voxels, faces, edges and vertices), and allows capturing all the topological incidence and adjacency relations between cells by using only integer operations.We illustrate an application of this coordinate system on two tasks related with the repaired image: boundary reconstruction and computation of the Euler characteristic
- …