Volumetric Analysis of Digital Objects Using Distance Transformation: Performance Issues and Extensions

Cœurjolly, David

doi:10.1007/978-3-642-32313-3_6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Implementation Details and Experimental Analysis1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Beside these predicates for L p metrics, DGtal also contains a generic metric adapter: if the user specifies a distance function (taking two points and returning a value) corresponding to a norm with axis symmetric unit ball, generic Closest and HiddenBy pred-icates can be automatically constructed. Please note that since all algorithms are separable, the generic framework provided in DGtal allow us to have a free multi-thread implementation [14].…”

Section: Implementation Details and Experimental Analysismentioning

confidence: 99%

See 1 more Smart Citation

2D Subquadratic Separable Distance Transformation for Path-Based Norms

Cœurjolly

2014

Advanced Information Systems Engineering

Self Cite

View full text Add to dashboard Cite

In many applications, separable algorithms have demonstrated their efficiency to perform high performance and parallel volumetric computations, such as distance transformation or medial axis extraction. In the literature, several authors have discussed about conditions on the metric to be considered in a separable approach. In this article, we present generic separable algorithms to efficiently compute Voronoi maps and distance transformations for a large class of metrics. Focusing on path based norms (chamfer masks, neighborhood sequences, ...), we detail a subquadratic algorithm to compute such volumetric transformation in dimension 2. More precisely, we describe a O(log 2 m • N 2) algorithm for shapes in a N × N domain with chamfer norm of size m.

show abstract

Section: Implementation Details and Experimental Analysismentioning

confidence: 99%

“…. (please refer to [14] for a discussion). For path-based metrics (chamfer mask, -weighted-neighborhood sequences,.…”

Section: Introductionmentioning

confidence: 99%