The following pages link to Robin Strand (Q442112):
Displayed 33 items.
- Distance transform computation for digital distance functions (Q442114) (← links)
- Exact evaluation of targeted stochastic watershed cuts (Q528342) (← links)
- Digital distance functions on three-dimensional grids (Q630601) (← links)
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid (Q630602) (← links)
- Distances based on neighbourhood sequences in non-standard three-dimensional grids (Q869576) (← links)
- Weighted distance transforms generalized to modules and their computation on point lattices (Q885192) (← links)
- Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids (Q967397) (← links)
- Weighted distances based on neighborhood sequences for point-lattices (Q1028456) (← links)
- The minimum barrier distance: a summary of recent advances (Q1690378) (← links)
- The Boolean map distance: theory and efficient computation (Q1690418) (← links)
- Distance functions based on multiple types of weighted steps combined with neighborhood sequences (Q1799656) (← links)
- Mathematical morphology on irregularly sampled data in one dimension (Q1980877) (← links)
- Adaptive mathematical morphology on irregularly sampled signals in two dimensions (Q1980896) (← links)
- Mathematical morphology on irregularly sampled data applied to segmentation of 3D point clouds of urban scenes (Q2189390) (← links)
- Aliasing Properties of Voxels in Three-Dimensional Sampling Lattices (Q2896439) (← links)
- Path-Based Distance with Varying Weights and Neighborhood Sequences (Q3000700) (← links)
- Sparse Object Representations by Digital Distance Functions (Q3000701) (← links)
- Anti-Aliased Euclidean Distance Transform on 3D Sampling Lattices (Q3190067) (← links)
- The Minimum Barrier Distance – Stability to Seed Point Position (Q3190069) (← links)
- Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids (Q3651606) (← links)
- Neighborhood Sequences in the Diamond Grid – Algorithms with Four Neighbors (Q3651607) (← links)
- Digital Distances and Integer Sequences (Q4924470) (← links)
- A Weight Sequence Distance Function (Q4925120) (← links)
- Faster Fuzzy Connectedness via Precomputation (Q4925146) (← links)
- Distance Transform Based on Weight Sequences (Q5237046) (← links)
- Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision (Q5237061) (← links)
- NON-TRADITIONAL GRIDS EMBEDDED IN ℤ<sup>n</sup> (Q5305549) (← links)
- Discrete Geometry for Computer Imagery (Q5316557) (← links)
- Generating Distance Maps with Neighbourhood Sequences (Q5386031) (← links)
- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms (Q5458887) (← links)
- Combinatorial Image Analysis (Q5465800) (← links)
- Minimal Paths by Sum of Distance Transforms (Q5739410) (← links)
- When can \(l_p\)-norm objective functions be minimized via graph cuts? (Q6165904) (← links)