Skip to Main content Skip to Navigation
Journal articles

On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels

Abstract : Critical kernels constitute a general framework in the category of abstract complexes for the study of parallel homotopic thinning in any dimension. In this article, we present new results linking critical kernels to minimal non-simple sets (MNS) and P-simple points, which are notions conceived to study parallel thinning in discrete grids. We show that these two previously introduced notions can be retrieved, better understood and enriched in the framework of critical kernels. In particular, we propose new characterizations which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting P-simple points and minimal non-simple sets.
Document type :
Journal articles
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00731784
Contributor : Michel Couprie <>
Submitted on : Thursday, September 13, 2012 - 1:36:13 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Friday, December 14, 2012 - 3:57:18 AM

File

mns4d_R1.pdf
Files produced by the author(s)

Identifiers

Citation

Gilles Bertrand, Michel Couprie. On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels. Journal of Mathematical Imaging and Vision, Springer Verlag, 2009, 35 (1), pp.23-35. ⟨10.1007/s10851-009-0152-3⟩. ⟨hal-00731784⟩

Share

Metrics

Record views

391

Files downloads

405