Sequential Operations in Digital Picture Processing
From MaRDI portal
Cited in
(69)- Weighted distances based on neighborhood sequences for point-lattices
- Visible vectors and discrete Euclidean medial axis
- A general scheme for constructing skeleton models
- Parallel computation of distance transforms
- The t-cost distance in digital geometry
- Shape description using weighted symmetric axis features
- Analysis and implementation of morphological skeleton transforms
- A unified linear-time algorithm for computing distance maps
- Kaplan-Meier estimators of distance distributions for spatial point processes
- Normal vector and winding number in 2D digital images with their application for hole detection
- A topology-preserving parallel 3D thinning algorithm for extracting the curve skeleton.
- Closure systems and their structure
- Algebraic distance estimations for enriched isogeometric analysis
- Closure spaces that are not uniquely generated
- A tutorial on well-composedness
- Distance functions based on multiple types of weighted steps combined with neighborhood sequences
- Weighted digital distance transforms in four dimensions
- Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems
- Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics
- A pruning algorithm for stable Voronoi skeletons
- Digital imaging: a unified topological framework
- A locally conservative multiphase level set method for capillary-controlled displacements in porous media
- Identifying and tracking bubbles and drops in simulations: a toolbox for obtaining sizes, lineages, and breakup and coalescence statistics
- Stochastic distance transform: theory, algorithms and applications
- Transformations of discrete closure systems
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Fast connected-component labeling
- Covering graphs with convex sets and partitioning graphs into convex sets
- Comparative study and proof of single-pass connected components algorithms
- Almost regular metrics on groups and Lipschitz-continuity of distance transforms
- Computational processes that appear to model human memory
- Covering a Euclidean line or hyperplane by dilations of its discretization
- Binary-image comparison with local-dissimilarity quantification
- A lattice approach to image segmentation
- Skeletonization based on error reduction
- Confidence regions for means of random sets using oriented distance functions
- Generating and enumerating digitally convex sets of trees
- Reconstructing trees from digitally convex sets
- Adaptive generalized metrics, distance maps and nearest neighbor transforms on gray tone images
- Distance transform computation for digital distance functions
- Extraction of lesion-partitioned features and retrieval of contrast-enhanced liver images
- Separable distance transformation and its applications
- On the structure of streamwise wall-shear stress fluctuations in turbulent channel flows
- Graph connectivity in log steps using label propagation
- Bayesian model and dimension reduction for uncertainty propagation: applications in random media
- Stochastic distance transform
- A new algorithmic framework for basic problems on binary images
- Medial Axis LUT Computation for Chamfer Norms Using $\mathcal{H}$ -Polytopes
- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
- Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the nD-EVM
- Two dimensional fuzzy regular languages
- On the validity of the two raster sequences distance transform algorithm
- Exploration of 2D and 3D environments using Voronoi transform and fast marching method
- Expectations of random sets and their boundaries using oriented distance functions
- Paths, homotopy and reduction in digital images
- Digital distance functions on three-dimensional grids
- Towards a new framework for domination
- Toward the development of a virtual spray test-rig using the smoothed particle hydrodynamics method
- NetXtractor: an efficient algorithm for pore network extraction from porous media images
- Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs
- The t-cost-m-neighbour distance in digital geometry
- Medial axis lookup table and test neighborhood computation for 3D chamfer norms
- A linear-time algorithm for Euclidean feature transform sets
- Weighted distance transforms generalized to modules and their computation on point lattices
- Modeling attention to salient proto-objects
- Finding a minimum medial axis of a discrete shape is NP-hard
- Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids
- Fast distance transformation on irregular two-dimensional grids
This page was built for publication: Sequential Operations in Digital Picture Processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519703)
