Connectivity in Digital Pictures
From MaRDI portal
Cited in
(74)- Topology on digital label images
- Closure operations for digital topology.
- Extension of continuity of maps between axiomatic locally finite spaces
- In-place algorithm for erasing a connected component in a binary image
- Component-trees and multivalued images: structural properties
- Determining maximum \(k\)-width-connectivity on meshes
- Disk-like tiles and self-affine curves with noncollinear digits
- Tests for connectivity preservation for parallel reduction operators
- A survey of algebraic methods in digital topology.
- A tutorial on well-composedness
- A digital analogue of the Jordan curve theorem
- Adjacencies for recognition of digital Jordan surfaces
- Fast connected-component labeling
- Normal vector and winding number in 2D digital images with their application for hole detection
- On 2-dimensional simple sets in \(n\)-dimensional cubic grids
- Topological properties of thinning in 2-D pseudomanifolds
- Polyhedral digital Jordan surfaces
- scientific article; zbMATH DE number 7034092 (Why is no real title available?)
- Minimal Simple Pairs in the Cubic Grid
- Combinatorics on Adjacency Graphs and Incidence Pseudographs
- A general data structure for image analysis based on a description of connected components
- A note on 3-D simple points and simple-equivalence
- Hole filling in 3D volumetric objects
- Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
- The Khalimsky topologies are precisely those simply connected topologies on \(\mathbb Z^n\) whose connected sets include all 2\(n\)-connected sets but no (3\(^{n}-1\))-disconnected sets.
- Graphs with a path partition for structuring digital spaces
- Dimensional properties of graphs and digital spaces.
- Low-latency connected component labeling using an FPGA
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Topology-preserving conditions for 2D digital images under rigid transformations
- Computing connectedness: disconnectedness and discreteness.
- Closure operators on graphs for modeling connectedness in digital spaces
- Designing a new software tool for digital imagery based on P systems
- A digital Jordan surface theorem with respect to a graph connectedness
- A topological characterization of thinning
- Topology-preserving thinning in 2-D pseudomanifolds
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Optimal conditions for connectedness of discretized sets
- Pushdown automata on arrays
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
- Guest editors' preface to special issue on digital topology
- Algebraic invariants in abstract cellular complex
- Paths, homotopy and reduction in digital images
- A general scheme for constructing skeleton models
- A Jordan curve theorem for 2-dimensional tilings
- Digital geometry
- Digital topology on adaptive octree grids
- Automatic segmentation of metaphase cells based on global context and variant analysis
- Topological Complexities of Finite Digital Images
- Bridging graph-theoretical and topological approaches: connectivity and Jordan curves in the digital plane
- Border tracing in oriented adjacency graphs of polygonal tilings
- Semi-topological properties of the K-topological version of the Jordan curve theorem
- A Jordan curve theorem with respect to certain closure operations on the digital plane
- Digital Jordan curves and surfaces with respect to a graph connectedness
- A continuous analog for 4-dimensional objects
- A criterion on thinning in digital pictures
- Homological spanning forest framework for 2D image analysis
- Closure operators associated with relations
- Linear quadtrees: A blocking technique for contour filling
- Relation-induced connectedness in the digital plane
- Consistent connected operators based on trees of shapes
- The encoding of arbitrary surfaces in 3-dimensional space
- The boundary and the shape of binary images
- Digital imaging: a unified topological framework
- Connectivity with respect to \(\alpha\)-discrete closure operators
- Cellular topology and its applications in image processing
- A convenient graph connectedness for digital imagery
- Semi-Jordan curve theorem on the Marcus-Wyse topological plane
- Topological properties of the intersection graph of covers of \(n\)-dimensional surfaces
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- Shape-based analysis on component-graphs for multivalued image processing
- A fast scan-line algorithm for topological filling of well-nested objects in 2.5D digital pictures
- An efficient algorithm for smoothing, linearization and detection of structural feature points of binary image contours
- A new algorithmic framework for basic problems on binary images
This page was built for publication: Connectivity in Digital Pictures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5610107)
