Weighted distance transforms generalized to modules and their computation on point lattices
From MaRDI portal
Publication:885192
DOI10.1016/J.PATCOG.2007.01.001zbMATH Open1120.68093arXiv0808.0665OpenAlexW2156838423MaRDI QIDQ885192FDOQ885192
Authors: Céline Fouard, Robin Strand, Gunilla Borgefors 
Publication date: 8 June 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Abstract: This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance, metric, norm) of weighted distances on modules. It resumes tools found in literature to express the weighted distance of any point of a module and to compute optimal weights in the general case to get rotation invariant distances. The second part of this paper proves that, for any point lattice, the sequential two-scan chamfer algorithm produces correct distance maps. Finally, the definitions and computation of weighted distances are applied to the face-centered cubic (FCC) and body-centered cubic (BCC) grids.
Full work available at URL: https://arxiv.org/abs/0808.0665
Recommendations
- Weighted distances based on neighborhood sequences for point-lattices
- Weighted complete intersections and lattice points
- The weighted Poincaré distance in the half plane
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- scientific article; zbMATH DE number 2079737
- On distance matrices and Laplacians
- Computing the weight distribution of a set of points obtained by scaling, shifting, and truncating a lattice
- On weighted distances on the Khalimsky grid
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- On the sum of the squared multiplicities of the distances in a point set over finite spaces
Cites Work
- Title not available (Why is that?)
- Sequential Operations in Digital Picture Processing
- Chamfer metrics in mathematical morphology
- Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D
- Digital Distance Transforms in 3D Images Using Information from Neighbourhoods up to 5×5×5
- Weighted digital distance transforms in four dimensions
- Knight's distance in digital geometry
- Systematized calculation of optimal coefficients of 3-D chamfer norms.
- Look-up tables for medial axis on squared Euclidean distance transform.
Cited In (14)
- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms
- Non-traditional grids embedded in \(\mathbb Z^{n}\)
- Distance-driven curve-thinning on the face-centered cubic grid
- Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
- Computing the weight distribution of a set of points obtained by scaling, shifting, and truncating a lattice
- Distance-oriented surface skeletonization on the face-centered cubic grid
- Distance transform computation for digital distance functions
- Digital distance functions on three-dimensional grids
- Separable distance transformation and its applications
- On weighted distances on the Khalimsky grid
- Weighted distances based on neighborhood sequences for point-lattices
- Lower and upper bounds for scaling factors used for integer approximation of 3D anisotropic chamfer distance operator
- Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands
Uses Software
This page was built for publication: Weighted distance transforms generalized to modules and their computation on point lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885192)
